java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/nla-digbench/egcd2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:35:43,276 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:35:43,278 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:35:43,289 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:35:43,290 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:35:43,291 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:35:43,292 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:35:43,294 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:35:43,295 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:35:43,296 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:35:43,299 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:35:43,300 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:35:43,301 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:35:43,304 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:35:43,305 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:35:43,306 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:35:43,306 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:35:43,307 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:35:43,309 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:35:43,311 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:35:43,312 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:35:43,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:35:43,314 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:35:43,315 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:35:43,317 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:35:43,317 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:35:43,318 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:35:43,318 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:35:43,319 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:35:43,320 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:35:43,320 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:35:43,320 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:35:43,321 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:35:43,322 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:35:43,323 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:35:43,323 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:35:43,324 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:35:43,324 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:35:43,324 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:35:43,325 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:35:43,325 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:35:43,326 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-10-03 02:35:43,341 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:35:43,341 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:35:43,341 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:35:43,341 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:35:43,342 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:35:43,342 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:35:43,342 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:35:43,343 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:35:43,343 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:35:43,343 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:35:43,344 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:35:43,344 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:35:43,344 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:35:43,344 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:35:43,344 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:35:43,345 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:35:43,345 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:35:43,345 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:35:43,345 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:35:43,345 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:35:43,346 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:35:43,346 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:35:43,346 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:35:43,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:35:43,346 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:35:43,347 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:35:43,347 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:35:43,347 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:35:43,347 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:35:43,347 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:35:43,374 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:35:43,386 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:35:43,389 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:35:43,391 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:35:43,391 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:35:43,392 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/egcd2.c [2019-10-03 02:35:43,449 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91778f5e1/68dbbccabaaf4e38aa33d9fe47c6ae8b/FLAG394e49bb3 [2019-10-03 02:35:43,863 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:35:43,863 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/egcd2.c [2019-10-03 02:35:43,871 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91778f5e1/68dbbccabaaf4e38aa33d9fe47c6ae8b/FLAG394e49bb3 [2019-10-03 02:35:44,268 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91778f5e1/68dbbccabaaf4e38aa33d9fe47c6ae8b [2019-10-03 02:35:44,276 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:35:44,277 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:35:44,279 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:35:44,279 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:35:44,283 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:35:44,284 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:35:44" (1/1) ... [2019-10-03 02:35:44,287 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39cbab6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:35:44, skipping insertion in model container [2019-10-03 02:35:44,287 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:35:44" (1/1) ... [2019-10-03 02:35:44,294 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:35:44,312 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:35:44,470 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:35:44,474 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:35:44,496 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:35:44,509 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:35:44,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:35:44 WrapperNode [2019-10-03 02:35:44,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:35:44,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:35:44,510 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:35:44,510 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:35:44,610 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:35:44" (1/1) ... [2019-10-03 02:35:44,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:35:44" (1/1) ... [2019-10-03 02:35:44,619 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:35:44" (1/1) ... [2019-10-03 02:35:44,619 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:35:44" (1/1) ... [2019-10-03 02:35:44,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:35:44" (1/1) ... [2019-10-03 02:35:44,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:35:44" (1/1) ... [2019-10-03 02:35:44,644 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:35:44" (1/1) ... [2019-10-03 02:35:44,647 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:35:44,648 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:35:44,648 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:35:44,648 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:35:44,649 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:35:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:35:44,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:35:44,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:35:44,702 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-03 02:35:44,702 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:35:44,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:35:44,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:35:44,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-03 02:35:44,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-03 02:35:44,702 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:35:44,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:35:44,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:35:44,936 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:35:44,936 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-03 02:35:44,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:35:44 BoogieIcfgContainer [2019-10-03 02:35:44,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:35:44,940 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:35:44,940 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:35:44,944 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:35:44,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:35:44" (1/3) ... [2019-10-03 02:35:44,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28494ea8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:35:44, skipping insertion in model container [2019-10-03 02:35:44,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:35:44" (2/3) ... [2019-10-03 02:35:44,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28494ea8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:35:44, skipping insertion in model container [2019-10-03 02:35:44,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:35:44" (3/3) ... [2019-10-03 02:35:44,963 INFO L109 eAbstractionObserver]: Analyzing ICFG egcd2.c [2019-10-03 02:35:44,987 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:35:45,003 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:35:45,031 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:35:45,054 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:35:45,054 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:35:45,054 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:35:45,054 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:35:45,055 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:35:45,055 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:35:45,055 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:35:45,055 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:35:45,070 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-10-03 02:35:45,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-03 02:35:45,080 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:45,081 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:45,083 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:45,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:45,088 INFO L82 PathProgramCache]: Analyzing trace with hash -558324168, now seen corresponding path program 1 times [2019-10-03 02:35:45,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:45,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:45,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:45,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:45,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:45,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:45,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:45,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:35:45,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-03 02:35:45,200 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:35:45,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:35:45,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:35:45,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:35:45,218 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-10-03 02:35:45,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:45,246 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2019-10-03 02:35:45,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:35:45,247 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-10-03 02:35:45,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:45,263 INFO L225 Difference]: With dead ends: 27 [2019-10-03 02:35:45,263 INFO L226 Difference]: Without dead ends: 22 [2019-10-03 02:35:45,268 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:35:45,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-03 02:35:45,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-03 02:35:45,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-03 02:35:45,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2019-10-03 02:35:45,329 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 10 [2019-10-03 02:35:45,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:45,329 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-10-03 02:35:45,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:35:45,330 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2019-10-03 02:35:45,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-03 02:35:45,332 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:45,332 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:45,332 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:45,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:45,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1008536757, now seen corresponding path program 1 times [2019-10-03 02:35:45,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:45,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:45,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:45,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:45,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:45,367 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-03 02:35:45,368 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-03 02:35:45,368 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-10-03 02:35:45,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:45,413 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-10-03 02:35:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:45,433 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-10-03 02:35:45,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:35:45,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:45,438 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) [2019-10-03 02:35:45,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:45,482 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:35:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:45,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-03 02:35:45,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:35:45,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:45,575 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:45,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:45,603 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:35:45,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-03 02:35:45,603 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:35:45,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:35:45,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:35:45,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:35:45,605 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand 3 states. [2019-10-03 02:35:45,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:45,639 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2019-10-03 02:35:45,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:35:45,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-03 02:35:45,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:45,641 INFO L225 Difference]: With dead ends: 31 [2019-10-03 02:35:45,641 INFO L226 Difference]: Without dead ends: 31 [2019-10-03 02:35:45,642 INFO L640 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-10-03 02:35:45,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-03 02:35:45,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2019-10-03 02:35:45,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-03 02:35:45,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2019-10-03 02:35:45,652 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 11 [2019-10-03 02:35:45,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:45,652 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-10-03 02:35:45,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:35:45,653 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2019-10-03 02:35:45,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-03 02:35:45,654 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:45,654 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:45,654 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:45,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:45,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1182801044, now seen corresponding path program 1 times [2019-10-03 02:35:45,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:45,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:45,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:45,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:45,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:45,664 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-03 02:35:45,664 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-03 02:35:45,664 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) [2019-10-03 02:35:45,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:45,691 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-03 02:35:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Exception during sending of exit command (exit): Stream closed [2019-10-03 02:35:45,716 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-10-03 02:35:45,716 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:35:45,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:45,716 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-10-03 02:35:45,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:45,739 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:35:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:45,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-03 02:35:45,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:35:45,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:45,781 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:45,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:45,823 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:35:45,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2019-10-03 02:35:45,824 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:35:45,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:35:45,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:35:45,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:35:45,825 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 5 states. [2019-10-03 02:35:45,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:45,909 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2019-10-03 02:35:45,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:35:45,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-10-03 02:35:45,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:45,911 INFO L225 Difference]: With dead ends: 35 [2019-10-03 02:35:45,911 INFO L226 Difference]: Without dead ends: 35 [2019-10-03 02:35:45,911 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:35:45,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-03 02:35:45,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2019-10-03 02:35:45,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-03 02:35:45,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-10-03 02:35:45,919 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 12 [2019-10-03 02:35:45,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:45,919 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-10-03 02:35:45,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:35:45,920 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-10-03 02:35:45,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-03 02:35:45,920 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:45,920 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:45,921 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:45,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:45,921 INFO L82 PathProgramCache]: Analyzing trace with hash -2031293851, now seen corresponding path program 1 times [2019-10-03 02:35:45,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:45,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:45,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:45,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:45,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:45,930 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-03 02:35:45,931 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-03 02:35:45,931 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-03 02:35:45,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:45,951 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-10-03 02:35:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:45,962 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2019-10-03 02:35:45,965 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [18], [27], [48], [51], [53], [56], [58], [59], [60], [61], [63], [64], [65] [2019-10-03 02:35:45,998 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:35:45,999 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:35:46,136 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 02:35:46,138 INFO L272 AbstractInterpreter]: Visited 15 different actions 15 times. Never merged. Never widened. Performed 55 root evaluator evaluations with a maximum evaluation depth of 8. Performed 55 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Never found a fixpoint. Largest state had 12 variables. [2019-10-03 02:35:46,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:46,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 02:35:46,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:46,142 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-10-03 02:35:46,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:46,179 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:35:46,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:46,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-03 02:35:46,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:35:46,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:46,257 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:46,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:46,317 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:35:46,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-10-03 02:35:46,318 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:35:46,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:35:46,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:35:46,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:35:46,319 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 5 states. [2019-10-03 02:35:46,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:46,389 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2019-10-03 02:35:46,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:35:46,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-03 02:35:46,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:46,392 INFO L225 Difference]: With dead ends: 43 [2019-10-03 02:35:46,392 INFO L226 Difference]: Without dead ends: 43 [2019-10-03 02:35:46,393 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:35:46,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-03 02:35:46,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-10-03 02:35:46,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-03 02:35:46,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2019-10-03 02:35:46,410 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 17 [2019-10-03 02:35:46,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:46,410 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2019-10-03 02:35:46,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:35:46,410 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2019-10-03 02:35:46,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-03 02:35:46,411 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:46,411 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:46,412 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:46,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:46,413 INFO L82 PathProgramCache]: Analyzing trace with hash -71864628, now seen corresponding path program 1 times [2019-10-03 02:35:46,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:46,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:46,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:46,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:46,421 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:46,435 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-03 02:35:46,436 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-03 02:35:46,436 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-03 02:35:46,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:46,460 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-10-03 02:35:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:46,476 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2019-10-03 02:35:46,476 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [18], [27], [48], [51], [53], [56], [58], [59], [60], [61], [63], [64], [65], [66], [67] [2019-10-03 02:35:46,479 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:35:46,480 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:35:46,547 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 02:35:46,548 INFO L272 AbstractInterpreter]: Visited 15 different actions 15 times. Never merged. Never widened. Performed 55 root evaluator evaluations with a maximum evaluation depth of 8. Performed 55 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Never found a fixpoint. Largest state had 12 variables. [2019-10-03 02:35:46,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:46,549 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 02:35:46,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:46,549 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-10-03 02:35:46,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:46,565 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:35:46,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:46,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-03 02:35:46,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:35:46,617 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-03 02:35:46,617 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:46,662 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-03 02:35:46,666 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:35:46,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-10-03 02:35:46,666 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:35:46,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:35:46,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:35:46,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:35:46,667 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand 5 states. [2019-10-03 02:35:46,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:46,745 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2019-10-03 02:35:46,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:35:46,746 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-03 02:35:46,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:46,747 INFO L225 Difference]: With dead ends: 47 [2019-10-03 02:35:46,748 INFO L226 Difference]: Without dead ends: 47 [2019-10-03 02:35:46,749 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:35:46,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-03 02:35:46,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-10-03 02:35:46,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-03 02:35:46,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2019-10-03 02:35:46,761 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 22 [2019-10-03 02:35:46,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:46,761 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2019-10-03 02:35:46,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:35:46,761 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2019-10-03 02:35:46,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-03 02:35:46,765 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:46,765 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:46,765 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:46,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:46,766 INFO L82 PathProgramCache]: Analyzing trace with hash 954332139, now seen corresponding path program 1 times [2019-10-03 02:35:46,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:46,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:46,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:46,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:46,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:46,787 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-03 02:35:46,787 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-03 02:35:46,787 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-10-03 02:35:46,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:46,824 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-10-03 02:35:46,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:46,840 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2019-10-03 02:35:46,840 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [18], [27], [36], [48], [51], [53], [56], [58], [59], [60], [61], [63], [64], [65], [66], [67], [68], [69], [70] [2019-10-03 02:35:46,842 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:35:46,842 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:35:46,866 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 02:35:46,867 INFO L272 AbstractInterpreter]: Visited 15 different actions 15 times. Never merged. Never widened. Performed 55 root evaluator evaluations with a maximum evaluation depth of 8. Performed 55 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Never found a fixpoint. Largest state had 12 variables. [2019-10-03 02:35:46,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:46,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 02:35:46,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:46,867 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-10-03 02:35:46,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:46,895 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:35:46,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:46,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-03 02:35:46,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:35:46,956 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-03 02:35:46,956 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:47,032 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-03 02:35:47,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-03 02:35:47,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-10-03 02:35:47,036 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:35:47,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:35:47,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:35:47,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:35:47,038 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand 9 states. [2019-10-03 02:35:47,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:47,192 INFO L93 Difference]: Finished difference Result 72 states and 99 transitions. [2019-10-03 02:35:47,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:35:47,192 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-10-03 02:35:47,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:47,194 INFO L225 Difference]: With dead ends: 72 [2019-10-03 02:35:47,194 INFO L226 Difference]: Without dead ends: 72 [2019-10-03 02:35:47,195 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:35:47,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-03 02:35:47,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 42. [2019-10-03 02:35:47,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-03 02:35:47,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2019-10-03 02:35:47,204 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 34 [2019-10-03 02:35:47,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:47,204 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2019-10-03 02:35:47,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:35:47,205 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2019-10-03 02:35:47,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-03 02:35:47,206 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:47,206 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:47,207 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:47,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:47,207 INFO L82 PathProgramCache]: Analyzing trace with hash 286726549, now seen corresponding path program 1 times [2019-10-03 02:35:47,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:47,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:47,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:47,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:47,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:47,216 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-03 02:35:47,216 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-03 02:35:47,216 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-03 02:35:47,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:47,245 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-10-03 02:35:47,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:47,260 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2019-10-03 02:35:47,260 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [16], [18], [27], [34], [40], [48], [51], [53], [56], [58], [59], [60], [61], [63], [64], [65], [66], [67], [68], [69], [70], [71] [2019-10-03 02:35:47,263 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:35:47,263 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:35:47,308 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 02:35:47,309 INFO L272 AbstractInterpreter]: Visited 17 different actions 22 times. Never merged. Never widened. Performed 61 root evaluator evaluations with a maximum evaluation depth of 8. Performed 61 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Never found a fixpoint. Largest state had 13 variables. [2019-10-03 02:35:47,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:47,309 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 02:35:47,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:47,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:35:47,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:47,336 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:35:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:47,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-03 02:35:47,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:35:47,397 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-03 02:35:47,397 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:47,427 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-03 02:35:47,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-03 02:35:47,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-10-03 02:35:47,431 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:35:47,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:35:47,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:35:47,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:35:47,432 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand 5 states. [2019-10-03 02:35:47,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:47,516 INFO L93 Difference]: Finished difference Result 81 states and 116 transitions. [2019-10-03 02:35:47,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:35:47,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-10-03 02:35:47,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:47,518 INFO L225 Difference]: With dead ends: 81 [2019-10-03 02:35:47,518 INFO L226 Difference]: Without dead ends: 81 [2019-10-03 02:35:47,519 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:35:47,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-03 02:35:47,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2019-10-03 02:35:47,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-03 02:35:47,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 101 transitions. [2019-10-03 02:35:47,534 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 101 transitions. Word has length 36 [2019-10-03 02:35:47,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:47,535 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 101 transitions. [2019-10-03 02:35:47,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:35:47,535 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 101 transitions. [2019-10-03 02:35:47,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-03 02:35:47,537 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:47,537 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:47,537 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:47,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:47,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1803964113, now seen corresponding path program 1 times [2019-10-03 02:35:47,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:47,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:47,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:47,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:47,541 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:47,551 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-03 02:35:47,551 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-03 02:35:47,552 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-10-03 02:35:47,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:47,574 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-03 02:35:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:47,589 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2019-10-03 02:35:47,590 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [18], [27], [34], [40], [48], [51], [53], [56], [58], [59], [60], [61], [63], [64], [65], [66], [67], [68], [69], [70] [2019-10-03 02:35:47,598 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:35:47,598 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:35:47,625 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 02:35:47,625 INFO L272 AbstractInterpreter]: Visited 15 different actions 15 times. Never merged. Never widened. Performed 55 root evaluator evaluations with a maximum evaluation depth of 8. Performed 55 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Never found a fixpoint. Largest state had 13 variables. [2019-10-03 02:35:47,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:47,626 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 02:35:47,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:47,626 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-10-03 02:35:47,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:47,664 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:35:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:47,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-03 02:35:47,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:35:47,734 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-03 02:35:47,734 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:47,796 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-03 02:35:47,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-03 02:35:47,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-10-03 02:35:47,799 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:35:47,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:35:47,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:35:47,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:35:47,801 INFO L87 Difference]: Start difference. First operand 72 states and 101 transitions. Second operand 10 states. [2019-10-03 02:35:48,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:48,677 INFO L93 Difference]: Finished difference Result 111 states and 161 transitions. [2019-10-03 02:35:48,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:35:48,677 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2019-10-03 02:35:48,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:48,679 INFO L225 Difference]: With dead ends: 111 [2019-10-03 02:35:48,679 INFO L226 Difference]: Without dead ends: 110 [2019-10-03 02:35:48,680 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:35:48,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-03 02:35:48,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2019-10-03 02:35:48,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-03 02:35:48,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 156 transitions. [2019-10-03 02:35:48,693 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 156 transitions. Word has length 42 [2019-10-03 02:35:48,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:48,693 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 156 transitions. [2019-10-03 02:35:48,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:35:48,693 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 156 transitions. [2019-10-03 02:35:48,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-03 02:35:48,695 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:48,695 INFO L411 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:48,695 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:48,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:48,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1108781502, now seen corresponding path program 2 times [2019-10-03 02:35:48,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:48,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:48,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:48,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:48,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:48,702 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-03 02:35:48,702 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-03 02:35:48,702 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-10-03 02:35:48,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:35:48,729 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-10-03 02:35:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:48,744 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:35:48,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:35:48,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:48,745 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) [2019-10-03 02:35:48,772 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:35:48,772 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:35:48,795 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-03 02:35:48,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:35:48,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-03 02:35:48,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:35:48,883 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-03 02:35:48,883 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:49,010 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-03 02:35:49,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-03 02:35:49,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-10-03 02:35:49,013 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:35:49,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 02:35:49,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 02:35:49,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:35:49,015 INFO L87 Difference]: Start difference. First operand 107 states and 156 transitions. Second operand 12 states. [2019-10-03 02:35:49,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:49,970 INFO L93 Difference]: Finished difference Result 166 states and 245 transitions. [2019-10-03 02:35:49,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:35:49,971 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2019-10-03 02:35:49,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:49,974 INFO L225 Difference]: With dead ends: 166 [2019-10-03 02:35:49,974 INFO L226 Difference]: Without dead ends: 165 [2019-10-03 02:35:49,975 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:35:49,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-10-03 02:35:49,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 160. [2019-10-03 02:35:49,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-10-03 02:35:49,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 238 transitions. [2019-10-03 02:35:49,991 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 238 transitions. Word has length 47 [2019-10-03 02:35:49,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:49,992 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 238 transitions. [2019-10-03 02:35:49,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 02:35:49,992 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 238 transitions. [2019-10-03 02:35:49,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-03 02:35:49,994 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:49,994 INFO L411 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:49,994 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:49,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:49,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1556128492, now seen corresponding path program 1 times [2019-10-03 02:35:49,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:49,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:49,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:35:49,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:49,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:50,002 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-03 02:35:50,002 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-03 02:35:50,002 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-10-03 02:35:50,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:50,028 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-10-03 02:35:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:50,046 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2019-10-03 02:35:50,046 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [16], [18], [27], [34], [36], [40], [48], [51], [53], [56], [58], [59], [60], [61], [63], [64], [65], [66], [67], [68], [69], [70], [71] [2019-10-03 02:35:50,049 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:35:50,049 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:35:50,067 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 02:35:50,067 INFO L272 AbstractInterpreter]: Visited 17 different actions 22 times. Never merged. Never widened. Performed 61 root evaluator evaluations with a maximum evaluation depth of 8. Performed 61 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Never found a fixpoint. Largest state had 13 variables. [2019-10-03 02:35:50,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:50,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 02:35:50,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:50,068 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-10-03 02:35:50,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:50,100 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:35:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:50,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-03 02:35:50,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:35:50,239 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-03 02:35:50,239 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:50,426 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-03 02:35:50,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-03 02:35:50,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-10-03 02:35:50,433 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:35:50,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-03 02:35:50,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-03 02:35:50,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-10-03 02:35:50,435 INFO L87 Difference]: Start difference. First operand 160 states and 238 transitions. Second operand 16 states. [2019-10-03 02:35:51,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:51,995 INFO L93 Difference]: Finished difference Result 278 states and 429 transitions. [2019-10-03 02:35:51,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-03 02:35:51,996 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2019-10-03 02:35:51,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:52,000 INFO L225 Difference]: With dead ends: 278 [2019-10-03 02:35:52,000 INFO L226 Difference]: Without dead ends: 276 [2019-10-03 02:35:52,001 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=186, Invalid=806, Unknown=0, NotChecked=0, Total=992 [2019-10-03 02:35:52,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-10-03 02:35:52,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 272. [2019-10-03 02:35:52,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-10-03 02:35:52,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 420 transitions. [2019-10-03 02:35:52,026 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 420 transitions. Word has length 58 [2019-10-03 02:35:52,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:52,026 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 420 transitions. [2019-10-03 02:35:52,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-03 02:35:52,027 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 420 transitions. [2019-10-03 02:35:52,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-03 02:35:52,028 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:52,029 INFO L411 BasicCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:52,029 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:52,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:52,029 INFO L82 PathProgramCache]: Analyzing trace with hash 419798924, now seen corresponding path program 3 times [2019-10-03 02:35:52,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:52,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:52,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:52,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:52,032 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:52,037 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-03 02:35:52,037 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-03 02:35:52,037 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-10-03 02:35:52,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:35:52,084 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-10-03 02:35:52,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:52,107 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:35:52,107 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:35:52,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:52,107 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-10-03 02:35:52,139 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 02:35:52,139 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-10-03 02:35:52,167 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 02:35:52,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:35:52,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-03 02:35:52,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:35:52,215 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-10-03 02:35:52,216 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:52,287 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-03 02:35:52,291 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:35:52,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-10-03 02:35:52,292 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:35:52,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:35:52,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:35:52,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:35:52,293 INFO L87 Difference]: Start difference. First operand 272 states and 420 transitions. Second operand 5 states. [2019-10-03 02:35:52,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:52,385 INFO L93 Difference]: Finished difference Result 197 states and 288 transitions. [2019-10-03 02:35:52,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:35:52,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-10-03 02:35:52,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:52,388 INFO L225 Difference]: With dead ends: 197 [2019-10-03 02:35:52,388 INFO L226 Difference]: Without dead ends: 197 [2019-10-03 02:35:52,388 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:35:52,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-10-03 02:35:52,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2019-10-03 02:35:52,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-10-03 02:35:52,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 288 transitions. [2019-10-03 02:35:52,401 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 288 transitions. Word has length 72 [2019-10-03 02:35:52,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:52,401 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 288 transitions. [2019-10-03 02:35:52,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:35:52,402 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 288 transitions. [2019-10-03 02:35:52,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-03 02:35:52,404 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:52,404 INFO L411 BasicCegarLoop]: trace histogram [15, 14, 14, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:52,404 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:52,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:52,405 INFO L82 PathProgramCache]: Analyzing trace with hash 135833028, now seen corresponding path program 1 times [2019-10-03 02:35:52,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:52,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:52,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:35:52,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:52,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:52,411 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-03 02:35:52,411 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-03 02:35:52,412 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) [2019-10-03 02:35:52,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:52,442 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-03 02:35:52,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:52,463 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 92 with the following transitions: [2019-10-03 02:35:52,463 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [18], [27], [34], [36], [40], [48], [51], [53], [56], [58], [59], [60], [61], [63], [64], [65], [66], [67], [68], [69], [70] [2019-10-03 02:35:52,466 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:35:52,466 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:35:52,481 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 02:35:52,481 INFO L272 AbstractInterpreter]: Visited 15 different actions 15 times. Never merged. Never widened. Performed 55 root evaluator evaluations with a maximum evaluation depth of 8. Performed 55 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Never found a fixpoint. Largest state had 13 variables. [2019-10-03 02:35:52,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:52,481 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 02:35:52,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:52,482 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:35:52,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:52,512 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:35:52,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:52,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-03 02:35:52,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:35:52,736 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 28 proven. 32 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-10-03 02:35:52,736 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:52,958 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 28 proven. 32 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-10-03 02:35:52,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-03 02:35:52,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-10-03 02:35:52,962 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:35:52,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-03 02:35:52,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-03 02:35:52,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-10-03 02:35:52,965 INFO L87 Difference]: Start difference. First operand 197 states and 288 transitions. Second operand 16 states. [2019-10-03 02:35:53,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:53,939 INFO L93 Difference]: Finished difference Result 228 states and 331 transitions. [2019-10-03 02:35:53,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:35:53,940 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 91 [2019-10-03 02:35:53,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:53,942 INFO L225 Difference]: With dead ends: 228 [2019-10-03 02:35:53,942 INFO L226 Difference]: Without dead ends: 220 [2019-10-03 02:35:53,942 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2019-10-03 02:35:53,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-10-03 02:35:53,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 196. [2019-10-03 02:35:53,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-10-03 02:35:53,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 283 transitions. [2019-10-03 02:35:53,957 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 283 transitions. Word has length 91 [2019-10-03 02:35:53,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:53,958 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 283 transitions. [2019-10-03 02:35:53,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-03 02:35:53,959 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 283 transitions. [2019-10-03 02:35:53,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-03 02:35:53,963 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:53,963 INFO L411 BasicCegarLoop]: trace histogram [17, 16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:53,964 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:53,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:53,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1549930679, now seen corresponding path program 2 times [2019-10-03 02:35:53,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:53,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:53,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:53,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:53,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:53,970 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-03 02:35:53,971 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-03 02:35:53,971 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-03 02:35:53,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:35:53,999 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-10-03 02:35:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:54,025 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:35:54,025 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:35:54,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:54,025 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:35:54,051 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:35:54,051 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:35:54,087 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-03 02:35:54,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:35:54,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-03 02:35:54,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:35:54,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:35:54,306 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 67 proven. 43 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2019-10-03 02:35:54,306 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:54,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:35:54,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:36:00,760 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 67 proven. 47 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-10-03 02:36:00,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-03 02:36:00,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2019-10-03 02:36:00,764 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:36:00,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-03 02:36:00,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-03 02:36:00,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=353, Unknown=3, NotChecked=0, Total=420 [2019-10-03 02:36:00,765 INFO L87 Difference]: Start difference. First operand 196 states and 283 transitions. Second operand 21 states. [2019-10-03 02:36:19,195 WARN L191 SmtUtils]: Spent 6.51 s on a formula simplification that was a NOOP. DAG size: 55 [2019-10-03 02:36:47,266 WARN L191 SmtUtils]: Spent 6.06 s on a formula simplification that was a NOOP. DAG size: 51 [2019-10-03 02:37:05,487 WARN L191 SmtUtils]: Spent 9.92 s on a formula simplification that was a NOOP. DAG size: 68 [2019-10-03 02:37:26,412 WARN L191 SmtUtils]: Spent 12.37 s on a formula simplification that was a NOOP. DAG size: 72 [2019-10-03 02:37:49,367 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification that was a NOOP. DAG size: 61 [2019-10-03 02:38:17,299 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 35 [2019-10-03 02:38:32,062 WARN L191 SmtUtils]: Spent 14.09 s on a formula simplification that was a NOOP. DAG size: 66 [2019-10-03 02:38:32,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:32,091 INFO L93 Difference]: Finished difference Result 219 states and 303 transitions. [2019-10-03 02:38:32,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-03 02:38:32,092 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 105 [2019-10-03 02:38:32,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:32,093 INFO L225 Difference]: With dead ends: 219 [2019-10-03 02:38:32,093 INFO L226 Difference]: Without dead ends: 214 [2019-10-03 02:38:32,094 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 104.7s TimeCoverageRelationStatistics Valid=241, Invalid=1071, Unknown=20, NotChecked=0, Total=1332 [2019-10-03 02:38:32,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-10-03 02:38:32,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 166. [2019-10-03 02:38:32,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-10-03 02:38:32,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 218 transitions. [2019-10-03 02:38:32,104 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 218 transitions. Word has length 105 [2019-10-03 02:38:32,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:32,105 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 218 transitions. [2019-10-03 02:38:32,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-03 02:38:32,105 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 218 transitions. [2019-10-03 02:38:32,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-03 02:38:32,110 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:32,110 INFO L411 BasicCegarLoop]: trace histogram [29, 28, 28, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:32,111 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:32,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:32,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1211103859, now seen corresponding path program 3 times [2019-10-03 02:38:32,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:32,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:32,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:38:32,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:32,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:32,124 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-03 02:38:32,125 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-03 02:38:32,125 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-03 02:38:32,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:38:32,168 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-10-03 02:38:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:32,211 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:38:32,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:38:32,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:38:32,212 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-10-03 02:38:32,244 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 02:38:32,244 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-10-03 02:38:32,293 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 02:38:32,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:38:32,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 94 conjunts are in the unsatisfiable core [2019-10-03 02:38:32,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:38:32,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:38:32,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1709 backedges. 126 proven. 340 refuted. 0 times theorem prover too weak. 1243 trivial. 0 not checked. [2019-10-03 02:38:32,689 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:38:32,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:38:32,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:38:32,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:38:33,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:38:34,140 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-10-03 02:38:34,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:38:34,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:38:38,955 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (not (= |c___VERIFIER_assert_#in~cond| 0))) (.cse0 (not (= |c___VERIFIER_assert_#in~cond| 1)))) (and (or .cse0 (forall ((v_main_~s~0_BEFORE_CALL_149 Int) (v_main_~c~0_BEFORE_CALL_143 Int) (v_main_~q~0_BEFORE_CALL_157 Int) (v_main_~r~0_BEFORE_CALL_138 Int) (v_main_~y~0_BEFORE_CALL_150 Int) (v_main_~k~0_BEFORE_CALL_127 Int) (v_main_~p~0_BEFORE_CALL_138 Int) (v_main_~x~0_BEFORE_CALL_164 Int)) (let ((.cse1 (+ (* v_main_~x~0_BEFORE_CALL_164 v_main_~q~0_BEFORE_CALL_157) (* v_main_~y~0_BEFORE_CALL_150 v_main_~s~0_BEFORE_CALL_149)))) (or (not (= 0 (mod (+ v_main_~c~0_BEFORE_CALL_143 .cse1) (- 2)))) (= 0 (let ((.cse2 (+ v_main_~k~0_BEFORE_CALL_127 1))) (+ (* (+ (* (- 2) v_main_~s~0_BEFORE_CALL_149) (* (+ (- (* .cse2 v_main_~s~0_BEFORE_CALL_149)) v_main_~r~0_BEFORE_CALL_138) 3)) v_main_~y~0_BEFORE_CALL_150) (* (+ (* (- 2) v_main_~q~0_BEFORE_CALL_157) (* (+ v_main_~p~0_BEFORE_CALL_138 (- (* .cse2 v_main_~q~0_BEFORE_CALL_157))) 3)) v_main_~x~0_BEFORE_CALL_164)))) (exists ((main_~q~0 Int) (main_~s~0 Int)) (and (not (= 0 (let ((.cse3 (+ v_main_~k~0_BEFORE_CALL_127 1))) (+ (* (+ (* (- 2) main_~q~0) (* (+ v_main_~p~0_BEFORE_CALL_138 (- (* main_~q~0 .cse3))) 3)) v_main_~x~0_BEFORE_CALL_164) (* (+ (* (+ (- (* main_~s~0 .cse3)) v_main_~r~0_BEFORE_CALL_138) 3) (* (- 2) main_~s~0)) v_main_~y~0_BEFORE_CALL_150))))) (= (+ (* v_main_~y~0_BEFORE_CALL_150 main_~s~0) (* main_~q~0 v_main_~x~0_BEFORE_CALL_164)) (+ (* v_main_~x~0_BEFORE_CALL_164 v_main_~q~0_BEFORE_CALL_157) (* v_main_~y~0_BEFORE_CALL_150 v_main_~s~0_BEFORE_CALL_149))))) (not (= (+ (div (+ (* (- 1) v_main_~c~0_BEFORE_CALL_143) .cse1) (- 2)) v_main_~c~0_BEFORE_CALL_143) (* 2 .cse1))))))) (or .cse4 (forall ((v_main_~s~0_BEFORE_CALL_149 Int) (v_main_~b~0_BEFORE_CALL_126 Int) (v_main_~c~0_BEFORE_CALL_143 Int) (v_main_~q~0_BEFORE_CALL_157 Int) (v_main_~r~0_BEFORE_CALL_138 Int) (v_main_~y~0_BEFORE_CALL_150 Int) (v_main_~k~0_BEFORE_CALL_127 Int) (v_main_~p~0_BEFORE_CALL_138 Int) (v_main_~x~0_BEFORE_CALL_164 Int)) (or (not (= 0 (mod (+ v_main_~c~0_BEFORE_CALL_143 v_main_~b~0_BEFORE_CALL_126) (- 2)))) (not (= (+ v_main_~c~0_BEFORE_CALL_143 (div (+ v_main_~b~0_BEFORE_CALL_126 (* (- 1) v_main_~c~0_BEFORE_CALL_143)) (- 2))) (* 2 v_main_~b~0_BEFORE_CALL_126))) (exists ((main_~q~0 Int) (main_~s~0 Int)) (and (not (= 0 (let ((.cse5 (+ v_main_~k~0_BEFORE_CALL_127 1))) (+ (* (+ (* (- 2) main_~q~0) (* (+ v_main_~p~0_BEFORE_CALL_138 (- (* main_~q~0 .cse5))) 3)) v_main_~x~0_BEFORE_CALL_164) (* (+ (* (+ (- (* main_~s~0 .cse5)) v_main_~r~0_BEFORE_CALL_138) 3) (* (- 2) main_~s~0)) v_main_~y~0_BEFORE_CALL_150))))) (= (+ (* v_main_~y~0_BEFORE_CALL_150 main_~s~0) (* main_~q~0 v_main_~x~0_BEFORE_CALL_164)) v_main_~b~0_BEFORE_CALL_126))) (= 0 (let ((.cse6 (+ v_main_~k~0_BEFORE_CALL_127 1))) (+ (* (+ (* (- 2) v_main_~s~0_BEFORE_CALL_149) (* (+ (- (* .cse6 v_main_~s~0_BEFORE_CALL_149)) v_main_~r~0_BEFORE_CALL_138) 3)) v_main_~y~0_BEFORE_CALL_150) (* (+ (* (- 2) v_main_~q~0_BEFORE_CALL_157) (* (+ v_main_~p~0_BEFORE_CALL_138 (- (* .cse6 v_main_~q~0_BEFORE_CALL_157))) 3)) v_main_~x~0_BEFORE_CALL_164)))) (= (+ (* v_main_~x~0_BEFORE_CALL_164 v_main_~q~0_BEFORE_CALL_157) (* v_main_~y~0_BEFORE_CALL_150 v_main_~s~0_BEFORE_CALL_149)) v_main_~b~0_BEFORE_CALL_126)))) (or .cse4 .cse0))) is different from true [2019-10-03 02:38:43,059 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-10-03 02:38:49,118 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| 0))) (.cse3 (not (= |c___VERIFIER_assert_#in~cond| 1)))) (and (or .cse0 (forall ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_main_~b~0_BEFORE_CALL_126 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_prenex_8 Int)) (or (exists ((v_prenex_10 Int) (v_prenex_9 Int)) (and (= (+ (* v_prenex_9 v_prenex_8) (* v_prenex_10 v_prenex_5)) v_main_~b~0_BEFORE_CALL_126) (not (= 0 (let ((.cse1 (+ v_prenex_6 1))) (+ (* v_prenex_5 (+ (* (- 2) v_prenex_10) (* (+ (- (* .cse1 v_prenex_10)) v_prenex_4) 3))) (* (+ (* (+ (- (* .cse1 v_prenex_9)) v_prenex_7) 3) (* (- 2) v_prenex_9)) v_prenex_8))))))) (not (= 0 (mod (+ v_prenex_2 v_main_~b~0_BEFORE_CALL_126) (- 2)))) (= (+ (* v_prenex_5 v_prenex_1) (* v_prenex_8 v_prenex_3)) v_main_~b~0_BEFORE_CALL_126) (= 0 (let ((.cse2 (+ v_prenex_6 1))) (+ (* v_prenex_5 (+ (* (- 2) v_prenex_1) (* (+ v_prenex_4 (- (* .cse2 v_prenex_1))) 3))) (* v_prenex_8 (+ (* 3 (+ v_prenex_7 (- (* .cse2 v_prenex_3)))) (* (- 2) v_prenex_3)))))) (not (= (+ v_prenex_2 (div (+ v_main_~b~0_BEFORE_CALL_126 (* (- 1) v_prenex_2)) (- 2))) (* 2 v_main_~b~0_BEFORE_CALL_126)))))) (or .cse3 (forall ((v_main_~s~0_BEFORE_CALL_149 Int) (v_main_~c~0_BEFORE_CALL_143 Int) (v_main_~q~0_BEFORE_CALL_157 Int) (v_main_~r~0_BEFORE_CALL_138 Int) (v_main_~y~0_BEFORE_CALL_150 Int) (v_main_~k~0_BEFORE_CALL_127 Int) (v_main_~p~0_BEFORE_CALL_138 Int) (v_main_~x~0_BEFORE_CALL_164 Int)) (let ((.cse4 (+ (* v_main_~x~0_BEFORE_CALL_164 v_main_~q~0_BEFORE_CALL_157) (* v_main_~y~0_BEFORE_CALL_150 v_main_~s~0_BEFORE_CALL_149)))) (or (not (= 0 (mod (+ v_main_~c~0_BEFORE_CALL_143 .cse4) (- 2)))) (= 0 (let ((.cse5 (+ v_main_~k~0_BEFORE_CALL_127 1))) (+ (* (+ (* (- 2) v_main_~s~0_BEFORE_CALL_149) (* (+ (- (* .cse5 v_main_~s~0_BEFORE_CALL_149)) v_main_~r~0_BEFORE_CALL_138) 3)) v_main_~y~0_BEFORE_CALL_150) (* (+ (* (- 2) v_main_~q~0_BEFORE_CALL_157) (* (+ v_main_~p~0_BEFORE_CALL_138 (- (* .cse5 v_main_~q~0_BEFORE_CALL_157))) 3)) v_main_~x~0_BEFORE_CALL_164)))) (exists ((main_~q~0 Int) (main_~s~0 Int)) (and (not (= 0 (let ((.cse6 (+ v_main_~k~0_BEFORE_CALL_127 1))) (+ (* (+ (* (- 2) main_~q~0) (* (+ v_main_~p~0_BEFORE_CALL_138 (- (* main_~q~0 .cse6))) 3)) v_main_~x~0_BEFORE_CALL_164) (* (+ (* (+ (- (* main_~s~0 .cse6)) v_main_~r~0_BEFORE_CALL_138) 3) (* (- 2) main_~s~0)) v_main_~y~0_BEFORE_CALL_150))))) (= (+ (* v_main_~y~0_BEFORE_CALL_150 main_~s~0) (* main_~q~0 v_main_~x~0_BEFORE_CALL_164)) (+ (* v_main_~x~0_BEFORE_CALL_164 v_main_~q~0_BEFORE_CALL_157) (* v_main_~y~0_BEFORE_CALL_150 v_main_~s~0_BEFORE_CALL_149))))) (not (= (+ (div (+ (* (- 1) v_main_~c~0_BEFORE_CALL_143) .cse4) (- 2)) v_main_~c~0_BEFORE_CALL_143) (* 2 .cse4))))))) (or .cse0 .cse3))) is different from true [2019-10-03 02:38:51,225 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-10-03 02:38:55,407 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| 1))) (.cse5 (not (= |c___VERIFIER_assert_#in~cond| 0))) (.cse1 (= 0 c___VERIFIER_assert_~cond))) (and (or .cse0 .cse1 (forall ((v_main_~s~0_BEFORE_CALL_149 Int) (v_main_~c~0_BEFORE_CALL_143 Int) (v_main_~q~0_BEFORE_CALL_157 Int) (v_main_~r~0_BEFORE_CALL_138 Int) (v_main_~y~0_BEFORE_CALL_150 Int) (v_main_~k~0_BEFORE_CALL_127 Int) (v_main_~p~0_BEFORE_CALL_138 Int) (v_main_~x~0_BEFORE_CALL_164 Int)) (let ((.cse2 (+ (* v_main_~x~0_BEFORE_CALL_164 v_main_~q~0_BEFORE_CALL_157) (* v_main_~y~0_BEFORE_CALL_150 v_main_~s~0_BEFORE_CALL_149)))) (or (not (= 0 (mod (+ v_main_~c~0_BEFORE_CALL_143 .cse2) (- 2)))) (= 0 (let ((.cse3 (+ v_main_~k~0_BEFORE_CALL_127 1))) (+ (* (+ (* (- 2) v_main_~s~0_BEFORE_CALL_149) (* (+ (- (* .cse3 v_main_~s~0_BEFORE_CALL_149)) v_main_~r~0_BEFORE_CALL_138) 3)) v_main_~y~0_BEFORE_CALL_150) (* (+ (* (- 2) v_main_~q~0_BEFORE_CALL_157) (* (+ v_main_~p~0_BEFORE_CALL_138 (- (* .cse3 v_main_~q~0_BEFORE_CALL_157))) 3)) v_main_~x~0_BEFORE_CALL_164)))) (exists ((main_~q~0 Int) (main_~s~0 Int)) (and (not (= 0 (let ((.cse4 (+ v_main_~k~0_BEFORE_CALL_127 1))) (+ (* (+ (* (- 2) main_~q~0) (* (+ v_main_~p~0_BEFORE_CALL_138 (- (* main_~q~0 .cse4))) 3)) v_main_~x~0_BEFORE_CALL_164) (* (+ (* (+ (- (* main_~s~0 .cse4)) v_main_~r~0_BEFORE_CALL_138) 3) (* (- 2) main_~s~0)) v_main_~y~0_BEFORE_CALL_150))))) (= (+ (* v_main_~y~0_BEFORE_CALL_150 main_~s~0) (* main_~q~0 v_main_~x~0_BEFORE_CALL_164)) (+ (* v_main_~x~0_BEFORE_CALL_164 v_main_~q~0_BEFORE_CALL_157) (* v_main_~y~0_BEFORE_CALL_150 v_main_~s~0_BEFORE_CALL_149))))) (not (= (+ (div (+ (* (- 1) v_main_~c~0_BEFORE_CALL_143) .cse2) (- 2)) v_main_~c~0_BEFORE_CALL_143) (* 2 .cse2))))))) (or .cse5 .cse0 .cse1) (or .cse5 (forall ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_main_~b~0_BEFORE_CALL_126 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_prenex_8 Int)) (or (exists ((v_prenex_10 Int) (v_prenex_9 Int)) (and (= (+ (* v_prenex_9 v_prenex_8) (* v_prenex_10 v_prenex_5)) v_main_~b~0_BEFORE_CALL_126) (not (= 0 (let ((.cse6 (+ v_prenex_6 1))) (+ (* v_prenex_5 (+ (* (- 2) v_prenex_10) (* (+ (- (* .cse6 v_prenex_10)) v_prenex_4) 3))) (* (+ (* (+ (- (* .cse6 v_prenex_9)) v_prenex_7) 3) (* (- 2) v_prenex_9)) v_prenex_8))))))) (not (= 0 (mod (+ v_prenex_2 v_main_~b~0_BEFORE_CALL_126) (- 2)))) (= (+ (* v_prenex_5 v_prenex_1) (* v_prenex_8 v_prenex_3)) v_main_~b~0_BEFORE_CALL_126) (= 0 (let ((.cse7 (+ v_prenex_6 1))) (+ (* v_prenex_5 (+ (* (- 2) v_prenex_1) (* (+ v_prenex_4 (- (* .cse7 v_prenex_1))) 3))) (* v_prenex_8 (+ (* 3 (+ v_prenex_7 (- (* .cse7 v_prenex_3)))) (* (- 2) v_prenex_3)))))) (not (= (+ v_prenex_2 (div (+ v_main_~b~0_BEFORE_CALL_126 (* (- 1) v_prenex_2)) (- 2))) (* 2 v_main_~b~0_BEFORE_CALL_126))))) .cse1))) is different from true [2019-10-03 02:38:57,634 WARN L860 $PredicateComparison]: unable to prove that (or (= |c___VERIFIER_assert_#in~cond| 0) (not (= |c___VERIFIER_assert_#in~cond| 1)) (forall ((v_main_~s~0_BEFORE_CALL_149 Int) (v_main_~c~0_BEFORE_CALL_143 Int) (v_main_~q~0_BEFORE_CALL_157 Int) (v_main_~r~0_BEFORE_CALL_138 Int) (v_main_~y~0_BEFORE_CALL_150 Int) (v_main_~k~0_BEFORE_CALL_127 Int) (v_main_~p~0_BEFORE_CALL_138 Int) (v_main_~x~0_BEFORE_CALL_164 Int)) (let ((.cse0 (+ (* v_main_~x~0_BEFORE_CALL_164 v_main_~q~0_BEFORE_CALL_157) (* v_main_~y~0_BEFORE_CALL_150 v_main_~s~0_BEFORE_CALL_149)))) (or (not (= 0 (mod (+ v_main_~c~0_BEFORE_CALL_143 .cse0) (- 2)))) (= 0 (let ((.cse1 (+ v_main_~k~0_BEFORE_CALL_127 1))) (+ (* (+ (* (- 2) v_main_~s~0_BEFORE_CALL_149) (* (+ (- (* .cse1 v_main_~s~0_BEFORE_CALL_149)) v_main_~r~0_BEFORE_CALL_138) 3)) v_main_~y~0_BEFORE_CALL_150) (* (+ (* (- 2) v_main_~q~0_BEFORE_CALL_157) (* (+ v_main_~p~0_BEFORE_CALL_138 (- (* .cse1 v_main_~q~0_BEFORE_CALL_157))) 3)) v_main_~x~0_BEFORE_CALL_164)))) (exists ((main_~q~0 Int) (main_~s~0 Int)) (and (not (= 0 (let ((.cse2 (+ v_main_~k~0_BEFORE_CALL_127 1))) (+ (* (+ (* (- 2) main_~q~0) (* (+ v_main_~p~0_BEFORE_CALL_138 (- (* main_~q~0 .cse2))) 3)) v_main_~x~0_BEFORE_CALL_164) (* (+ (* (+ (- (* main_~s~0 .cse2)) v_main_~r~0_BEFORE_CALL_138) 3) (* (- 2) main_~s~0)) v_main_~y~0_BEFORE_CALL_150))))) (= (+ (* v_main_~y~0_BEFORE_CALL_150 main_~s~0) (* main_~q~0 v_main_~x~0_BEFORE_CALL_164)) (+ (* v_main_~x~0_BEFORE_CALL_164 v_main_~q~0_BEFORE_CALL_157) (* v_main_~y~0_BEFORE_CALL_150 v_main_~s~0_BEFORE_CALL_149))))) (not (= (+ (div (+ (* (- 1) v_main_~c~0_BEFORE_CALL_143) .cse0) (- 2)) v_main_~c~0_BEFORE_CALL_143) (* 2 .cse0))))))) is different from true [2019-10-03 02:38:57,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:38:57,742 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((main_~x~0 Int) (main_~y~0 Int) (main_~p~0 Int) (main_~q~0 Int) (main_~r~0 Int) (main_~s~0 Int)) (or (not (= c_main_~b~0 (+ (* main_~y~0 main_~s~0) (* main_~q~0 main_~x~0)))) (not (= c_main_~a~0 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))) (= 0 (let ((.cse0 (+ c_main_~k~0 1))) (+ (* main_~x~0 (+ (* 3 (+ main_~p~0 (- (* main_~q~0 .cse0)))) (* (- 2) main_~q~0))) (* (+ (* (+ main_~r~0 (- (* main_~s~0 .cse0))) 3) (* (- 2) main_~s~0)) main_~y~0)))))) (not (= (+ (div (+ (- (* (- 1) c_main_~b~0)) (- c_main_~c~0)) (- 2)) c_main_~c~0) (* 2 c_main_~b~0))) (not (= 0 (mod (+ c_main_~b~0 c_main_~c~0) (- 2))))) is different from true [2019-10-03 02:38:57,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:38:59,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:39:03,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:39:14,137 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse11 (not (= |c___VERIFIER_assert_#in~cond| 0))) (.cse5 (not (= |c___VERIFIER_assert_#in~cond| 1)))) (and (or (forall ((v_main_~p~0_BEFORE_CALL_139 Int) (v_main_~c~0_BEFORE_CALL_144 Int) (main_~q~0 Int) (main_~s~0 Int) (v_main_~y~0_BEFORE_CALL_151 Int) (v_main_~x~0_BEFORE_CALL_165 Int) (v_main_~k~0_BEFORE_CALL_128 Int) (v_main_~r~0_BEFORE_CALL_139 Int)) (let ((.cse2 (* main_~q~0 v_main_~x~0_BEFORE_CALL_165)) (.cse1 (* v_main_~y~0_BEFORE_CALL_151 main_~s~0))) (or (= 0 (let ((.cse0 (+ v_main_~k~0_BEFORE_CALL_128 1))) (+ (* (+ (* (- 2) main_~q~0) (* 3 (+ v_main_~p~0_BEFORE_CALL_139 (- (* main_~q~0 .cse0))))) v_main_~x~0_BEFORE_CALL_165) (* (+ (* 3 (+ (- (* main_~s~0 .cse0)) v_main_~r~0_BEFORE_CALL_139)) (* (- 2) main_~s~0)) v_main_~y~0_BEFORE_CALL_151)))) (not (= 0 (mod (+ v_main_~c~0_BEFORE_CALL_144 (+ .cse1 .cse2)) (- 2)))) (not (let ((.cse3 (+ .cse2 .cse1))) (= (+ (div (+ .cse3 (* (- 1) v_main_~c~0_BEFORE_CALL_144)) (- 2)) v_main_~c~0_BEFORE_CALL_144) (* .cse3 2)))) (exists ((main_~x~0 Int) (main_~y~0 Int) (v_prenex_12 Int) (v_prenex_11 Int) (main_~p~0 Int) (main_~r~0 Int)) (and (not (= (let ((.cse4 (+ v_main_~k~0_BEFORE_CALL_128 1))) (+ (* (+ (* 3 (+ main_~p~0 (- (* v_prenex_11 .cse4)))) (* (- 2) v_prenex_11)) main_~x~0) (* main_~y~0 (+ (* 3 (+ (- (* v_prenex_12 .cse4)) main_~r~0)) (* (- 2) v_prenex_12))))) 0)) (= (+ (* main_~q~0 v_main_~x~0_BEFORE_CALL_165) (* v_main_~y~0_BEFORE_CALL_151 main_~s~0)) (+ (* main_~y~0 v_prenex_12) (* main_~x~0 v_prenex_11))) (= (+ (* v_main_~y~0_BEFORE_CALL_151 v_main_~r~0_BEFORE_CALL_139) (* v_main_~p~0_BEFORE_CALL_139 v_main_~x~0_BEFORE_CALL_165)) (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))))))) .cse5) (or (forall ((v_main_~p~0_BEFORE_CALL_139 Int) (v_main_~a~0_BEFORE_CALL_47 Int) (v_main_~c~0_BEFORE_CALL_144 Int) (main_~q~0 Int) (main_~s~0 Int) (v_main_~y~0_BEFORE_CALL_151 Int) (v_main_~x~0_BEFORE_CALL_165 Int) (v_main_~k~0_BEFORE_CALL_128 Int) (v_main_~r~0_BEFORE_CALL_139 Int)) (let ((.cse9 (* main_~q~0 v_main_~x~0_BEFORE_CALL_165)) (.cse8 (* v_main_~y~0_BEFORE_CALL_151 main_~s~0))) (or (= v_main_~a~0_BEFORE_CALL_47 (+ (* v_main_~y~0_BEFORE_CALL_151 v_main_~r~0_BEFORE_CALL_139) (* v_main_~p~0_BEFORE_CALL_139 v_main_~x~0_BEFORE_CALL_165))) (= 0 (let ((.cse6 (+ v_main_~k~0_BEFORE_CALL_128 1))) (+ (* (+ (* (- 2) main_~q~0) (* 3 (+ v_main_~p~0_BEFORE_CALL_139 (- (* main_~q~0 .cse6))))) v_main_~x~0_BEFORE_CALL_165) (* (+ (* 3 (+ (- (* main_~s~0 .cse6)) v_main_~r~0_BEFORE_CALL_139)) (* (- 2) main_~s~0)) v_main_~y~0_BEFORE_CALL_151)))) (exists ((main_~x~0 Int) (main_~y~0 Int) (v_prenex_12 Int) (v_prenex_11 Int) (main_~p~0 Int) (main_~r~0 Int)) (and (= v_main_~a~0_BEFORE_CALL_47 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (not (= (let ((.cse7 (+ v_main_~k~0_BEFORE_CALL_128 1))) (+ (* (+ (* 3 (+ main_~p~0 (- (* v_prenex_11 .cse7)))) (* (- 2) v_prenex_11)) main_~x~0) (* main_~y~0 (+ (* 3 (+ (- (* v_prenex_12 .cse7)) main_~r~0)) (* (- 2) v_prenex_12))))) 0)) (= (+ (* main_~q~0 v_main_~x~0_BEFORE_CALL_165) (* v_main_~y~0_BEFORE_CALL_151 main_~s~0)) (+ (* main_~y~0 v_prenex_12) (* main_~x~0 v_prenex_11))))) (not (= 0 (mod (+ v_main_~c~0_BEFORE_CALL_144 (+ .cse8 .cse9)) (- 2)))) (not (let ((.cse10 (+ .cse9 .cse8))) (= (+ (div (+ .cse10 (* (- 1) v_main_~c~0_BEFORE_CALL_144)) (- 2)) v_main_~c~0_BEFORE_CALL_144) (* .cse10 2))))))) .cse11) (or .cse11 (forall ((v_main_~p~0_BEFORE_CALL_139 Int) (v_main_~a~0_BEFORE_CALL_47 Int) (v_main_~c~0_BEFORE_CALL_144 Int) (main_~q~0 Int) (main_~s~0 Int) (v_main_~y~0_BEFORE_CALL_151 Int) (v_main_~x~0_BEFORE_CALL_165 Int) (v_main_~k~0_BEFORE_CALL_128 Int) (v_main_~r~0_BEFORE_CALL_139 Int)) (let ((.cse15 (* main_~q~0 v_main_~x~0_BEFORE_CALL_165)) (.cse14 (* v_main_~y~0_BEFORE_CALL_151 main_~s~0))) (or (= 0 (let ((.cse12 (+ v_main_~k~0_BEFORE_CALL_128 1))) (+ (* (+ (* (- 2) main_~q~0) (* 3 (+ v_main_~p~0_BEFORE_CALL_139 (- (* main_~q~0 .cse12))))) v_main_~x~0_BEFORE_CALL_165) (* (+ (* 3 (+ (- (* main_~s~0 .cse12)) v_main_~r~0_BEFORE_CALL_139)) (* (- 2) main_~s~0)) v_main_~y~0_BEFORE_CALL_151)))) (exists ((main_~x~0 Int) (main_~y~0 Int) (v_prenex_12 Int) (v_prenex_11 Int) (main_~p~0 Int) (main_~r~0 Int)) (and (= v_main_~a~0_BEFORE_CALL_47 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (not (= (let ((.cse13 (+ v_main_~k~0_BEFORE_CALL_128 1))) (+ (* (+ (* 3 (+ main_~p~0 (- (* v_prenex_11 .cse13)))) (* (- 2) v_prenex_11)) main_~x~0) (* main_~y~0 (+ (* 3 (+ (- (* v_prenex_12 .cse13)) main_~r~0)) (* (- 2) v_prenex_12))))) 0)) (= (+ (* main_~q~0 v_main_~x~0_BEFORE_CALL_165) (* v_main_~y~0_BEFORE_CALL_151 main_~s~0)) (+ (* main_~y~0 v_prenex_12) (* main_~x~0 v_prenex_11))))) (not (= 0 (mod (+ v_main_~c~0_BEFORE_CALL_144 (+ .cse14 .cse15)) (- 2)))) (not (let ((.cse16 (+ .cse15 .cse14))) (= (+ (div (+ .cse16 (* (- 1) v_main_~c~0_BEFORE_CALL_144)) (- 2)) v_main_~c~0_BEFORE_CALL_144) (* .cse16 2))))))) .cse5))) is different from true [2019-10-03 02:39:20,231 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 90 [2019-10-03 02:39:29,421 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse6 (not (= |c___VERIFIER_assert_#in~cond| 0))) (.cse5 (not (= |c___VERIFIER_assert_#in~cond| 1)))) (and (or (forall ((v_main_~p~0_BEFORE_CALL_139 Int) (v_main_~c~0_BEFORE_CALL_144 Int) (main_~q~0 Int) (main_~s~0 Int) (v_main_~y~0_BEFORE_CALL_151 Int) (v_main_~x~0_BEFORE_CALL_165 Int) (v_main_~k~0_BEFORE_CALL_128 Int) (v_main_~r~0_BEFORE_CALL_139 Int)) (let ((.cse2 (* main_~q~0 v_main_~x~0_BEFORE_CALL_165)) (.cse1 (* v_main_~y~0_BEFORE_CALL_151 main_~s~0))) (or (= 0 (let ((.cse0 (+ v_main_~k~0_BEFORE_CALL_128 1))) (+ (* (+ (* (- 2) main_~q~0) (* 3 (+ v_main_~p~0_BEFORE_CALL_139 (- (* main_~q~0 .cse0))))) v_main_~x~0_BEFORE_CALL_165) (* (+ (* 3 (+ (- (* main_~s~0 .cse0)) v_main_~r~0_BEFORE_CALL_139)) (* (- 2) main_~s~0)) v_main_~y~0_BEFORE_CALL_151)))) (not (= 0 (mod (+ v_main_~c~0_BEFORE_CALL_144 (+ .cse1 .cse2)) (- 2)))) (not (let ((.cse3 (+ .cse2 .cse1))) (= (+ (div (+ .cse3 (* (- 1) v_main_~c~0_BEFORE_CALL_144)) (- 2)) v_main_~c~0_BEFORE_CALL_144) (* .cse3 2)))) (exists ((main_~x~0 Int) (main_~y~0 Int) (v_prenex_12 Int) (v_prenex_11 Int) (main_~p~0 Int) (main_~r~0 Int)) (and (not (= (let ((.cse4 (+ v_main_~k~0_BEFORE_CALL_128 1))) (+ (* (+ (* 3 (+ main_~p~0 (- (* v_prenex_11 .cse4)))) (* (- 2) v_prenex_11)) main_~x~0) (* main_~y~0 (+ (* 3 (+ (- (* v_prenex_12 .cse4)) main_~r~0)) (* (- 2) v_prenex_12))))) 0)) (= (+ (* main_~q~0 v_main_~x~0_BEFORE_CALL_165) (* v_main_~y~0_BEFORE_CALL_151 main_~s~0)) (+ (* main_~y~0 v_prenex_12) (* main_~x~0 v_prenex_11))) (= (+ (* v_main_~y~0_BEFORE_CALL_151 v_main_~r~0_BEFORE_CALL_139) (* v_main_~p~0_BEFORE_CALL_139 v_main_~x~0_BEFORE_CALL_165)) (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))))))) .cse5) (or .cse6 (forall ((v_prenex_16 Int) (v_main_~a~0_BEFORE_CALL_47 Int) (v_prenex_15 Int) (v_prenex_18 Int) (v_prenex_17 Int) (v_prenex_14 Int) (v_prenex_13 Int) (v_prenex_20 Int) (v_prenex_19 Int)) (or (not (let ((.cse7 (+ (* v_prenex_17 v_prenex_16) (* v_prenex_18 v_prenex_15)))) (= (* .cse7 2) (+ v_prenex_14 (div (+ .cse7 (* (- 1) v_prenex_14)) (- 2)))))) (not (= 0 (mod (+ v_prenex_14 (+ (* v_prenex_16 v_prenex_17) (* v_prenex_15 v_prenex_18))) (- 2)))) (= v_main_~a~0_BEFORE_CALL_47 (+ (* v_prenex_18 v_prenex_13) (* v_prenex_16 v_prenex_20))) (exists ((v_prenex_26 Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_25 Int) (v_prenex_24 Int) (v_prenex_21 Int)) (and (= v_main_~a~0_BEFORE_CALL_47 (+ (* v_prenex_26 v_prenex_24) (* v_prenex_25 v_prenex_23))) (= (+ (* v_prenex_17 v_prenex_16) (* v_prenex_18 v_prenex_15)) (+ (* v_prenex_26 v_prenex_21) (* v_prenex_25 v_prenex_22))) (not (= (let ((.cse8 (+ v_prenex_19 1))) (+ (* v_prenex_26 (+ (* (- 2) v_prenex_21) (* 3 (+ v_prenex_24 (- (* v_prenex_21 .cse8)))))) (* v_prenex_25 (+ (* 3 (+ v_prenex_23 (- (* v_prenex_22 .cse8)))) (* (- 2) v_prenex_22))))) 0)))) (= 0 (let ((.cse9 (+ v_prenex_19 1))) (+ (* v_prenex_18 (+ (* 3 (+ v_prenex_13 (- (* v_prenex_15 .cse9)))) (* (- 2) v_prenex_15))) (* (+ (* (- 2) v_prenex_17) (* 3 (+ v_prenex_20 (- (* v_prenex_17 .cse9))))) v_prenex_16))))))) (or .cse6 (forall ((v_prenex_27 Int) (v_prenex_29 Int) (v_prenex_28 Int) (v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_35 Int) (v_prenex_30 Int) (v_prenex_32 Int) (v_prenex_31 Int)) (let ((.cse11 (* v_prenex_32 v_prenex_31))) (or (exists ((v_prenex_38 Int) (v_prenex_37 Int) (v_prenex_39 Int) (v_prenex_36 Int) (v_prenex_41 Int) (v_prenex_40 Int)) (and (not (= (let ((.cse10 (+ v_prenex_34 1))) (+ (* (+ (* (+ (- (* v_prenex_36 .cse10)) v_prenex_39) 3) (* (- 2) v_prenex_36)) v_prenex_41) (* v_prenex_40 (+ (* (- 2) v_prenex_37) (* 3 (+ (- (* v_prenex_37 .cse10)) v_prenex_38)))))) 0)) (= (+ (* v_prenex_38 v_prenex_40) (* v_prenex_39 v_prenex_41)) v_prenex_28) (= (+ (* v_prenex_37 v_prenex_40) (* v_prenex_36 v_prenex_41)) (+ (* v_prenex_32 v_prenex_31) (* v_prenex_33 v_prenex_30))))) (not (= 0 (mod (+ v_prenex_29 (+ (* v_prenex_30 v_prenex_33) .cse11)) (- 2)))) (not (let ((.cse12 (+ .cse11 (* v_prenex_33 v_prenex_30)))) (= (+ v_prenex_29 (div (+ (* (- 1) v_prenex_29) .cse12) (- 2))) (* 2 .cse12)))) (= (let ((.cse13 (+ v_prenex_34 1))) (+ (* (+ (* 3 (+ (- (* v_prenex_33 .cse13)) v_prenex_35)) (* (- 2) v_prenex_33)) v_prenex_30) (* v_prenex_31 (+ (* (- 2) v_prenex_32) (* 3 (+ v_prenex_27 (- (* v_prenex_32 .cse13)))))))) 0)))) .cse5))) is different from true [2019-10-03 02:39:35,844 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 90 [2019-10-03 02:39:44,684 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 (not (= |c___VERIFIER_assert_#in~cond| 1))) (.cse7 (not (= |c___VERIFIER_assert_#in~cond| 0))) (.cse6 (= 0 c___VERIFIER_assert_~cond))) (and (or (forall ((v_main_~p~0_BEFORE_CALL_139 Int) (v_main_~c~0_BEFORE_CALL_144 Int) (main_~q~0 Int) (main_~s~0 Int) (v_main_~y~0_BEFORE_CALL_151 Int) (v_main_~x~0_BEFORE_CALL_165 Int) (v_main_~k~0_BEFORE_CALL_128 Int) (v_main_~r~0_BEFORE_CALL_139 Int)) (let ((.cse2 (* main_~q~0 v_main_~x~0_BEFORE_CALL_165)) (.cse1 (* v_main_~y~0_BEFORE_CALL_151 main_~s~0))) (or (= 0 (let ((.cse0 (+ v_main_~k~0_BEFORE_CALL_128 1))) (+ (* (+ (* (- 2) main_~q~0) (* 3 (+ v_main_~p~0_BEFORE_CALL_139 (- (* main_~q~0 .cse0))))) v_main_~x~0_BEFORE_CALL_165) (* (+ (* 3 (+ (- (* main_~s~0 .cse0)) v_main_~r~0_BEFORE_CALL_139)) (* (- 2) main_~s~0)) v_main_~y~0_BEFORE_CALL_151)))) (not (= 0 (mod (+ v_main_~c~0_BEFORE_CALL_144 (+ .cse1 .cse2)) (- 2)))) (not (let ((.cse3 (+ .cse2 .cse1))) (= (+ (div (+ .cse3 (* (- 1) v_main_~c~0_BEFORE_CALL_144)) (- 2)) v_main_~c~0_BEFORE_CALL_144) (* .cse3 2)))) (exists ((main_~x~0 Int) (main_~y~0 Int) (v_prenex_12 Int) (v_prenex_11 Int) (main_~p~0 Int) (main_~r~0 Int)) (and (not (= (let ((.cse4 (+ v_main_~k~0_BEFORE_CALL_128 1))) (+ (* (+ (* 3 (+ main_~p~0 (- (* v_prenex_11 .cse4)))) (* (- 2) v_prenex_11)) main_~x~0) (* main_~y~0 (+ (* 3 (+ (- (* v_prenex_12 .cse4)) main_~r~0)) (* (- 2) v_prenex_12))))) 0)) (= (+ (* main_~q~0 v_main_~x~0_BEFORE_CALL_165) (* v_main_~y~0_BEFORE_CALL_151 main_~s~0)) (+ (* main_~y~0 v_prenex_12) (* main_~x~0 v_prenex_11))) (= (+ (* v_main_~y~0_BEFORE_CALL_151 v_main_~r~0_BEFORE_CALL_139) (* v_main_~p~0_BEFORE_CALL_139 v_main_~x~0_BEFORE_CALL_165)) (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))))))) .cse5 .cse6) (or .cse7 (forall ((v_prenex_27 Int) (v_prenex_29 Int) (v_prenex_28 Int) (v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_35 Int) (v_prenex_30 Int) (v_prenex_32 Int) (v_prenex_31 Int)) (let ((.cse9 (* v_prenex_32 v_prenex_31))) (or (exists ((v_prenex_38 Int) (v_prenex_37 Int) (v_prenex_39 Int) (v_prenex_36 Int) (v_prenex_41 Int) (v_prenex_40 Int)) (and (not (= (let ((.cse8 (+ v_prenex_34 1))) (+ (* (+ (* (+ (- (* v_prenex_36 .cse8)) v_prenex_39) 3) (* (- 2) v_prenex_36)) v_prenex_41) (* v_prenex_40 (+ (* (- 2) v_prenex_37) (* 3 (+ (- (* v_prenex_37 .cse8)) v_prenex_38)))))) 0)) (= (+ (* v_prenex_38 v_prenex_40) (* v_prenex_39 v_prenex_41)) v_prenex_28) (= (+ (* v_prenex_37 v_prenex_40) (* v_prenex_36 v_prenex_41)) (+ (* v_prenex_32 v_prenex_31) (* v_prenex_33 v_prenex_30))))) (not (= 0 (mod (+ v_prenex_29 (+ (* v_prenex_30 v_prenex_33) .cse9)) (- 2)))) (not (let ((.cse10 (+ .cse9 (* v_prenex_33 v_prenex_30)))) (= (+ v_prenex_29 (div (+ (* (- 1) v_prenex_29) .cse10) (- 2))) (* 2 .cse10)))) (= (let ((.cse11 (+ v_prenex_34 1))) (+ (* (+ (* 3 (+ (- (* v_prenex_33 .cse11)) v_prenex_35)) (* (- 2) v_prenex_33)) v_prenex_30) (* v_prenex_31 (+ (* (- 2) v_prenex_32) (* 3 (+ v_prenex_27 (- (* v_prenex_32 .cse11)))))))) 0)))) .cse5 .cse6) (or .cse7 .cse6 (forall ((v_prenex_16 Int) (v_main_~a~0_BEFORE_CALL_47 Int) (v_prenex_15 Int) (v_prenex_18 Int) (v_prenex_17 Int) (v_prenex_14 Int) (v_prenex_13 Int) (v_prenex_20 Int) (v_prenex_19 Int)) (or (not (let ((.cse12 (+ (* v_prenex_17 v_prenex_16) (* v_prenex_18 v_prenex_15)))) (= (* .cse12 2) (+ v_prenex_14 (div (+ .cse12 (* (- 1) v_prenex_14)) (- 2)))))) (not (= 0 (mod (+ v_prenex_14 (+ (* v_prenex_16 v_prenex_17) (* v_prenex_15 v_prenex_18))) (- 2)))) (= v_main_~a~0_BEFORE_CALL_47 (+ (* v_prenex_18 v_prenex_13) (* v_prenex_16 v_prenex_20))) (exists ((v_prenex_26 Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_25 Int) (v_prenex_24 Int) (v_prenex_21 Int)) (and (= v_main_~a~0_BEFORE_CALL_47 (+ (* v_prenex_26 v_prenex_24) (* v_prenex_25 v_prenex_23))) (= (+ (* v_prenex_17 v_prenex_16) (* v_prenex_18 v_prenex_15)) (+ (* v_prenex_26 v_prenex_21) (* v_prenex_25 v_prenex_22))) (not (= (let ((.cse13 (+ v_prenex_19 1))) (+ (* v_prenex_26 (+ (* (- 2) v_prenex_21) (* 3 (+ v_prenex_24 (- (* v_prenex_21 .cse13)))))) (* v_prenex_25 (+ (* 3 (+ v_prenex_23 (- (* v_prenex_22 .cse13)))) (* (- 2) v_prenex_22))))) 0)))) (= 0 (let ((.cse14 (+ v_prenex_19 1))) (+ (* v_prenex_18 (+ (* 3 (+ v_prenex_13 (- (* v_prenex_15 .cse14)))) (* (- 2) v_prenex_15))) (* (+ (* (- 2) v_prenex_17) (* 3 (+ v_prenex_20 (- (* v_prenex_17 .cse14))))) v_prenex_16))))))))) is different from true [2019-10-03 02:39:48,843 WARN L860 $PredicateComparison]: unable to prove that (or (= |c___VERIFIER_assert_#in~cond| 0) (forall ((v_main_~p~0_BEFORE_CALL_139 Int) (v_main_~c~0_BEFORE_CALL_144 Int) (main_~q~0 Int) (main_~s~0 Int) (v_main_~y~0_BEFORE_CALL_151 Int) (v_main_~x~0_BEFORE_CALL_165 Int) (v_main_~k~0_BEFORE_CALL_128 Int) (v_main_~r~0_BEFORE_CALL_139 Int)) (let ((.cse2 (* main_~q~0 v_main_~x~0_BEFORE_CALL_165)) (.cse1 (* v_main_~y~0_BEFORE_CALL_151 main_~s~0))) (or (= 0 (let ((.cse0 (+ v_main_~k~0_BEFORE_CALL_128 1))) (+ (* (+ (* (- 2) main_~q~0) (* 3 (+ v_main_~p~0_BEFORE_CALL_139 (- (* main_~q~0 .cse0))))) v_main_~x~0_BEFORE_CALL_165) (* (+ (* 3 (+ (- (* main_~s~0 .cse0)) v_main_~r~0_BEFORE_CALL_139)) (* (- 2) main_~s~0)) v_main_~y~0_BEFORE_CALL_151)))) (not (= 0 (mod (+ v_main_~c~0_BEFORE_CALL_144 (+ .cse1 .cse2)) (- 2)))) (not (let ((.cse3 (+ .cse2 .cse1))) (= (+ (div (+ .cse3 (* (- 1) v_main_~c~0_BEFORE_CALL_144)) (- 2)) v_main_~c~0_BEFORE_CALL_144) (* .cse3 2)))) (exists ((main_~x~0 Int) (main_~y~0 Int) (v_prenex_12 Int) (v_prenex_11 Int) (main_~p~0 Int) (main_~r~0 Int)) (and (not (= (let ((.cse4 (+ v_main_~k~0_BEFORE_CALL_128 1))) (+ (* (+ (* 3 (+ main_~p~0 (- (* v_prenex_11 .cse4)))) (* (- 2) v_prenex_11)) main_~x~0) (* main_~y~0 (+ (* 3 (+ (- (* v_prenex_12 .cse4)) main_~r~0)) (* (- 2) v_prenex_12))))) 0)) (= (+ (* main_~q~0 v_main_~x~0_BEFORE_CALL_165) (* v_main_~y~0_BEFORE_CALL_151 main_~s~0)) (+ (* main_~y~0 v_prenex_12) (* main_~x~0 v_prenex_11))) (= (+ (* v_main_~y~0_BEFORE_CALL_151 v_main_~r~0_BEFORE_CALL_139) (* v_main_~p~0_BEFORE_CALL_139 v_main_~x~0_BEFORE_CALL_165)) (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))))))) (not (= |c___VERIFIER_assert_#in~cond| 1))) is different from true [2019-10-03 02:39:48,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:39:48,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:39:49,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1709 backedges. 121 proven. 212 refuted. 194 times theorem prover too weak. 1156 trivial. 26 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (27)] Exception during sending of exit command (exit): Broken pipe [2019-10-03 02:39:49,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-03 02:39:49,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 27] total 40 [2019-10-03 02:39:49,146 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:39:49,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-03 02:39:49,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-03 02:39:49,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=805, Unknown=9, NotChecked=594, Total=1560 [2019-10-03 02:39:49,149 INFO L87 Difference]: Start difference. First operand 166 states and 218 transitions. Second operand 40 states. [2019-10-03 02:39:50,009 WARN L191 SmtUtils]: Spent 719.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 118 [2019-10-03 02:39:52,730 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_~p~0_BEFORE_CALL_139 Int) (v_main_~c~0_BEFORE_CALL_144 Int) (main_~q~0 Int) (main_~s~0 Int) (v_main_~y~0_BEFORE_CALL_151 Int) (v_main_~x~0_BEFORE_CALL_165 Int) (v_main_~k~0_BEFORE_CALL_128 Int) (v_main_~r~0_BEFORE_CALL_139 Int)) (let ((.cse3 (* main_~q~0 v_main_~x~0_BEFORE_CALL_165)) (.cse2 (* v_main_~y~0_BEFORE_CALL_151 main_~s~0))) (or (= 0 (let ((.cse1 (+ v_main_~k~0_BEFORE_CALL_128 1))) (+ (* (+ (* (- 2) main_~q~0) (* 3 (+ v_main_~p~0_BEFORE_CALL_139 (- (* main_~q~0 .cse1))))) v_main_~x~0_BEFORE_CALL_165) (* (+ (* 3 (+ (- (* main_~s~0 .cse1)) v_main_~r~0_BEFORE_CALL_139)) (* (- 2) main_~s~0)) v_main_~y~0_BEFORE_CALL_151)))) (not (= 0 (mod (+ v_main_~c~0_BEFORE_CALL_144 (+ .cse2 .cse3)) (- 2)))) (not (let ((.cse4 (+ .cse3 .cse2))) (= (+ (div (+ .cse4 (* (- 1) v_main_~c~0_BEFORE_CALL_144)) (- 2)) v_main_~c~0_BEFORE_CALL_144) (* .cse4 2)))) (exists ((main_~x~0 Int) (main_~y~0 Int) (v_prenex_12 Int) (v_prenex_11 Int) (main_~p~0 Int) (main_~r~0 Int)) (and (not (= (let ((.cse5 (+ v_main_~k~0_BEFORE_CALL_128 1))) (+ (* (+ (* 3 (+ main_~p~0 (- (* v_prenex_11 .cse5)))) (* (- 2) v_prenex_11)) main_~x~0) (* main_~y~0 (+ (* 3 (+ (- (* v_prenex_12 .cse5)) main_~r~0)) (* (- 2) v_prenex_12))))) 0)) (= (+ (* main_~q~0 v_main_~x~0_BEFORE_CALL_165) (* v_main_~y~0_BEFORE_CALL_151 main_~s~0)) (+ (* main_~y~0 v_prenex_12) (* main_~x~0 v_prenex_11))) (= (+ (* v_main_~y~0_BEFORE_CALL_151 v_main_~r~0_BEFORE_CALL_139) (* v_main_~p~0_BEFORE_CALL_139 v_main_~x~0_BEFORE_CALL_165)) (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))))))) (not .cse0)))) is different from false [2019-10-03 02:39:52,819 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (not (= |c___VERIFIER_assert_#in~cond| 1))) (.cse7 (not (= |c___VERIFIER_assert_#in~cond| 0))) (.cse6 (= 0 c___VERIFIER_assert_~cond))) (and (or (forall ((v_main_~p~0_BEFORE_CALL_139 Int) (v_main_~c~0_BEFORE_CALL_144 Int) (main_~q~0 Int) (main_~s~0 Int) (v_main_~y~0_BEFORE_CALL_151 Int) (v_main_~x~0_BEFORE_CALL_165 Int) (v_main_~k~0_BEFORE_CALL_128 Int) (v_main_~r~0_BEFORE_CALL_139 Int)) (let ((.cse2 (* main_~q~0 v_main_~x~0_BEFORE_CALL_165)) (.cse1 (* v_main_~y~0_BEFORE_CALL_151 main_~s~0))) (or (= 0 (let ((.cse0 (+ v_main_~k~0_BEFORE_CALL_128 1))) (+ (* (+ (* (- 2) main_~q~0) (* 3 (+ v_main_~p~0_BEFORE_CALL_139 (- (* main_~q~0 .cse0))))) v_main_~x~0_BEFORE_CALL_165) (* (+ (* 3 (+ (- (* main_~s~0 .cse0)) v_main_~r~0_BEFORE_CALL_139)) (* (- 2) main_~s~0)) v_main_~y~0_BEFORE_CALL_151)))) (not (= 0 (mod (+ v_main_~c~0_BEFORE_CALL_144 (+ .cse1 .cse2)) (- 2)))) (not (let ((.cse3 (+ .cse2 .cse1))) (= (+ (div (+ .cse3 (* (- 1) v_main_~c~0_BEFORE_CALL_144)) (- 2)) v_main_~c~0_BEFORE_CALL_144) (* .cse3 2)))) (exists ((main_~x~0 Int) (main_~y~0 Int) (v_prenex_12 Int) (v_prenex_11 Int) (main_~p~0 Int) (main_~r~0 Int)) (and (not (= (let ((.cse4 (+ v_main_~k~0_BEFORE_CALL_128 1))) (+ (* (+ (* 3 (+ main_~p~0 (- (* v_prenex_11 .cse4)))) (* (- 2) v_prenex_11)) main_~x~0) (* main_~y~0 (+ (* 3 (+ (- (* v_prenex_12 .cse4)) main_~r~0)) (* (- 2) v_prenex_12))))) 0)) (= (+ (* main_~q~0 v_main_~x~0_BEFORE_CALL_165) (* v_main_~y~0_BEFORE_CALL_151 main_~s~0)) (+ (* main_~y~0 v_prenex_12) (* main_~x~0 v_prenex_11))) (= (+ (* v_main_~y~0_BEFORE_CALL_151 v_main_~r~0_BEFORE_CALL_139) (* v_main_~p~0_BEFORE_CALL_139 v_main_~x~0_BEFORE_CALL_165)) (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))))))) .cse5 .cse6) (or .cse7 (forall ((v_prenex_27 Int) (v_prenex_29 Int) (v_prenex_28 Int) (v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_35 Int) (v_prenex_30 Int) (v_prenex_32 Int) (v_prenex_31 Int)) (let ((.cse9 (* v_prenex_32 v_prenex_31))) (or (exists ((v_prenex_38 Int) (v_prenex_37 Int) (v_prenex_39 Int) (v_prenex_36 Int) (v_prenex_41 Int) (v_prenex_40 Int)) (and (not (= (let ((.cse8 (+ v_prenex_34 1))) (+ (* (+ (* (+ (- (* v_prenex_36 .cse8)) v_prenex_39) 3) (* (- 2) v_prenex_36)) v_prenex_41) (* v_prenex_40 (+ (* (- 2) v_prenex_37) (* 3 (+ (- (* v_prenex_37 .cse8)) v_prenex_38)))))) 0)) (= (+ (* v_prenex_38 v_prenex_40) (* v_prenex_39 v_prenex_41)) v_prenex_28) (= (+ (* v_prenex_37 v_prenex_40) (* v_prenex_36 v_prenex_41)) (+ (* v_prenex_32 v_prenex_31) (* v_prenex_33 v_prenex_30))))) (not (= 0 (mod (+ v_prenex_29 (+ (* v_prenex_30 v_prenex_33) .cse9)) (- 2)))) (not (let ((.cse10 (+ .cse9 (* v_prenex_33 v_prenex_30)))) (= (+ v_prenex_29 (div (+ (* (- 1) v_prenex_29) .cse10) (- 2))) (* 2 .cse10)))) (= (let ((.cse11 (+ v_prenex_34 1))) (+ (* (+ (* 3 (+ (- (* v_prenex_33 .cse11)) v_prenex_35)) (* (- 2) v_prenex_33)) v_prenex_30) (* v_prenex_31 (+ (* (- 2) v_prenex_32) (* 3 (+ v_prenex_27 (- (* v_prenex_32 .cse11)))))))) 0)))) .cse5 .cse6) (or .cse7 .cse6 (forall ((v_prenex_16 Int) (v_main_~a~0_BEFORE_CALL_47 Int) (v_prenex_15 Int) (v_prenex_18 Int) (v_prenex_17 Int) (v_prenex_14 Int) (v_prenex_13 Int) (v_prenex_20 Int) (v_prenex_19 Int)) (or (not (let ((.cse12 (+ (* v_prenex_17 v_prenex_16) (* v_prenex_18 v_prenex_15)))) (= (* .cse12 2) (+ v_prenex_14 (div (+ .cse12 (* (- 1) v_prenex_14)) (- 2)))))) (not (= 0 (mod (+ v_prenex_14 (+ (* v_prenex_16 v_prenex_17) (* v_prenex_15 v_prenex_18))) (- 2)))) (= v_main_~a~0_BEFORE_CALL_47 (+ (* v_prenex_18 v_prenex_13) (* v_prenex_16 v_prenex_20))) (exists ((v_prenex_26 Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_25 Int) (v_prenex_24 Int) (v_prenex_21 Int)) (and (= v_main_~a~0_BEFORE_CALL_47 (+ (* v_prenex_26 v_prenex_24) (* v_prenex_25 v_prenex_23))) (= (+ (* v_prenex_17 v_prenex_16) (* v_prenex_18 v_prenex_15)) (+ (* v_prenex_26 v_prenex_21) (* v_prenex_25 v_prenex_22))) (not (= (let ((.cse13 (+ v_prenex_19 1))) (+ (* v_prenex_26 (+ (* (- 2) v_prenex_21) (* 3 (+ v_prenex_24 (- (* v_prenex_21 .cse13)))))) (* v_prenex_25 (+ (* 3 (+ v_prenex_23 (- (* v_prenex_22 .cse13)))) (* (- 2) v_prenex_22))))) 0)))) (= 0 (let ((.cse14 (+ v_prenex_19 1))) (+ (* v_prenex_18 (+ (* 3 (+ v_prenex_13 (- (* v_prenex_15 .cse14)))) (* (- 2) v_prenex_15))) (* (+ (* (- 2) v_prenex_17) (* 3 (+ v_prenex_20 (- (* v_prenex_17 .cse14))))) v_prenex_16))))))) (= 1 c___VERIFIER_assert_~cond) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond))) is different from false [2019-10-03 02:39:54,834 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| 0))) (.cse6 (not (= |c___VERIFIER_assert_#in~cond| 1)))) (and .cse0 (or (forall ((v_main_~p~0_BEFORE_CALL_139 Int) (v_main_~c~0_BEFORE_CALL_144 Int) (main_~q~0 Int) (main_~s~0 Int) (v_main_~y~0_BEFORE_CALL_151 Int) (v_main_~x~0_BEFORE_CALL_165 Int) (v_main_~k~0_BEFORE_CALL_128 Int) (v_main_~r~0_BEFORE_CALL_139 Int)) (let ((.cse3 (* main_~q~0 v_main_~x~0_BEFORE_CALL_165)) (.cse2 (* v_main_~y~0_BEFORE_CALL_151 main_~s~0))) (or (= 0 (let ((.cse1 (+ v_main_~k~0_BEFORE_CALL_128 1))) (+ (* (+ (* (- 2) main_~q~0) (* 3 (+ v_main_~p~0_BEFORE_CALL_139 (- (* main_~q~0 .cse1))))) v_main_~x~0_BEFORE_CALL_165) (* (+ (* 3 (+ (- (* main_~s~0 .cse1)) v_main_~r~0_BEFORE_CALL_139)) (* (- 2) main_~s~0)) v_main_~y~0_BEFORE_CALL_151)))) (not (= 0 (mod (+ v_main_~c~0_BEFORE_CALL_144 (+ .cse2 .cse3)) (- 2)))) (not (let ((.cse4 (+ .cse3 .cse2))) (= (+ (div (+ .cse4 (* (- 1) v_main_~c~0_BEFORE_CALL_144)) (- 2)) v_main_~c~0_BEFORE_CALL_144) (* .cse4 2)))) (exists ((main_~x~0 Int) (main_~y~0 Int) (v_prenex_12 Int) (v_prenex_11 Int) (main_~p~0 Int) (main_~r~0 Int)) (and (not (= (let ((.cse5 (+ v_main_~k~0_BEFORE_CALL_128 1))) (+ (* (+ (* 3 (+ main_~p~0 (- (* v_prenex_11 .cse5)))) (* (- 2) v_prenex_11)) main_~x~0) (* main_~y~0 (+ (* 3 (+ (- (* v_prenex_12 .cse5)) main_~r~0)) (* (- 2) v_prenex_12))))) 0)) (= (+ (* main_~q~0 v_main_~x~0_BEFORE_CALL_165) (* v_main_~y~0_BEFORE_CALL_151 main_~s~0)) (+ (* main_~y~0 v_prenex_12) (* main_~x~0 v_prenex_11))) (= (+ (* v_main_~y~0_BEFORE_CALL_151 v_main_~r~0_BEFORE_CALL_139) (* v_main_~p~0_BEFORE_CALL_139 v_main_~x~0_BEFORE_CALL_165)) (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))))))) .cse6) (or .cse0 (forall ((v_prenex_16 Int) (v_main_~a~0_BEFORE_CALL_47 Int) (v_prenex_15 Int) (v_prenex_18 Int) (v_prenex_17 Int) (v_prenex_14 Int) (v_prenex_13 Int) (v_prenex_20 Int) (v_prenex_19 Int)) (or (not (let ((.cse7 (+ (* v_prenex_17 v_prenex_16) (* v_prenex_18 v_prenex_15)))) (= (* .cse7 2) (+ v_prenex_14 (div (+ .cse7 (* (- 1) v_prenex_14)) (- 2)))))) (not (= 0 (mod (+ v_prenex_14 (+ (* v_prenex_16 v_prenex_17) (* v_prenex_15 v_prenex_18))) (- 2)))) (= v_main_~a~0_BEFORE_CALL_47 (+ (* v_prenex_18 v_prenex_13) (* v_prenex_16 v_prenex_20))) (exists ((v_prenex_26 Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_25 Int) (v_prenex_24 Int) (v_prenex_21 Int)) (and (= v_main_~a~0_BEFORE_CALL_47 (+ (* v_prenex_26 v_prenex_24) (* v_prenex_25 v_prenex_23))) (= (+ (* v_prenex_17 v_prenex_16) (* v_prenex_18 v_prenex_15)) (+ (* v_prenex_26 v_prenex_21) (* v_prenex_25 v_prenex_22))) (not (= (let ((.cse8 (+ v_prenex_19 1))) (+ (* v_prenex_26 (+ (* (- 2) v_prenex_21) (* 3 (+ v_prenex_24 (- (* v_prenex_21 .cse8)))))) (* v_prenex_25 (+ (* 3 (+ v_prenex_23 (- (* v_prenex_22 .cse8)))) (* (- 2) v_prenex_22))))) 0)))) (= 0 (let ((.cse9 (+ v_prenex_19 1))) (+ (* v_prenex_18 (+ (* 3 (+ v_prenex_13 (- (* v_prenex_15 .cse9)))) (* (- 2) v_prenex_15))) (* (+ (* (- 2) v_prenex_17) (* 3 (+ v_prenex_20 (- (* v_prenex_17 .cse9))))) v_prenex_16))))))) (or .cse0 (forall ((v_prenex_27 Int) (v_prenex_29 Int) (v_prenex_28 Int) (v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_35 Int) (v_prenex_30 Int) (v_prenex_32 Int) (v_prenex_31 Int)) (let ((.cse11 (* v_prenex_32 v_prenex_31))) (or (exists ((v_prenex_38 Int) (v_prenex_37 Int) (v_prenex_39 Int) (v_prenex_36 Int) (v_prenex_41 Int) (v_prenex_40 Int)) (and (not (= (let ((.cse10 (+ v_prenex_34 1))) (+ (* (+ (* (+ (- (* v_prenex_36 .cse10)) v_prenex_39) 3) (* (- 2) v_prenex_36)) v_prenex_41) (* v_prenex_40 (+ (* (- 2) v_prenex_37) (* 3 (+ (- (* v_prenex_37 .cse10)) v_prenex_38)))))) 0)) (= (+ (* v_prenex_38 v_prenex_40) (* v_prenex_39 v_prenex_41)) v_prenex_28) (= (+ (* v_prenex_37 v_prenex_40) (* v_prenex_36 v_prenex_41)) (+ (* v_prenex_32 v_prenex_31) (* v_prenex_33 v_prenex_30))))) (not (= 0 (mod (+ v_prenex_29 (+ (* v_prenex_30 v_prenex_33) .cse11)) (- 2)))) (not (let ((.cse12 (+ .cse11 (* v_prenex_33 v_prenex_30)))) (= (+ v_prenex_29 (div (+ (* (- 1) v_prenex_29) .cse12) (- 2))) (* 2 .cse12)))) (= (let ((.cse13 (+ v_prenex_34 1))) (+ (* (+ (* 3 (+ (- (* v_prenex_33 .cse13)) v_prenex_35)) (* (- 2) v_prenex_33)) v_prenex_30) (* v_prenex_31 (+ (* (- 2) v_prenex_32) (* 3 (+ v_prenex_27 (- (* v_prenex_32 .cse13)))))))) 0)))) .cse6))) is different from true [2019-10-03 02:39:56,857 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| 0))) (.cse6 (not (= |c___VERIFIER_assert_#in~cond| 1)))) (and .cse0 (or (forall ((v_main_~p~0_BEFORE_CALL_139 Int) (v_main_~c~0_BEFORE_CALL_144 Int) (main_~q~0 Int) (main_~s~0 Int) (v_main_~y~0_BEFORE_CALL_151 Int) (v_main_~x~0_BEFORE_CALL_165 Int) (v_main_~k~0_BEFORE_CALL_128 Int) (v_main_~r~0_BEFORE_CALL_139 Int)) (let ((.cse3 (* main_~q~0 v_main_~x~0_BEFORE_CALL_165)) (.cse2 (* v_main_~y~0_BEFORE_CALL_151 main_~s~0))) (or (= 0 (let ((.cse1 (+ v_main_~k~0_BEFORE_CALL_128 1))) (+ (* (+ (* (- 2) main_~q~0) (* 3 (+ v_main_~p~0_BEFORE_CALL_139 (- (* main_~q~0 .cse1))))) v_main_~x~0_BEFORE_CALL_165) (* (+ (* 3 (+ (- (* main_~s~0 .cse1)) v_main_~r~0_BEFORE_CALL_139)) (* (- 2) main_~s~0)) v_main_~y~0_BEFORE_CALL_151)))) (not (= 0 (mod (+ v_main_~c~0_BEFORE_CALL_144 (+ .cse2 .cse3)) (- 2)))) (not (let ((.cse4 (+ .cse3 .cse2))) (= (+ (div (+ .cse4 (* (- 1) v_main_~c~0_BEFORE_CALL_144)) (- 2)) v_main_~c~0_BEFORE_CALL_144) (* .cse4 2)))) (exists ((main_~x~0 Int) (main_~y~0 Int) (v_prenex_12 Int) (v_prenex_11 Int) (main_~p~0 Int) (main_~r~0 Int)) (and (not (= (let ((.cse5 (+ v_main_~k~0_BEFORE_CALL_128 1))) (+ (* (+ (* 3 (+ main_~p~0 (- (* v_prenex_11 .cse5)))) (* (- 2) v_prenex_11)) main_~x~0) (* main_~y~0 (+ (* 3 (+ (- (* v_prenex_12 .cse5)) main_~r~0)) (* (- 2) v_prenex_12))))) 0)) (= (+ (* main_~q~0 v_main_~x~0_BEFORE_CALL_165) (* v_main_~y~0_BEFORE_CALL_151 main_~s~0)) (+ (* main_~y~0 v_prenex_12) (* main_~x~0 v_prenex_11))) (= (+ (* v_main_~y~0_BEFORE_CALL_151 v_main_~r~0_BEFORE_CALL_139) (* v_main_~p~0_BEFORE_CALL_139 v_main_~x~0_BEFORE_CALL_165)) (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))))))) .cse6) (or (forall ((v_main_~p~0_BEFORE_CALL_139 Int) (v_main_~a~0_BEFORE_CALL_47 Int) (v_main_~c~0_BEFORE_CALL_144 Int) (main_~q~0 Int) (main_~s~0 Int) (v_main_~y~0_BEFORE_CALL_151 Int) (v_main_~x~0_BEFORE_CALL_165 Int) (v_main_~k~0_BEFORE_CALL_128 Int) (v_main_~r~0_BEFORE_CALL_139 Int)) (let ((.cse10 (* main_~q~0 v_main_~x~0_BEFORE_CALL_165)) (.cse9 (* v_main_~y~0_BEFORE_CALL_151 main_~s~0))) (or (= v_main_~a~0_BEFORE_CALL_47 (+ (* v_main_~y~0_BEFORE_CALL_151 v_main_~r~0_BEFORE_CALL_139) (* v_main_~p~0_BEFORE_CALL_139 v_main_~x~0_BEFORE_CALL_165))) (= 0 (let ((.cse7 (+ v_main_~k~0_BEFORE_CALL_128 1))) (+ (* (+ (* (- 2) main_~q~0) (* 3 (+ v_main_~p~0_BEFORE_CALL_139 (- (* main_~q~0 .cse7))))) v_main_~x~0_BEFORE_CALL_165) (* (+ (* 3 (+ (- (* main_~s~0 .cse7)) v_main_~r~0_BEFORE_CALL_139)) (* (- 2) main_~s~0)) v_main_~y~0_BEFORE_CALL_151)))) (exists ((main_~x~0 Int) (main_~y~0 Int) (v_prenex_12 Int) (v_prenex_11 Int) (main_~p~0 Int) (main_~r~0 Int)) (and (= v_main_~a~0_BEFORE_CALL_47 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (not (= (let ((.cse8 (+ v_main_~k~0_BEFORE_CALL_128 1))) (+ (* (+ (* 3 (+ main_~p~0 (- (* v_prenex_11 .cse8)))) (* (- 2) v_prenex_11)) main_~x~0) (* main_~y~0 (+ (* 3 (+ (- (* v_prenex_12 .cse8)) main_~r~0)) (* (- 2) v_prenex_12))))) 0)) (= (+ (* main_~q~0 v_main_~x~0_BEFORE_CALL_165) (* v_main_~y~0_BEFORE_CALL_151 main_~s~0)) (+ (* main_~y~0 v_prenex_12) (* main_~x~0 v_prenex_11))))) (not (= 0 (mod (+ v_main_~c~0_BEFORE_CALL_144 (+ .cse9 .cse10)) (- 2)))) (not (let ((.cse11 (+ .cse10 .cse9))) (= (+ (div (+ .cse11 (* (- 1) v_main_~c~0_BEFORE_CALL_144)) (- 2)) v_main_~c~0_BEFORE_CALL_144) (* .cse11 2))))))) .cse0) (or .cse0 (forall ((v_main_~p~0_BEFORE_CALL_139 Int) (v_main_~a~0_BEFORE_CALL_47 Int) (v_main_~c~0_BEFORE_CALL_144 Int) (main_~q~0 Int) (main_~s~0 Int) (v_main_~y~0_BEFORE_CALL_151 Int) (v_main_~x~0_BEFORE_CALL_165 Int) (v_main_~k~0_BEFORE_CALL_128 Int) (v_main_~r~0_BEFORE_CALL_139 Int)) (let ((.cse15 (* main_~q~0 v_main_~x~0_BEFORE_CALL_165)) (.cse14 (* v_main_~y~0_BEFORE_CALL_151 main_~s~0))) (or (= 0 (let ((.cse12 (+ v_main_~k~0_BEFORE_CALL_128 1))) (+ (* (+ (* (- 2) main_~q~0) (* 3 (+ v_main_~p~0_BEFORE_CALL_139 (- (* main_~q~0 .cse12))))) v_main_~x~0_BEFORE_CALL_165) (* (+ (* 3 (+ (- (* main_~s~0 .cse12)) v_main_~r~0_BEFORE_CALL_139)) (* (- 2) main_~s~0)) v_main_~y~0_BEFORE_CALL_151)))) (exists ((main_~x~0 Int) (main_~y~0 Int) (v_prenex_12 Int) (v_prenex_11 Int) (main_~p~0 Int) (main_~r~0 Int)) (and (= v_main_~a~0_BEFORE_CALL_47 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (not (= (let ((.cse13 (+ v_main_~k~0_BEFORE_CALL_128 1))) (+ (* (+ (* 3 (+ main_~p~0 (- (* v_prenex_11 .cse13)))) (* (- 2) v_prenex_11)) main_~x~0) (* main_~y~0 (+ (* 3 (+ (- (* v_prenex_12 .cse13)) main_~r~0)) (* (- 2) v_prenex_12))))) 0)) (= (+ (* main_~q~0 v_main_~x~0_BEFORE_CALL_165) (* v_main_~y~0_BEFORE_CALL_151 main_~s~0)) (+ (* main_~y~0 v_prenex_12) (* main_~x~0 v_prenex_11))))) (not (= 0 (mod (+ v_main_~c~0_BEFORE_CALL_144 (+ .cse14 .cse15)) (- 2)))) (not (let ((.cse16 (+ .cse15 .cse14))) (= (+ (div (+ .cse16 (* (- 1) v_main_~c~0_BEFORE_CALL_144)) (- 2)) v_main_~c~0_BEFORE_CALL_144) (* .cse16 2))))))) .cse6))) is different from true [2019-10-03 02:39:56,907 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c___VERIFIER_assert_#in~cond| 1))) (and .cse0 (or (= |c___VERIFIER_assert_#in~cond| 0) (not .cse0) (forall ((v_main_~s~0_BEFORE_CALL_149 Int) (v_main_~c~0_BEFORE_CALL_143 Int) (v_main_~q~0_BEFORE_CALL_157 Int) (v_main_~r~0_BEFORE_CALL_138 Int) (v_main_~y~0_BEFORE_CALL_150 Int) (v_main_~k~0_BEFORE_CALL_127 Int) (v_main_~p~0_BEFORE_CALL_138 Int) (v_main_~x~0_BEFORE_CALL_164 Int)) (let ((.cse1 (+ (* v_main_~x~0_BEFORE_CALL_164 v_main_~q~0_BEFORE_CALL_157) (* v_main_~y~0_BEFORE_CALL_150 v_main_~s~0_BEFORE_CALL_149)))) (or (not (= 0 (mod (+ v_main_~c~0_BEFORE_CALL_143 .cse1) (- 2)))) (= 0 (let ((.cse2 (+ v_main_~k~0_BEFORE_CALL_127 1))) (+ (* (+ (* (- 2) v_main_~s~0_BEFORE_CALL_149) (* (+ (- (* .cse2 v_main_~s~0_BEFORE_CALL_149)) v_main_~r~0_BEFORE_CALL_138) 3)) v_main_~y~0_BEFORE_CALL_150) (* (+ (* (- 2) v_main_~q~0_BEFORE_CALL_157) (* (+ v_main_~p~0_BEFORE_CALL_138 (- (* .cse2 v_main_~q~0_BEFORE_CALL_157))) 3)) v_main_~x~0_BEFORE_CALL_164)))) (exists ((main_~q~0 Int) (main_~s~0 Int)) (and (not (= 0 (let ((.cse3 (+ v_main_~k~0_BEFORE_CALL_127 1))) (+ (* (+ (* (- 2) main_~q~0) (* (+ v_main_~p~0_BEFORE_CALL_138 (- (* main_~q~0 .cse3))) 3)) v_main_~x~0_BEFORE_CALL_164) (* (+ (* (+ (- (* main_~s~0 .cse3)) v_main_~r~0_BEFORE_CALL_138) 3) (* (- 2) main_~s~0)) v_main_~y~0_BEFORE_CALL_150))))) (= (+ (* v_main_~y~0_BEFORE_CALL_150 main_~s~0) (* main_~q~0 v_main_~x~0_BEFORE_CALL_164)) (+ (* v_main_~x~0_BEFORE_CALL_164 v_main_~q~0_BEFORE_CALL_157) (* v_main_~y~0_BEFORE_CALL_150 v_main_~s~0_BEFORE_CALL_149))))) (not (= (+ (div (+ (* (- 1) v_main_~c~0_BEFORE_CALL_143) .cse1) (- 2)) v_main_~c~0_BEFORE_CALL_143) (* 2 .cse1))))))))) is different from false [2019-10-03 02:39:57,508 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| 1))) (.cse5 (not (= |c___VERIFIER_assert_#in~cond| 0))) (.cse1 (= 0 c___VERIFIER_assert_~cond))) (and (or .cse0 .cse1 (forall ((v_main_~s~0_BEFORE_CALL_149 Int) (v_main_~c~0_BEFORE_CALL_143 Int) (v_main_~q~0_BEFORE_CALL_157 Int) (v_main_~r~0_BEFORE_CALL_138 Int) (v_main_~y~0_BEFORE_CALL_150 Int) (v_main_~k~0_BEFORE_CALL_127 Int) (v_main_~p~0_BEFORE_CALL_138 Int) (v_main_~x~0_BEFORE_CALL_164 Int)) (let ((.cse2 (+ (* v_main_~x~0_BEFORE_CALL_164 v_main_~q~0_BEFORE_CALL_157) (* v_main_~y~0_BEFORE_CALL_150 v_main_~s~0_BEFORE_CALL_149)))) (or (not (= 0 (mod (+ v_main_~c~0_BEFORE_CALL_143 .cse2) (- 2)))) (= 0 (let ((.cse3 (+ v_main_~k~0_BEFORE_CALL_127 1))) (+ (* (+ (* (- 2) v_main_~s~0_BEFORE_CALL_149) (* (+ (- (* .cse3 v_main_~s~0_BEFORE_CALL_149)) v_main_~r~0_BEFORE_CALL_138) 3)) v_main_~y~0_BEFORE_CALL_150) (* (+ (* (- 2) v_main_~q~0_BEFORE_CALL_157) (* (+ v_main_~p~0_BEFORE_CALL_138 (- (* .cse3 v_main_~q~0_BEFORE_CALL_157))) 3)) v_main_~x~0_BEFORE_CALL_164)))) (exists ((main_~q~0 Int) (main_~s~0 Int)) (and (not (= 0 (let ((.cse4 (+ v_main_~k~0_BEFORE_CALL_127 1))) (+ (* (+ (* (- 2) main_~q~0) (* (+ v_main_~p~0_BEFORE_CALL_138 (- (* main_~q~0 .cse4))) 3)) v_main_~x~0_BEFORE_CALL_164) (* (+ (* (+ (- (* main_~s~0 .cse4)) v_main_~r~0_BEFORE_CALL_138) 3) (* (- 2) main_~s~0)) v_main_~y~0_BEFORE_CALL_150))))) (= (+ (* v_main_~y~0_BEFORE_CALL_150 main_~s~0) (* main_~q~0 v_main_~x~0_BEFORE_CALL_164)) (+ (* v_main_~x~0_BEFORE_CALL_164 v_main_~q~0_BEFORE_CALL_157) (* v_main_~y~0_BEFORE_CALL_150 v_main_~s~0_BEFORE_CALL_149))))) (not (= (+ (div (+ (* (- 1) v_main_~c~0_BEFORE_CALL_143) .cse2) (- 2)) v_main_~c~0_BEFORE_CALL_143) (* 2 .cse2))))))) (or .cse5 .cse0 .cse1) (or .cse5 (forall ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_main_~b~0_BEFORE_CALL_126 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_prenex_8 Int)) (or (exists ((v_prenex_10 Int) (v_prenex_9 Int)) (and (= (+ (* v_prenex_9 v_prenex_8) (* v_prenex_10 v_prenex_5)) v_main_~b~0_BEFORE_CALL_126) (not (= 0 (let ((.cse6 (+ v_prenex_6 1))) (+ (* v_prenex_5 (+ (* (- 2) v_prenex_10) (* (+ (- (* .cse6 v_prenex_10)) v_prenex_4) 3))) (* (+ (* (+ (- (* .cse6 v_prenex_9)) v_prenex_7) 3) (* (- 2) v_prenex_9)) v_prenex_8))))))) (not (= 0 (mod (+ v_prenex_2 v_main_~b~0_BEFORE_CALL_126) (- 2)))) (= (+ (* v_prenex_5 v_prenex_1) (* v_prenex_8 v_prenex_3)) v_main_~b~0_BEFORE_CALL_126) (= 0 (let ((.cse7 (+ v_prenex_6 1))) (+ (* v_prenex_5 (+ (* (- 2) v_prenex_1) (* (+ v_prenex_4 (- (* .cse7 v_prenex_1))) 3))) (* v_prenex_8 (+ (* 3 (+ v_prenex_7 (- (* .cse7 v_prenex_3)))) (* (- 2) v_prenex_3)))))) (not (= (+ v_prenex_2 (div (+ v_main_~b~0_BEFORE_CALL_126 (* (- 1) v_prenex_2)) (- 2))) (* 2 v_main_~b~0_BEFORE_CALL_126))))) .cse1) (= 1 c___VERIFIER_assert_~cond) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond))) is different from false [2019-10-03 02:40:25,990 WARN L191 SmtUtils]: Spent 22.25 s on a formula simplification. DAG size of input: 149 DAG size of output: 78 [2019-10-03 02:40:46,764 WARN L191 SmtUtils]: Spent 16.35 s on a formula simplification. DAG size of input: 98 DAG size of output: 4 [2019-10-03 02:40:54,842 WARN L191 SmtUtils]: Spent 2.69 s on a formula simplification that was a NOOP. DAG size: 139 [2019-10-03 02:41:05,652 WARN L191 SmtUtils]: Spent 8.34 s on a formula simplification. DAG size of input: 153 DAG size of output: 7 [2019-10-03 02:41:09,011 WARN L191 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 155 DAG size of output: 147 [2019-10-03 02:41:55,309 WARN L191 SmtUtils]: Spent 42.61 s on a formula simplification that was a NOOP. DAG size: 162 [2019-10-03 02:42:16,484 WARN L191 SmtUtils]: Spent 12.74 s on a formula simplification. DAG size of input: 255 DAG size of output: 91 [2019-10-03 02:42:37,562 WARN L191 SmtUtils]: Spent 16.79 s on a formula simplification. DAG size of input: 256 DAG size of output: 93 [2019-10-03 02:42:42,064 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_main_~k~0 1))) (let ((.cse3 (- c_main_~c~0)) (.cse2 (* 2 c_main_~b~0)) (.cse4 (+ c_main_~p~0 (- (* c_main_~q~0 c_main_~k~0)))) (.cse5 (+ (- (* c_main_~k~0 c_main_~s~0)) c_main_~r~0)) (.cse7 (+ c_main_~p~0 (- (* c_main_~q~0 .cse1)))) (.cse6 (+ c_main_~r~0 (- (* c_main_~s~0 .cse1))))) (and (or (= 0 (let ((.cse0 (+ c_main_~k~0 2))) (+ (* (+ c_main_~p~0 (- (* .cse0 c_main_~q~0))) c_main_~x~0) (* c_main_~y~0 (+ c_main_~r~0 (- (* .cse0 c_main_~s~0))))))) (not (= (+ c_main_~b~0 (* c_main_~b~0 .cse1)) c_main_~a~0)) (not (= .cse2 c_main_~c~0))) (or (not (= c_main_~b~0 (+ (div .cse3 (- 2)) c_main_~c~0))) (= 0 (+ (* c_main_~x~0 (+ (* .cse4 3) (* (- 2) c_main_~q~0))) (* (+ (* 3 .cse5) (* (- 2) c_main_~s~0)) c_main_~y~0))) (not (= (mod c_main_~c~0 (- 2)) 0))) (or (not (= 0 (mod c_main_~b~0 (- 2)))) (not (= (+ (div (- c_main_~b~0) (- 2)) c_main_~b~0) c_main_~c~0)) (= (+ (* c_main_~y~0 (+ c_main_~s~0 (* .cse6 (- 2)))) (* c_main_~x~0 (+ (* (- 2) .cse7) c_main_~q~0))) 0)) (or (= 0 (+ (* .cse4 c_main_~x~0) (* c_main_~y~0 .cse5))) (not (= c_main_~c~0 0))) (or (not (= (+ (div (+ (- (* (- 1) c_main_~b~0)) .cse3) (- 2)) c_main_~c~0) .cse2)) (forall ((main_~q~0 Int) (main_~s~0 Int)) (or (not (= c_main_~b~0 (+ (* c_main_~y~0 main_~s~0) (* main_~q~0 c_main_~x~0)))) (= 0 (let ((.cse8 (+ c_main_~k~0 1))) (+ (* c_main_~x~0 (+ (* 3 (+ c_main_~p~0 (- (* main_~q~0 .cse8)))) (* (- 2) main_~q~0))) (* (+ (* (+ c_main_~r~0 (- (* main_~s~0 .cse8))) 3) (* (- 2) main_~s~0)) c_main_~y~0)))))) (not (= 0 (mod (+ c_main_~b~0 c_main_~c~0) (- 2))))) (or (= 0 (+ (* (+ (* .cse4 (- 2)) c_main_~q~0) c_main_~x~0) (* c_main_~y~0 (+ (* (- 2) .cse5) c_main_~s~0)))) (not (= c_main_~b~0 (* 2 c_main_~c~0)))) (or (= (+ (* c_main_~x~0 .cse7) (* .cse6 c_main_~y~0)) 0) (not (= c_main_~b~0 c_main_~c~0)))))) is different from true [2019-10-03 02:42:44,538 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2019-10-03 02:42:49,002 WARN L191 SmtUtils]: Spent 333.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-10-03 02:42:51,704 WARN L191 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-10-03 02:43:01,053 WARN L191 SmtUtils]: Spent 2.56 s on a formula simplification that was a NOOP. DAG size: 108 [2019-10-03 02:43:13,355 WARN L191 SmtUtils]: Spent 661.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-10-03 02:43:23,181 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-10-03 02:43:26,300 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-10-03 02:43:35,507 WARN L191 SmtUtils]: Spent 2.52 s on a formula simplification that was a NOOP. DAG size: 89 [2019-10-03 02:43:44,893 WARN L191 SmtUtils]: Spent 345.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-10-03 02:43:47,303 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_main_~p~0 (- (* c_main_~q~0 c_main_~k~0)))) (.cse3 (+ (- (* c_main_~k~0 c_main_~s~0)) c_main_~r~0)) (.cse0 (- c_main_~c~0)) (.cse2 (* (- 2) c_main_~q~0)) (.cse4 (* (- 2) c_main_~s~0))) (and (or (not (= c_main_~b~0 (+ (div .cse0 (- 2)) c_main_~c~0))) (= 0 (+ (* c_main_~x~0 (+ (* .cse1 3) .cse2)) (* (+ (* 3 .cse3) .cse4) c_main_~y~0))) (not (= (mod c_main_~c~0 (- 2)) 0))) (or (= 0 (+ (* .cse1 c_main_~x~0) (* c_main_~y~0 .cse3))) (not (= c_main_~c~0 0))) (exists ((main_~p~0 Int) (v_main_~s~0_38 Int)) (let ((.cse5 (+ (* main_~p~0 c_main_~x~0) (* v_main_~s~0_38 c_main_~y~0)))) (= (+ (+ (* c_main_~y~0 (+ c_main_~s~0 (* 2 v_main_~s~0_38))) (* c_main_~x~0 (+ (* 2 main_~p~0) c_main_~q~0))) (* .cse5 (- 1))) (+ .cse5 c_main_~b~0)))) (or (not (= (+ (div (+ (- (* (- 1) c_main_~b~0)) .cse0) (- 2)) c_main_~c~0) (* 2 c_main_~b~0))) (not (= 0 (mod (+ c_main_~b~0 c_main_~c~0) (- 2)))) (= 0 (let ((.cse6 (+ c_main_~k~0 1))) (+ (* c_main_~x~0 (+ (* 3 (+ c_main_~p~0 (- (* c_main_~q~0 .cse6)))) .cse2)) (* (+ (* (+ c_main_~r~0 (- (* c_main_~s~0 .cse6))) 3) .cse4) c_main_~y~0))))))) is different from false [2019-10-03 02:44:03,006 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-10-03 02:44:07,321 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-10-03 02:44:07,809 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2019-10-03 02:44:16,744 WARN L191 SmtUtils]: Spent 2.16 s on a formula simplification that was a NOOP. DAG size: 82 [2019-10-03 02:44:33,864 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-10-03 02:44:34,216 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-10-03 02:44:36,859 WARN L191 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-10-03 02:44:40,895 WARN L191 SmtUtils]: Spent 2.60 s on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2019-10-03 02:44:44,318 WARN L191 SmtUtils]: Spent 936.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 92 [2019-10-03 02:44:45,335 WARN L191 SmtUtils]: Spent 378.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-10-03 02:45:00,282 WARN L191 SmtUtils]: Spent 2.54 s on a formula simplification that was a NOOP. DAG size: 97 [2019-10-03 02:45:02,738 WARN L191 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 49 [2019-10-03 02:45:04,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:04,559 INFO L93 Difference]: Finished difference Result 506 states and 720 transitions. [2019-10-03 02:45:04,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-10-03 02:45:04,560 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 174 [2019-10-03 02:45:04,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:04,564 INFO L225 Difference]: With dead ends: 506 [2019-10-03 02:45:04,564 INFO L226 Difference]: Without dead ends: 502 [2019-10-03 02:45:04,566 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 313 SyntacticMatches, 14 SemanticMatches, 85 ConstructedPredicates, 17 IntricatePredicates, 2 DeprecatedPredicates, 1311 ImplicationChecksByTransitivity, 292.8s TimeCoverageRelationStatistics Valid=686, Invalid=4130, Unknown=82, NotChecked=2584, Total=7482 [2019-10-03 02:45:04,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-10-03 02:45:04,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 426. [2019-10-03 02:45:04,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-10-03 02:45:04,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 612 transitions. [2019-10-03 02:45:04,588 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 612 transitions. Word has length 174 [2019-10-03 02:45:04,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:04,589 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 612 transitions. [2019-10-03 02:45:04,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-03 02:45:04,589 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 612 transitions. [2019-10-03 02:45:04,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-10-03 02:45:04,595 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:04,595 INFO L411 BasicCegarLoop]: trace histogram [45, 44, 44, 11, 11, 11, 11, 11, 11, 11, 11, 11, 8, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:45:04,595 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:04,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:04,596 INFO L82 PathProgramCache]: Analyzing trace with hash -794016017, now seen corresponding path program 4 times [2019-10-03 02:45:04,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:04,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:04,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:45:04,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:04,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:04,604 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-03 02:45:04,604 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-03 02:45:04,604 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-03 02:45:04,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:04,652 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-10-03 02:45:04,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:04,724 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:45:04,724 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:45:04,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:45:04,724 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-10-03 02:45:04,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:04,763 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:45:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:04,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 101 conjunts are in the unsatisfiable core [2019-10-03 02:45:04,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:45:05,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:45:06,121 INFO L134 CoverageAnalysis]: Checked inductivity of 4217 backedges. 88 proven. 345 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2019-10-03 02:45:06,121 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:45:07,300 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-10-03 02:45:11,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4217 backedges. 88 proven. 339 refuted. 6 times theorem prover too weak. 3784 trivial. 0 not checked. [2019-10-03 02:45:11,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-03 02:45:11,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2019-10-03 02:45:11,913 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:45:11,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-03 02:45:11,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-03 02:45:11,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1193, Unknown=1, NotChecked=0, Total=1406 [2019-10-03 02:45:11,914 INFO L87 Difference]: Start difference. First operand 426 states and 612 transitions. Second operand 38 states. [2019-10-03 02:45:13,136 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 188 [2019-10-03 02:45:17,382 WARN L191 SmtUtils]: Spent 2.81 s on a formula simplification that was a NOOP. DAG size: 231 [2019-10-03 02:45:18,994 WARN L191 SmtUtils]: Spent 1.35 s on a formula simplification that was a NOOP. DAG size: 130 [2019-10-03 02:45:25,635 WARN L191 SmtUtils]: Spent 1.65 s on a formula simplification that was a NOOP. DAG size: 127 [2019-10-03 02:45:27,208 WARN L191 SmtUtils]: Spent 537.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-10-03 02:45:32,314 WARN L191 SmtUtils]: Spent 845.00 ms on a formula simplification that was a NOOP. DAG size: 195 [2019-10-03 02:45:36,628 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-10-03 02:45:37,553 WARN L191 SmtUtils]: Spent 736.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-10-03 02:45:39,514 WARN L191 SmtUtils]: Spent 816.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-10-03 02:45:43,890 WARN L191 SmtUtils]: Spent 651.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-10-03 02:45:44,784 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-10-03 02:45:57,928 WARN L191 SmtUtils]: Spent 5.58 s on a formula simplification that was a NOOP. DAG size: 198 [2019-10-03 02:46:00,922 WARN L191 SmtUtils]: Spent 697.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-10-03 02:46:08,695 WARN L191 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 147 [2019-10-03 02:46:13,109 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-10-03 02:46:14,156 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-10-03 02:46:40,291 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-10-03 02:46:43,412 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 36 [2019-10-03 02:46:57,588 WARN L191 SmtUtils]: Spent 5.70 s on a formula simplification that was a NOOP. DAG size: 202 [2019-10-03 02:46:59,090 WARN L191 SmtUtils]: Spent 464.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-10-03 02:46:59,730 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 39 [2019-10-03 02:47:04,985 WARN L191 SmtUtils]: Spent 4.92 s on a formula simplification that was a NOOP. DAG size: 132 [2019-10-03 02:47:18,229 WARN L191 SmtUtils]: Spent 5.10 s on a formula simplification that was a NOOP. DAG size: 130 [2019-10-03 02:47:22,322 WARN L191 SmtUtils]: Spent 948.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2019-10-03 02:47:23,433 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-10-03 02:47:35,124 WARN L191 SmtUtils]: Spent 3.87 s on a formula simplification that was a NOOP. DAG size: 144 [2019-10-03 02:47:43,651 WARN L191 SmtUtils]: Spent 2.84 s on a formula simplification that was a NOOP. DAG size: 98 [2019-10-03 02:47:44,018 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-10-03 02:48:00,468 WARN L191 SmtUtils]: Spent 6.38 s on a formula simplification that was a NOOP. DAG size: 86 [2019-10-03 02:48:03,527 WARN L191 SmtUtils]: Spent 1.76 s on a formula simplification that was a NOOP. DAG size: 100 [2019-10-03 02:48:04,908 WARN L191 SmtUtils]: Spent 789.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-10-03 02:48:12,413 WARN L191 SmtUtils]: Spent 475.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-10-03 02:48:15,005 WARN L191 SmtUtils]: Spent 1.19 s on a formula simplification that was a NOOP. DAG size: 84 [2019-10-03 02:48:15,711 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-10-03 02:48:19,349 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-10-03 02:48:23,564 WARN L191 SmtUtils]: Spent 489.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-10-03 02:48:25,204 WARN L191 SmtUtils]: Spent 1.19 s on a formula simplification that was a NOOP. DAG size: 57 [2019-10-03 02:48:39,159 WARN L191 SmtUtils]: Spent 3.85 s on a formula simplification that was a NOOP. DAG size: 70 [2019-10-03 02:48:42,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:48:42,596 INFO L93 Difference]: Finished difference Result 997 states and 1533 transitions. [2019-10-03 02:48:42,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-10-03 02:48:42,596 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 262 [2019-10-03 02:48:42,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:48:42,604 INFO L225 Difference]: With dead ends: 997 [2019-10-03 02:48:42,604 INFO L226 Difference]: Without dead ends: 992 [2019-10-03 02:48:42,610 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 489 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5032 ImplicationChecksByTransitivity, 99.0s TimeCoverageRelationStatistics Valid=2684, Invalid=16497, Unknown=1, NotChecked=0, Total=19182 [2019-10-03 02:48:42,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2019-10-03 02:48:42,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 725. [2019-10-03 02:48:42,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2019-10-03 02:48:42,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1088 transitions. [2019-10-03 02:48:42,646 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1088 transitions. Word has length 262 [2019-10-03 02:48:42,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:48:42,647 INFO L475 AbstractCegarLoop]: Abstraction has 725 states and 1088 transitions. [2019-10-03 02:48:42,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-03 02:48:42,647 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1088 transitions. [2019-10-03 02:48:42,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-10-03 02:48:42,654 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:48:42,655 INFO L411 BasicCegarLoop]: trace histogram [53, 52, 52, 13, 13, 13, 13, 13, 13, 13, 13, 13, 10, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:48:42,655 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:48:42,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:48:42,655 INFO L82 PathProgramCache]: Analyzing trace with hash 530452879, now seen corresponding path program 5 times [2019-10-03 02:48:42,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:48:42,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:42,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:48:42,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:42,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:48:42,664 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-03 02:48:42,664 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-03 02:48:42,665 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-10-03 02:48:42,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:48:42,722 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-10-03 02:48:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:48:42,811 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:48:42,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:48:42,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:48:42,811 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:48:42,866 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:48:42,866 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:48:59,350 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-03 02:48:59,351 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:48:59,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 56 conjunts are in the unsatisfiable core [2019-10-03 02:48:59,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:49:16,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:49:16,272 INFO L134 CoverageAnalysis]: Checked inductivity of 5891 backedges. 682 proven. 152 refuted. 0 times theorem prover too weak. 5057 trivial. 0 not checked. [2019-10-03 02:49:16,273 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:49:16,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:49:16,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:49:16,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:49:16,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:49:16,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:49:16,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:49:16,687 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-10-03 02:49:18,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:49:26,961 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| 1)))) (and (or .cse0 (forall ((v_main_~r~0_BEFORE_CALL_265 Int) (v_main_~s~0_BEFORE_CALL_247 Int) (v_main_~k~0_81 Int) (v_main_~x~0_BEFORE_CALL_313 Int) (v_main_~p~0_BEFORE_CALL_265 Int) (v_main_~q~0_BEFORE_CALL_255 Int) (v_main_~y~0_BEFORE_CALL_280 Int)) (or (= 0 (+ (* (+ (- (* v_main_~k~0_81 v_main_~s~0_BEFORE_CALL_247)) v_main_~r~0_BEFORE_CALL_265) v_main_~y~0_BEFORE_CALL_280) (* (+ v_main_~p~0_BEFORE_CALL_265 (- (* v_main_~k~0_81 v_main_~q~0_BEFORE_CALL_255))) v_main_~x~0_BEFORE_CALL_313))) (exists ((main_~q~0 Int) (v_prenex_42 Int) (main_~s~0 Int)) (let ((.cse1 (+ (* v_main_~y~0_BEFORE_CALL_280 v_main_~s~0_BEFORE_CALL_247) (* v_main_~x~0_BEFORE_CALL_313 v_main_~q~0_BEFORE_CALL_255)))) (and (= (+ (* v_main_~y~0_BEFORE_CALL_280 main_~s~0) (* main_~q~0 v_main_~x~0_BEFORE_CALL_313)) .cse1) (not (= 0 (+ (* (+ v_main_~p~0_BEFORE_CALL_265 (- (* main_~q~0 v_prenex_42))) v_main_~x~0_BEFORE_CALL_313) (* v_main_~y~0_BEFORE_CALL_280 (+ (- (* main_~s~0 v_prenex_42)) v_main_~r~0_BEFORE_CALL_265))))) (= (+ 0 (* v_prenex_42 .cse1)) (+ 0 (* v_main_~k~0_81 .cse1)))))) (not true)))) (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((v_main_~r~0_BEFORE_CALL_265 Int) (v_main_~s~0_BEFORE_CALL_247 Int) (v_main_~k~0_81 Int) (v_main_~x~0_BEFORE_CALL_313 Int) (v_main_~p~0_BEFORE_CALL_265 Int) (v_main_~q~0_BEFORE_CALL_255 Int) (v_main_~y~0_BEFORE_CALL_280 Int)) (or (= 0 (+ (* (+ (- (* v_main_~k~0_81 v_main_~s~0_BEFORE_CALL_247)) v_main_~r~0_BEFORE_CALL_265) v_main_~y~0_BEFORE_CALL_280) (* (+ v_main_~p~0_BEFORE_CALL_265 (- (* v_main_~k~0_81 v_main_~q~0_BEFORE_CALL_255))) v_main_~x~0_BEFORE_CALL_313))) (exists ((main_~q~0 Int) (v_prenex_42 Int) (main_~s~0 Int)) (let ((.cse2 (+ (* v_main_~y~0_BEFORE_CALL_280 v_main_~s~0_BEFORE_CALL_247) (* v_main_~x~0_BEFORE_CALL_313 v_main_~q~0_BEFORE_CALL_255)))) (and (= (+ (* v_main_~y~0_BEFORE_CALL_280 main_~s~0) (* main_~q~0 v_main_~x~0_BEFORE_CALL_313)) .cse2) (not (= 0 (+ (* (+ v_main_~p~0_BEFORE_CALL_265 (- (* main_~q~0 v_prenex_42))) v_main_~x~0_BEFORE_CALL_313) (* v_main_~y~0_BEFORE_CALL_280 (+ (- (* main_~s~0 v_prenex_42)) v_main_~r~0_BEFORE_CALL_265))))) (= (+ 0 (* v_prenex_42 .cse2)) (+ 0 (* v_main_~k~0_81 .cse2)))))))) .cse0))) is different from true [2019-10-03 02:49:28,968 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-10-03 02:49:32,990 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_main_~r~0_BEFORE_CALL_265 Int) (v_main_~s~0_BEFORE_CALL_247 Int) (v_main_~k~0_81 Int) (v_main_~x~0_BEFORE_CALL_313 Int) (v_main_~p~0_BEFORE_CALL_265 Int) (v_main_~q~0_BEFORE_CALL_255 Int) (v_main_~y~0_BEFORE_CALL_280 Int)) (or (= 0 (+ (* (+ (- (* v_main_~k~0_81 v_main_~s~0_BEFORE_CALL_247)) v_main_~r~0_BEFORE_CALL_265) v_main_~y~0_BEFORE_CALL_280) (* (+ v_main_~p~0_BEFORE_CALL_265 (- (* v_main_~k~0_81 v_main_~q~0_BEFORE_CALL_255))) v_main_~x~0_BEFORE_CALL_313))) (exists ((main_~q~0 Int) (v_prenex_42 Int) (main_~s~0 Int)) (let ((.cse0 (+ (* v_main_~y~0_BEFORE_CALL_280 v_main_~s~0_BEFORE_CALL_247) (* v_main_~x~0_BEFORE_CALL_313 v_main_~q~0_BEFORE_CALL_255)))) (and (= (+ (* v_main_~y~0_BEFORE_CALL_280 main_~s~0) (* main_~q~0 v_main_~x~0_BEFORE_CALL_313)) .cse0) (not (= 0 (+ (* (+ v_main_~p~0_BEFORE_CALL_265 (- (* main_~q~0 v_prenex_42))) v_main_~x~0_BEFORE_CALL_313) (* v_main_~y~0_BEFORE_CALL_280 (+ (- (* main_~s~0 v_prenex_42)) v_main_~r~0_BEFORE_CALL_265))))) (= (+ 0 (* v_prenex_42 .cse0)) (+ 0 (* v_main_~k~0_81 .cse0)))))))) (not (= |c___VERIFIER_assert_#in~cond| 1))) is different from true [2019-10-03 02:49:46,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:49:46,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:49:46,723 INFO L134 CoverageAnalysis]: Checked inductivity of 5891 backedges. 855 proven. 199 refuted. 14 times theorem prover too weak. 4812 trivial. 11 not checked. [2019-10-03 02:49:46,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-03 02:49:46,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 26 [2019-10-03 02:49:46,727 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:49:46,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-03 02:49:46,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-03 02:49:46,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=465, Unknown=14, NotChecked=90, Total=650 [2019-10-03 02:49:46,728 INFO L87 Difference]: Start difference. First operand 725 states and 1088 transitions. Second operand 26 states. [2019-10-03 02:50:15,292 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c___VERIFIER_assert_#in~cond| 1))) (and .cse0 (or (forall ((v_main_~r~0_BEFORE_CALL_265 Int) (v_main_~s~0_BEFORE_CALL_247 Int) (v_main_~k~0_81 Int) (v_main_~x~0_BEFORE_CALL_313 Int) (v_main_~p~0_BEFORE_CALL_265 Int) (v_main_~q~0_BEFORE_CALL_255 Int) (v_main_~y~0_BEFORE_CALL_280 Int)) (or (= 0 (+ (* (+ (- (* v_main_~k~0_81 v_main_~s~0_BEFORE_CALL_247)) v_main_~r~0_BEFORE_CALL_265) v_main_~y~0_BEFORE_CALL_280) (* (+ v_main_~p~0_BEFORE_CALL_265 (- (* v_main_~k~0_81 v_main_~q~0_BEFORE_CALL_255))) v_main_~x~0_BEFORE_CALL_313))) (exists ((main_~q~0 Int) (v_prenex_42 Int) (main_~s~0 Int)) (let ((.cse1 (+ (* v_main_~y~0_BEFORE_CALL_280 v_main_~s~0_BEFORE_CALL_247) (* v_main_~x~0_BEFORE_CALL_313 v_main_~q~0_BEFORE_CALL_255)))) (and (= (+ (* v_main_~y~0_BEFORE_CALL_280 main_~s~0) (* main_~q~0 v_main_~x~0_BEFORE_CALL_313)) .cse1) (not (= 0 (+ (* (+ v_main_~p~0_BEFORE_CALL_265 (- (* main_~q~0 v_prenex_42))) v_main_~x~0_BEFORE_CALL_313) (* v_main_~y~0_BEFORE_CALL_280 (+ (- (* main_~s~0 v_prenex_42)) v_main_~r~0_BEFORE_CALL_265))))) (= (+ 0 (* v_prenex_42 .cse1)) (+ 0 (* v_main_~k~0_81 .cse1)))))))) (not .cse0)))) is different from false [2019-10-03 02:50:17,299 WARN L838 $PredicateComparison]: unable to prove that (and (or (forall ((v_main_~r~0_BEFORE_CALL_265 Int) (v_main_~s~0_BEFORE_CALL_247 Int) (v_main_~k~0_81 Int) (v_main_~x~0_BEFORE_CALL_313 Int) (v_main_~p~0_BEFORE_CALL_265 Int) (v_main_~q~0_BEFORE_CALL_255 Int) (v_main_~y~0_BEFORE_CALL_280 Int)) (or (= 0 (+ (* (+ (- (* v_main_~k~0_81 v_main_~s~0_BEFORE_CALL_247)) v_main_~r~0_BEFORE_CALL_265) v_main_~y~0_BEFORE_CALL_280) (* (+ v_main_~p~0_BEFORE_CALL_265 (- (* v_main_~k~0_81 v_main_~q~0_BEFORE_CALL_255))) v_main_~x~0_BEFORE_CALL_313))) (exists ((main_~q~0 Int) (v_prenex_42 Int) (main_~s~0 Int)) (let ((.cse0 (+ (* v_main_~y~0_BEFORE_CALL_280 v_main_~s~0_BEFORE_CALL_247) (* v_main_~x~0_BEFORE_CALL_313 v_main_~q~0_BEFORE_CALL_255)))) (and (= (+ (* v_main_~y~0_BEFORE_CALL_280 main_~s~0) (* main_~q~0 v_main_~x~0_BEFORE_CALL_313)) .cse0) (not (= 0 (+ (* (+ v_main_~p~0_BEFORE_CALL_265 (- (* main_~q~0 v_prenex_42))) v_main_~x~0_BEFORE_CALL_313) (* v_main_~y~0_BEFORE_CALL_280 (+ (- (* main_~s~0 v_prenex_42)) v_main_~r~0_BEFORE_CALL_265))))) (= (+ 0 (* v_prenex_42 .cse0)) (+ 0 (* v_main_~k~0_81 .cse0)))))))) (not (= |c___VERIFIER_assert_#in~cond| 1))) (= 1 c___VERIFIER_assert_~cond) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond)) is different from false