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/hard.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:23:48,266 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:23:48,267 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:23:48,284 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:23:48,284 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:23:48,286 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:23:48,288 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:23:48,298 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:23:48,299 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:23:48,305 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:23:48,306 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:23:48,307 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:23:48,308 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:23:48,310 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:23:48,310 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:23:48,312 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:23:48,313 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:23:48,314 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:23:48,318 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:23:48,321 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:23:48,324 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:23:48,326 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:23:48,327 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:23:48,329 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:23:48,333 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:23:48,333 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:23:48,333 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:23:48,334 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:23:48,336 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:23:48,337 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:23:48,337 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:23:48,338 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:23:48,339 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:23:48,342 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:23:48,343 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:23:48,343 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:23:48,343 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:23:48,344 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:23:48,344 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:23:48,345 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:23:48,348 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:23:48,349 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 02:23:48,367 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:23:48,367 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:23:48,368 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:23:48,368 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:23:48,368 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:23:48,369 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:23:48,369 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:23:48,369 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:23:48,369 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:23:48,369 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:23:48,370 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:23:48,370 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:23:48,370 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:23:48,371 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:23:48,371 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:23:48,371 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:23:48,371 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:23:48,371 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:23:48,371 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:23:48,372 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:23:48,372 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:23:48,372 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:23:48,372 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:23:48,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:23:48,373 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:23:48,373 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:23:48,373 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:23:48,373 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:23:48,373 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:23:48,374 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:23:48,408 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:23:48,420 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:23:48,423 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:23:48,424 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:23:48,425 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:23:48,425 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/hard.c [2019-09-10 02:23:48,481 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6515cdd70/837488766c5b445c9175fe82f1051132/FLAG034df2217 [2019-09-10 02:23:48,886 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:23:48,887 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/hard.c [2019-09-10 02:23:48,895 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6515cdd70/837488766c5b445c9175fe82f1051132/FLAG034df2217 [2019-09-10 02:23:49,292 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6515cdd70/837488766c5b445c9175fe82f1051132 [2019-09-10 02:23:49,301 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:23:49,302 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:23:49,303 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:23:49,303 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:23:49,307 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:23:49,308 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:23:49" (1/1) ... [2019-09-10 02:23:49,310 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b0885a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:23:49, skipping insertion in model container [2019-09-10 02:23:49,311 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:23:49" (1/1) ... [2019-09-10 02:23:49,318 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:23:49,336 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:23:49,518 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:23:49,524 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:23:49,552 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:23:49,566 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:23:49,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:23:49 WrapperNode [2019-09-10 02:23:49,567 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:23:49,568 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:23:49,568 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:23:49,568 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:23:49,661 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:23:49" (1/1) ... [2019-09-10 02:23:49,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:23:49" (1/1) ... [2019-09-10 02:23:49,667 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:23:49" (1/1) ... [2019-09-10 02:23:49,667 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:23:49" (1/1) ... [2019-09-10 02:23:49,671 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:23:49" (1/1) ... [2019-09-10 02:23:49,680 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:23:49" (1/1) ... [2019-09-10 02:23:49,681 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:23:49" (1/1) ... [2019-09-10 02:23:49,683 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:23:49,683 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:23:49,684 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:23:49,684 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:23:49,684 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:23:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:23:49,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:23:49,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:23:49,734 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-10 02:23:49,734 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:23:49,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:23:49,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:23:49,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 02:23:49,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 02:23:49,735 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:23:49,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:23:49,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:23:49,931 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:23:49,931 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-10 02:23:49,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:23:49 BoogieIcfgContainer [2019-09-10 02:23:49,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:23:49,933 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:23:49,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:23:49,936 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:23:49,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:23:49" (1/3) ... [2019-09-10 02:23:49,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f7b04e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:23:49, skipping insertion in model container [2019-09-10 02:23:49,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:23:49" (2/3) ... [2019-09-10 02:23:49,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f7b04e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:23:49, skipping insertion in model container [2019-09-10 02:23:49,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:23:49" (3/3) ... [2019-09-10 02:23:49,940 INFO L109 eAbstractionObserver]: Analyzing ICFG hard.c [2019-09-10 02:23:49,949 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:23:49,959 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:23:49,976 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:23:50,003 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:23:50,003 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:23:50,003 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:23:50,003 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:23:50,003 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:23:50,003 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:23:50,004 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:23:50,004 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:23:50,017 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-09-10 02:23:50,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-10 02:23:50,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:23:50,027 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:23:50,029 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:23:50,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:23:50,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1301090018, now seen corresponding path program 1 times [2019-09-10 02:23:50,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:23:50,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:23:50,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:23:50,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:23:50,071 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:23:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:23:50,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:23:50,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:23:50,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:23:50,205 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:23:50,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:23:50,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:23:50,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:23:50,231 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2019-09-10 02:23:50,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:23:50,351 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2019-09-10 02:23:50,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:23:50,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-09-10 02:23:50,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:23:50,363 INFO L225 Difference]: With dead ends: 42 [2019-09-10 02:23:50,364 INFO L226 Difference]: Without dead ends: 34 [2019-09-10 02:23:50,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:23:50,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-10 02:23:50,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2019-09-10 02:23:50,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-10 02:23:50,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2019-09-10 02:23:50,409 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2019-09-10 02:23:50,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:23:50,410 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-09-10 02:23:50,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:23:50,410 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2019-09-10 02:23:50,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-10 02:23:50,411 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:23:50,411 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:23:50,412 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:23:50,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:23:50,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1931384136, now seen corresponding path program 1 times [2019-09-10 02:23:50,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:23:50,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:23:50,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:23:50,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:23:50,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:23:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:23:50,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:23:50,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:23:50,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:23:50,468 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:23:50,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:23:50,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:23:50,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:23:50,471 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand 5 states. [2019-09-10 02:23:50,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:23:50,569 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2019-09-10 02:23:50,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:23:50,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-10 02:23:50,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:23:50,572 INFO L225 Difference]: With dead ends: 38 [2019-09-10 02:23:50,572 INFO L226 Difference]: Without dead ends: 38 [2019-09-10 02:23:50,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:23:50,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-10 02:23:50,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2019-09-10 02:23:50,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-10 02:23:50,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2019-09-10 02:23:50,589 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 15 [2019-09-10 02:23:50,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:23:50,589 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-09-10 02:23:50,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:23:50,590 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2019-09-10 02:23:50,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-10 02:23:50,591 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:23:50,591 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:23:50,592 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:23:50,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:23:50,592 INFO L82 PathProgramCache]: Analyzing trace with hash -2005010146, now seen corresponding path program 1 times [2019-09-10 02:23:50,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:23:50,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:23:50,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:23:50,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:23:50,595 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:23:50,626 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 02:23:50,626 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 02:23:50,629 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) [2019-09-10 02:23:50,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:23:50,653 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 02:23:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:23:50,676 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2019-09-10 02:23:50,681 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [53], [56], [58], [61], [63], [64], [65], [66], [68], [69], [70], [71], [72] [2019-09-10 02:23:50,718 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:23:50,719 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:23:50,837 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:23:50,839 INFO L272 AbstractInterpreter]: Visited 16 different actions 26 times. Never merged. Never widened. Performed 31 root evaluator evaluations with a maximum evaluation depth of 6. Performed 31 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Never found a fixpoint. Largest state had 8 variables. [2019-09-10 02:23:50,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:23:50,845 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:23:50,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:23:50,845 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-09-10 02:23:50,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:23:50,862 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-09-10 02:23:50,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:23:50,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-10 02:23:50,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:23:50,954 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:23:50,954 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:23:51,011 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:23:51,014 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:23:51,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-09-10 02:23:51,015 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:23:51,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:23:51,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:23:51,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:23:51,016 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand 5 states. [2019-09-10 02:23:51,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:23:51,100 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2019-09-10 02:23:51,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:23:51,100 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-09-10 02:23:51,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:23:51,102 INFO L225 Difference]: With dead ends: 46 [2019-09-10 02:23:51,102 INFO L226 Difference]: Without dead ends: 45 [2019-09-10 02:23:51,103 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:23:51,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-10 02:23:51,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-09-10 02:23:51,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-10 02:23:51,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2019-09-10 02:23:51,111 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 20 [2019-09-10 02:23:51,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:23:51,112 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2019-09-10 02:23:51,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:23:51,112 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2019-09-10 02:23:51,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-10 02:23:51,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:23:51,114 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:23:51,114 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:23:51,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:23:51,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1231057051, now seen corresponding path program 1 times [2019-09-10 02:23:51,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:23:51,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:23:51,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:23:51,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:23:51,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:23:51,125 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 02:23:51,125 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 02:23:51,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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 02:23:51,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:23:51,152 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 02:23:51,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:23:51,165 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2019-09-10 02:23:51,165 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [19], [32], [53], [56], [58], [61], [63], [64], [65], [66], [68], [69], [70], [71], [72], [73], [74] [2019-09-10 02:23:51,167 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:23:51,167 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:23:51,252 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:23:51,252 INFO L272 AbstractInterpreter]: Visited 20 different actions 35 times. Never merged. Never widened. Performed 39 root evaluator evaluations with a maximum evaluation depth of 7. Performed 39 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Never found a fixpoint. Largest state had 8 variables. [2019-09-10 02:23:51,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:23:51,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:23:51,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:23:51,253 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:23:51,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:23:51,274 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:23:51,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:23:51,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-10 02:23:51,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:23:51,324 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 02:23:51,324 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:23:51,377 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 02:23:51,381 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:23:51,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-09-10 02:23:51,382 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:23:51,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:23:51,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:23:51,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:23:51,383 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand 5 states. [2019-09-10 02:23:51,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:23:51,458 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2019-09-10 02:23:51,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:23:51,458 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-09-10 02:23:51,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:23:51,460 INFO L225 Difference]: With dead ends: 56 [2019-09-10 02:23:51,460 INFO L226 Difference]: Without dead ends: 51 [2019-09-10 02:23:51,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:23:51,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-10 02:23:51,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-09-10 02:23:51,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-10 02:23:51,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2019-09-10 02:23:51,468 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 27 [2019-09-10 02:23:51,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:23:51,468 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2019-09-10 02:23:51,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:23:51,469 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2019-09-10 02:23:51,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-10 02:23:51,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:23:51,470 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:23:51,470 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:23:51,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:23:51,471 INFO L82 PathProgramCache]: Analyzing trace with hash -2079143466, now seen corresponding path program 1 times [2019-09-10 02:23:51,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:23:51,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:23:51,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:23:51,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:23:51,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:23:51,480 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 02:23:51,480 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 02:23:51,480 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-10 02:23:51,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:23:51,504 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 02:23:51,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:23:51,517 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2019-09-10 02:23:51,518 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [21], [53], [56], [58], [61], [63], [64], [65], [66], [68], [69], [70], [71], [72], [73] [2019-09-10 02:23:51,519 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:23:51,519 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:23:51,698 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:23:51,700 INFO L272 AbstractInterpreter]: Visited 18 different actions 166 times. Merged at 5 different actions 30 times. Widened at 1 different actions 2 times. Performed 205 root evaluator evaluations with a maximum evaluation depth of 7. Performed 205 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2019-09-10 02:23:51,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:23:51,700 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:23:51,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:23:51,701 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:23:51,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:23:51,716 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:23:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:23:51,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-10 02:23:51,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:23:51,815 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:23:51,815 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:23:51,885 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-10 02:23:51,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 02:23:51,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-10 02:23:51,889 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:23:51,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:23:51,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:23:51,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:23:51,890 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand 5 states. [2019-09-10 02:23:51,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:23:51,973 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2019-09-10 02:23:51,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:23:51,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-09-10 02:23:51,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:23:51,979 INFO L225 Difference]: With dead ends: 60 [2019-09-10 02:23:51,979 INFO L226 Difference]: Without dead ends: 60 [2019-09-10 02:23:51,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:23:51,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-10 02:23:51,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2019-09-10 02:23:51,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-10 02:23:51,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2019-09-10 02:23:51,995 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 37 [2019-09-10 02:23:51,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:23:51,996 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2019-09-10 02:23:51,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:23:51,996 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2019-09-10 02:23:52,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 02:23:52,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:23:52,000 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:23:52,001 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:23:52,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:23:52,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1940610566, now seen corresponding path program 1 times [2019-09-10 02:23:52,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:23:52,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:23:52,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:23:52,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:23:52,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:23:52,022 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 02:23:52,022 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 02:23:52,022 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-10 02:23:52,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:23:52,045 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 02:23:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:23:52,064 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2019-09-10 02:23:52,065 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [19], [21], [32], [39], [42], [53], [56], [58], [61], [63], [64], [65], [66], [68], [69], [70], [71], [72], [73], [74], [75], [76], [77] [2019-09-10 02:23:52,071 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:23:52,071 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:23:52,265 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:23:52,265 INFO L272 AbstractInterpreter]: Visited 22 different actions 229 times. Merged at 7 different actions 42 times. Widened at 1 different actions 2 times. Performed 289 root evaluator evaluations with a maximum evaluation depth of 7. Performed 289 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2019-09-10 02:23:52,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:23:52,265 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:23:52,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:23:52,266 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:23:52,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:23:52,285 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:23:52,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:23:52,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-10 02:23:52,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:23:52,405 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-10 02:23:52,405 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:23:52,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:23:52,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:23:52,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:23:52,655 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-10 02:23:52,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-10 02:23:52,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-09-10 02:23:52,670 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:23:52,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:23:52,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:23:52,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:23:52,672 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand 12 states. [2019-09-10 02:23:53,023 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-10 02:23:53,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:23:53,472 INFO L93 Difference]: Finished difference Result 124 states and 168 transitions. [2019-09-10 02:23:53,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 02:23:53,473 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-09-10 02:23:53,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:23:53,476 INFO L225 Difference]: With dead ends: 124 [2019-09-10 02:23:53,476 INFO L226 Difference]: Without dead ends: 118 [2019-09-10 02:23:53,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:23:53,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-10 02:23:53,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 96. [2019-09-10 02:23:53,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-10 02:23:53,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 121 transitions. [2019-09-10 02:23:53,490 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 121 transitions. Word has length 57 [2019-09-10 02:23:53,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:23:53,491 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 121 transitions. [2019-09-10 02:23:53,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:23:53,491 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 121 transitions. [2019-09-10 02:23:53,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 02:23:53,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:23:53,493 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:23:53,494 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:23:53,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:23:53,494 INFO L82 PathProgramCache]: Analyzing trace with hash 2101027601, now seen corresponding path program 1 times [2019-09-10 02:23:53,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:23:53,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:23:53,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:23:53,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:23:53,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:23:53,502 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 02:23:53,502 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 02:23:53,502 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-10 02:23:53,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:23:53,530 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 02:23:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:23:53,552 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 69 with the following transitions: [2019-09-10 02:23:53,554 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [19], [21], [32], [37], [39], [42], [53], [56], [58], [61], [63], [64], [65], [66], [68], [69], [70], [71], [72], [73], [74], [75], [76], [77], [78] [2019-09-10 02:23:53,559 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:23:53,559 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:23:53,703 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:23:53,703 INFO L272 AbstractInterpreter]: Visited 22 different actions 229 times. Merged at 7 different actions 42 times. Widened at 1 different actions 2 times. Performed 276 root evaluator evaluations with a maximum evaluation depth of 7. Performed 276 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2019-09-10 02:23:53,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:23:53,704 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:23:53,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:23:53,705 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:23:53,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:23:53,720 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:23:53,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:23:53,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 02:23:53,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:23:53,810 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2019-09-10 02:23:53,810 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:23:53,935 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2019-09-10 02:23:53,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-10 02:23:53,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-10 02:23:53,939 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:23:53,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:23:53,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:23:53,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:23:53,940 INFO L87 Difference]: Start difference. First operand 96 states and 121 transitions. Second operand 11 states. [2019-09-10 02:23:54,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:23:54,088 INFO L93 Difference]: Finished difference Result 108 states and 137 transitions. [2019-09-10 02:23:54,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:23:54,089 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2019-09-10 02:23:54,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:23:54,091 INFO L225 Difference]: With dead ends: 108 [2019-09-10 02:23:54,091 INFO L226 Difference]: Without dead ends: 108 [2019-09-10 02:23:54,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:23:54,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-09-10 02:23:54,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 101. [2019-09-10 02:23:54,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-10 02:23:54,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 130 transitions. [2019-09-10 02:23:54,103 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 130 transitions. Word has length 68 [2019-09-10 02:23:54,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:23:54,104 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 130 transitions. [2019-09-10 02:23:54,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:23:54,104 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 130 transitions. [2019-09-10 02:23:54,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 02:23:54,106 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:23:54,106 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:23:54,106 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:23:54,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:23:54,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1178392653, now seen corresponding path program 2 times [2019-09-10 02:23:54,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:23:54,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:23:54,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:23:54,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:23:54,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:23:54,114 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 02:23:54,114 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 02:23:54,114 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 02:23:54,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:23:54,129 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 02:23:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:23:54,145 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:23:54,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:23:54,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:23:54,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:23:54,156 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:23:54,156 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:23:54,263 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-10 02:23:54,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:23:54,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-10 02:23:54,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:23:54,287 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-10 02:23:54,287 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:23:54,344 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-10 02:23:54,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-10 02:23:54,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-10 02:23:54,348 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:23:54,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:23:54,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:23:54,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:23:54,349 INFO L87 Difference]: Start difference. First operand 101 states and 130 transitions. Second operand 5 states. [2019-09-10 02:23:54,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:23:54,396 INFO L93 Difference]: Finished difference Result 105 states and 136 transitions. [2019-09-10 02:23:54,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:23:54,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-09-10 02:23:54,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:23:54,398 INFO L225 Difference]: With dead ends: 105 [2019-09-10 02:23:54,398 INFO L226 Difference]: Without dead ends: 105 [2019-09-10 02:23:54,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:23:54,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-09-10 02:23:54,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-09-10 02:23:54,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-09-10 02:23:54,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 136 transitions. [2019-09-10 02:23:54,430 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 136 transitions. Word has length 70 [2019-09-10 02:23:54,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:23:54,431 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 136 transitions. [2019-09-10 02:23:54,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:23:54,432 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 136 transitions. [2019-09-10 02:23:54,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 02:23:54,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:23:54,436 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:23:54,436 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:23:54,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:23:54,436 INFO L82 PathProgramCache]: Analyzing trace with hash 2076897125, now seen corresponding path program 1 times [2019-09-10 02:23:54,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:23:54,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:23:54,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:23:54,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:23:54,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:23:54,456 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 02:23:54,456 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 02:23:54,457 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-10 02:23:54,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:23:54,482 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 02:23:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Exception during sending of exit command (exit): Stream closed [2019-09-10 02:23:54,507 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 74 with the following transitions: [2019-09-10 02:23:54,508 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [19], [21], [32], [37], [39], [42], [53], [56], [58], [61], [63], [64], [65], [66], [68], [69], [70], [71], [72], [73], [74], [75], [76], [77], [78], [79], [80] [2019-09-10 02:23:54,518 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:23:54,518 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:23:54,654 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:23:54,654 INFO L272 AbstractInterpreter]: Visited 22 different actions 229 times. Merged at 7 different actions 42 times. Widened at 1 different actions 2 times. Performed 263 root evaluator evaluations with a maximum evaluation depth of 7. Performed 263 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2019-09-10 02:23:54,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:23:54,655 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:23:54,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:23:54,655 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:23:54,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:23:54,687 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:23:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:23:54,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 02:23:54,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:23:54,794 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 49 proven. 4 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2019-09-10 02:23:54,794 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:23:54,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:23:54,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:23:54,884 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 49 proven. 4 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2019-09-10 02:23:54,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-10 02:23:54,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2019-09-10 02:23:54,888 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:23:54,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 02:23:54,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 02:23:54,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:23:54,890 INFO L87 Difference]: Start difference. First operand 105 states and 136 transitions. Second operand 13 states. [2019-09-10 02:23:55,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:23:55,063 INFO L93 Difference]: Finished difference Result 109 states and 139 transitions. [2019-09-10 02:23:55,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:23:55,064 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 73 [2019-09-10 02:23:55,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:23:55,065 INFO L225 Difference]: With dead ends: 109 [2019-09-10 02:23:55,065 INFO L226 Difference]: Without dead ends: 90 [2019-09-10 02:23:55,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:23:55,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-10 02:23:55,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-09-10 02:23:55,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-10 02:23:55,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 111 transitions. [2019-09-10 02:23:55,075 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 111 transitions. Word has length 73 [2019-09-10 02:23:55,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:23:55,075 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 111 transitions. [2019-09-10 02:23:55,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 02:23:55,075 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2019-09-10 02:23:55,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 02:23:55,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:23:55,077 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:23:55,077 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:23:55,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:23:55,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1224411909, now seen corresponding path program 3 times [2019-09-10 02:23:55,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:23:55,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:23:55,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:23:55,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:23:55,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:23:55,085 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 02:23:55,085 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 02:23:55,085 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 02:23:55,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:23:55,103 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 02:23:55,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:23:55,126 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:23:55,126 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:23:55,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:23:55,126 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:23:55,146 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:23:55,146 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:23:55,178 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:23:55,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:23:55,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-10 02:23:55,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:23:55,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:23:55,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:23:55,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:23:55,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:23:55,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:23:55,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:23:55,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:23:55,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:06,608 WARN L188 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 38 [2019-09-10 02:24:11,491 WARN L188 SmtUtils]: Spent 4.73 s on a formula simplification. DAG size of input: 68 DAG size of output: 43 [2019-09-10 02:24:24,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:24,731 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 38 proven. 102 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-09-10 02:24:24,732 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:24:28,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:28,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:28,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:33,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:33,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:33,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:33,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:33,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:33,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:33,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:33,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:33,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:33,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:33,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:33,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:33,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:33,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:33,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:33,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:33,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:33,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:33,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:33,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:33,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:33,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:33,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:33,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:33,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:33,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:33,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:33,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:33,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:33,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:33,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:33,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:33,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:33,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:33,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:42,790 WARN L188 SmtUtils]: Spent 2.43 s on a formula simplification. DAG size of input: 143 DAG size of output: 133 [2019-09-10 02:24:48,827 WARN L188 SmtUtils]: Spent 800.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-09-10 02:24:49,810 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 39 [2019-09-10 02:24:49,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:56,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:25:06,598 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| 0))) (.cse15 (not (= |c___VERIFIER_assert_#in~cond| 1)))) (and (or .cse0 (forall ((v_main_~q~0_BEFORE_CALL_69 Int) (v_main_~p~0_BEFORE_CALL_78 Int) (v_main_~B~0_BEFORE_CALL_76 Int) (v_main_~d~0_BEFORE_CALL_62 Int) (v_main_~A~0_BEFORE_CALL_68 Int) (v_main_~r~0_BEFORE_CALL_68 Int)) (let ((.cse1 (* 4 v_main_~d~0_BEFORE_CALL_62))) (or (<= .cse1 v_main_~r~0_BEFORE_CALL_68) (= v_main_~d~0_BEFORE_CALL_62 (* v_main_~B~0_BEFORE_CALL_76 v_main_~p~0_BEFORE_CALL_78)) (exists ((main_~p~0 Int) (main_~B~0 Int)) (let ((.cse5 (* main_~B~0 main_~p~0))) (let ((.cse3 (* 4 .cse5))) (and (not (= v_main_~A~0_BEFORE_CALL_68 (+ (let ((.cse2 (div .cse3 2))) (+ (* (- 1) .cse2) (* (- 1) (div .cse2 2)) v_main_~r~0_BEFORE_CALL_68)) (* (let ((.cse4 (div (* 4 main_~p~0) 2))) (+ v_main_~q~0_BEFORE_CALL_69 (div .cse4 2) .cse4)) main_~B~0)))) (not (<= .cse3 v_main_~r~0_BEFORE_CALL_68)) (not (< v_main_~r~0_BEFORE_CALL_68 (* 2 .cse5))))))) (= v_main_~A~0_BEFORE_CALL_68 (+ (* v_main_~B~0_BEFORE_CALL_76 (let ((.cse6 (div (* 4 v_main_~p~0_BEFORE_CALL_78) 2))) (+ v_main_~q~0_BEFORE_CALL_69 .cse6 (div .cse6 2)))) (let ((.cse7 (div .cse1 2))) (+ (* (- 1) .cse7) (* (- 1) (div .cse7 2)) v_main_~r~0_BEFORE_CALL_68)))) (< v_main_~r~0_BEFORE_CALL_68 (* 2 v_main_~d~0_BEFORE_CALL_62)))))) (or .cse0 (forall ((v_main_~q~0_BEFORE_CALL_69 Int) (v_main_~p~0_BEFORE_CALL_78 Int) (v_main_~B~0_BEFORE_CALL_76 Int) (v_main_~d~0_BEFORE_CALL_62 Int) (v_main_~A~0_BEFORE_CALL_68 Int) (v_main_~r~0_BEFORE_CALL_68 Int)) (let ((.cse8 (* 4 v_main_~d~0_BEFORE_CALL_62))) (or (<= .cse8 v_main_~r~0_BEFORE_CALL_68) (exists ((main_~p~0 Int) (main_~B~0 Int)) (let ((.cse12 (* main_~B~0 main_~p~0))) (let ((.cse10 (* 4 .cse12))) (and (not (= v_main_~A~0_BEFORE_CALL_68 (+ (let ((.cse9 (div .cse10 2))) (+ (* (- 1) .cse9) (* (- 1) (div .cse9 2)) v_main_~r~0_BEFORE_CALL_68)) (* (let ((.cse11 (div (* 4 main_~p~0) 2))) (+ v_main_~q~0_BEFORE_CALL_69 (div .cse11 2) .cse11)) main_~B~0)))) (not (<= .cse10 v_main_~r~0_BEFORE_CALL_68)) (not (< v_main_~r~0_BEFORE_CALL_68 (* 2 .cse12))))))) (= v_main_~A~0_BEFORE_CALL_68 (+ (* v_main_~B~0_BEFORE_CALL_76 (let ((.cse13 (div (* 4 v_main_~p~0_BEFORE_CALL_78) 2))) (+ v_main_~q~0_BEFORE_CALL_69 .cse13 (div .cse13 2)))) (let ((.cse14 (div .cse8 2))) (+ (* (- 1) .cse14) (* (- 1) (div .cse14 2)) v_main_~r~0_BEFORE_CALL_68)))) (< v_main_~r~0_BEFORE_CALL_68 (* 2 v_main_~d~0_BEFORE_CALL_62))))) .cse15) (or (forall ((v_main_~q~0_BEFORE_CALL_69 Int) (v_main_~p~0_BEFORE_CALL_78 Int) (v_main_~B~0_BEFORE_CALL_76 Int) (v_main_~A~0_BEFORE_CALL_68 Int) (v_main_~r~0_BEFORE_CALL_68 Int)) (let ((.cse23 (* v_main_~B~0_BEFORE_CALL_76 v_main_~p~0_BEFORE_CALL_78))) (let ((.cse18 (* 4 .cse23))) (or (= v_main_~A~0_BEFORE_CALL_68 (+ (* v_main_~B~0_BEFORE_CALL_76 (let ((.cse16 (div (* 4 v_main_~p~0_BEFORE_CALL_78) 2))) (+ v_main_~q~0_BEFORE_CALL_69 .cse16 (div .cse16 2)))) (let ((.cse17 (div .cse18 2))) (+ (* (- 1) (div .cse17 2)) (* (- 1) .cse17) v_main_~r~0_BEFORE_CALL_68)))) (exists ((main_~p~0 Int) (main_~B~0 Int)) (let ((.cse22 (* main_~B~0 main_~p~0))) (let ((.cse20 (* 4 .cse22))) (and (not (= v_main_~A~0_BEFORE_CALL_68 (+ (let ((.cse19 (div .cse20 2))) (+ (* (- 1) .cse19) (* (- 1) (div .cse19 2)) v_main_~r~0_BEFORE_CALL_68)) (* (let ((.cse21 (div (* 4 main_~p~0) 2))) (+ v_main_~q~0_BEFORE_CALL_69 (div .cse21 2) .cse21)) main_~B~0)))) (not (<= .cse20 v_main_~r~0_BEFORE_CALL_68)) (not (< v_main_~r~0_BEFORE_CALL_68 (* 2 .cse22))))))) (<= .cse18 v_main_~r~0_BEFORE_CALL_68) (< v_main_~r~0_BEFORE_CALL_68 (* 2 .cse23)))))) .cse15))) is different from true [2019-09-10 02:25:12,645 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 90 [2019-09-10 02:25:16,147 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| 0)))) (and (or .cse0 (forall ((v_main_~q~0_BEFORE_CALL_69 Int) (v_main_~p~0_BEFORE_CALL_78 Int) (v_main_~B~0_BEFORE_CALL_76 Int) (v_main_~d~0_BEFORE_CALL_62 Int) (v_main_~A~0_BEFORE_CALL_68 Int) (v_main_~r~0_BEFORE_CALL_68 Int)) (let ((.cse1 (* 4 v_main_~d~0_BEFORE_CALL_62))) (or (<= .cse1 v_main_~r~0_BEFORE_CALL_68) (= v_main_~d~0_BEFORE_CALL_62 (* v_main_~B~0_BEFORE_CALL_76 v_main_~p~0_BEFORE_CALL_78)) (exists ((main_~p~0 Int) (main_~B~0 Int)) (let ((.cse5 (* main_~B~0 main_~p~0))) (let ((.cse3 (* 4 .cse5))) (and (not (= v_main_~A~0_BEFORE_CALL_68 (+ (let ((.cse2 (div .cse3 2))) (+ (* (- 1) .cse2) (* (- 1) (div .cse2 2)) v_main_~r~0_BEFORE_CALL_68)) (* (let ((.cse4 (div (* 4 main_~p~0) 2))) (+ v_main_~q~0_BEFORE_CALL_69 (div .cse4 2) .cse4)) main_~B~0)))) (not (<= .cse3 v_main_~r~0_BEFORE_CALL_68)) (not (< v_main_~r~0_BEFORE_CALL_68 (* 2 .cse5))))))) (= v_main_~A~0_BEFORE_CALL_68 (+ (* v_main_~B~0_BEFORE_CALL_76 (let ((.cse6 (div (* 4 v_main_~p~0_BEFORE_CALL_78) 2))) (+ v_main_~q~0_BEFORE_CALL_69 .cse6 (div .cse6 2)))) (let ((.cse7 (div .cse1 2))) (+ (* (- 1) .cse7) (* (- 1) (div .cse7 2)) v_main_~r~0_BEFORE_CALL_68)))) (< v_main_~r~0_BEFORE_CALL_68 (* 2 v_main_~d~0_BEFORE_CALL_62)))))) (or .cse0 (forall ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (let ((.cse10 (* 4 v_prenex_4))) (or (< v_prenex_6 (* 2 v_prenex_4)) (= (+ (* (let ((.cse8 (div (* 4 v_prenex_2) 2))) (+ .cse8 v_prenex_1 (div .cse8 2))) v_prenex_3) (let ((.cse9 (div .cse10 2))) (+ v_prenex_6 (* (- 1) (div .cse9 2)) (* (- 1) .cse9)))) v_prenex_5) (exists ((v_prenex_7 Int) (v_prenex_8 Int)) (let ((.cse14 (* v_prenex_8 v_prenex_7))) (let ((.cse11 (* 4 .cse14))) (and (not (<= .cse11 v_prenex_6)) (not (= v_prenex_5 (+ (* (let ((.cse12 (div (* 4 v_prenex_7) 2))) (+ .cse12 v_prenex_1 (div .cse12 2))) v_prenex_8) (let ((.cse13 (div .cse11 2))) (+ (* (- 1) (div .cse13 2)) v_prenex_6 (* (- 1) .cse13)))))) (not (< v_prenex_6 (* 2 .cse14))))))) (<= .cse10 v_prenex_6)))) (not (= |c___VERIFIER_assert_#in~cond| 1))))) is different from true [2019-09-10 02:25:18,521 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2019-09-10 02:25:22,941 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| 0))) (.cse8 (= 0 c___VERIFIER_assert_~cond))) (and (or .cse0 (forall ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (let ((.cse3 (* 4 v_prenex_4))) (or (< v_prenex_6 (* 2 v_prenex_4)) (= (+ (* (let ((.cse1 (div (* 4 v_prenex_2) 2))) (+ .cse1 v_prenex_1 (div .cse1 2))) v_prenex_3) (let ((.cse2 (div .cse3 2))) (+ v_prenex_6 (* (- 1) (div .cse2 2)) (* (- 1) .cse2)))) v_prenex_5) (exists ((v_prenex_7 Int) (v_prenex_8 Int)) (let ((.cse7 (* v_prenex_8 v_prenex_7))) (let ((.cse4 (* 4 .cse7))) (and (not (<= .cse4 v_prenex_6)) (not (= v_prenex_5 (+ (* (let ((.cse5 (div (* 4 v_prenex_7) 2))) (+ .cse5 v_prenex_1 (div .cse5 2))) v_prenex_8) (let ((.cse6 (div .cse4 2))) (+ (* (- 1) (div .cse6 2)) v_prenex_6 (* (- 1) .cse6)))))) (not (< v_prenex_6 (* 2 .cse7))))))) (<= .cse3 v_prenex_6)))) (not (= |c___VERIFIER_assert_#in~cond| 1)) .cse8) (or .cse0 (forall ((v_main_~q~0_BEFORE_CALL_69 Int) (v_main_~p~0_BEFORE_CALL_78 Int) (v_main_~B~0_BEFORE_CALL_76 Int) (v_main_~d~0_BEFORE_CALL_62 Int) (v_main_~A~0_BEFORE_CALL_68 Int) (v_main_~r~0_BEFORE_CALL_68 Int)) (let ((.cse9 (* 4 v_main_~d~0_BEFORE_CALL_62))) (or (<= .cse9 v_main_~r~0_BEFORE_CALL_68) (= v_main_~d~0_BEFORE_CALL_62 (* v_main_~B~0_BEFORE_CALL_76 v_main_~p~0_BEFORE_CALL_78)) (exists ((main_~p~0 Int) (main_~B~0 Int)) (let ((.cse13 (* main_~B~0 main_~p~0))) (let ((.cse11 (* 4 .cse13))) (and (not (= v_main_~A~0_BEFORE_CALL_68 (+ (let ((.cse10 (div .cse11 2))) (+ (* (- 1) .cse10) (* (- 1) (div .cse10 2)) v_main_~r~0_BEFORE_CALL_68)) (* (let ((.cse12 (div (* 4 main_~p~0) 2))) (+ v_main_~q~0_BEFORE_CALL_69 (div .cse12 2) .cse12)) main_~B~0)))) (not (<= .cse11 v_main_~r~0_BEFORE_CALL_68)) (not (< v_main_~r~0_BEFORE_CALL_68 (* 2 .cse13))))))) (= v_main_~A~0_BEFORE_CALL_68 (+ (* v_main_~B~0_BEFORE_CALL_76 (let ((.cse14 (div (* 4 v_main_~p~0_BEFORE_CALL_78) 2))) (+ v_main_~q~0_BEFORE_CALL_69 .cse14 (div .cse14 2)))) (let ((.cse15 (div .cse9 2))) (+ (* (- 1) .cse15) (* (- 1) (div .cse15 2)) v_main_~r~0_BEFORE_CALL_68)))) (< v_main_~r~0_BEFORE_CALL_68 (* 2 v_main_~d~0_BEFORE_CALL_62))))) .cse8))) is different from true [2019-09-10 02:25:22,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:25:22,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:25:23,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:25:23,109 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 27 proven. 82 refuted. 30 times theorem prover too weak. 216 trivial. 7 not checked. [2019-09-10 02:25:23,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-10 02:25:23,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 30 [2019-09-10 02:25:23,113 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:25:23,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-10 02:25:23,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-10 02:25:23,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=560, Unknown=28, NotChecked=156, Total=870 [2019-09-10 02:25:23,114 INFO L87 Difference]: Start difference. First operand 90 states and 111 transitions. Second operand 30 states. [2019-09-10 02:25:25,325 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (= |c___VERIFIER_assert_#in~cond| 1))) (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| 0))) (.cse16 (not .cse8))) (and (or .cse0 (forall ((v_main_~q~0_BEFORE_CALL_69 Int) (v_main_~p~0_BEFORE_CALL_78 Int) (v_main_~B~0_BEFORE_CALL_76 Int) (v_main_~d~0_BEFORE_CALL_62 Int) (v_main_~A~0_BEFORE_CALL_68 Int) (v_main_~r~0_BEFORE_CALL_68 Int)) (let ((.cse1 (* 4 v_main_~d~0_BEFORE_CALL_62))) (or (<= .cse1 v_main_~r~0_BEFORE_CALL_68) (= v_main_~d~0_BEFORE_CALL_62 (* v_main_~B~0_BEFORE_CALL_76 v_main_~p~0_BEFORE_CALL_78)) (exists ((main_~p~0 Int) (main_~B~0 Int)) (let ((.cse5 (* main_~B~0 main_~p~0))) (let ((.cse3 (* 4 .cse5))) (and (not (= v_main_~A~0_BEFORE_CALL_68 (+ (let ((.cse2 (div .cse3 2))) (+ (* (- 1) .cse2) (* (- 1) (div .cse2 2)) v_main_~r~0_BEFORE_CALL_68)) (* (let ((.cse4 (div (* 4 main_~p~0) 2))) (+ v_main_~q~0_BEFORE_CALL_69 (div .cse4 2) .cse4)) main_~B~0)))) (not (<= .cse3 v_main_~r~0_BEFORE_CALL_68)) (not (< v_main_~r~0_BEFORE_CALL_68 (* 2 .cse5))))))) (= v_main_~A~0_BEFORE_CALL_68 (+ (* v_main_~B~0_BEFORE_CALL_76 (let ((.cse6 (div (* 4 v_main_~p~0_BEFORE_CALL_78) 2))) (+ v_main_~q~0_BEFORE_CALL_69 .cse6 (div .cse6 2)))) (let ((.cse7 (div .cse1 2))) (+ (* (- 1) .cse7) (* (- 1) (div .cse7 2)) v_main_~r~0_BEFORE_CALL_68)))) (< v_main_~r~0_BEFORE_CALL_68 (* 2 v_main_~d~0_BEFORE_CALL_62)))))) .cse8 (or .cse0 (forall ((v_main_~q~0_BEFORE_CALL_69 Int) (v_main_~p~0_BEFORE_CALL_78 Int) (v_main_~B~0_BEFORE_CALL_76 Int) (v_main_~d~0_BEFORE_CALL_62 Int) (v_main_~A~0_BEFORE_CALL_68 Int) (v_main_~r~0_BEFORE_CALL_68 Int)) (let ((.cse9 (* 4 v_main_~d~0_BEFORE_CALL_62))) (or (<= .cse9 v_main_~r~0_BEFORE_CALL_68) (exists ((main_~p~0 Int) (main_~B~0 Int)) (let ((.cse13 (* main_~B~0 main_~p~0))) (let ((.cse11 (* 4 .cse13))) (and (not (= v_main_~A~0_BEFORE_CALL_68 (+ (let ((.cse10 (div .cse11 2))) (+ (* (- 1) .cse10) (* (- 1) (div .cse10 2)) v_main_~r~0_BEFORE_CALL_68)) (* (let ((.cse12 (div (* 4 main_~p~0) 2))) (+ v_main_~q~0_BEFORE_CALL_69 (div .cse12 2) .cse12)) main_~B~0)))) (not (<= .cse11 v_main_~r~0_BEFORE_CALL_68)) (not (< v_main_~r~0_BEFORE_CALL_68 (* 2 .cse13))))))) (= v_main_~A~0_BEFORE_CALL_68 (+ (* v_main_~B~0_BEFORE_CALL_76 (let ((.cse14 (div (* 4 v_main_~p~0_BEFORE_CALL_78) 2))) (+ v_main_~q~0_BEFORE_CALL_69 .cse14 (div .cse14 2)))) (let ((.cse15 (div .cse9 2))) (+ (* (- 1) .cse15) (* (- 1) (div .cse15 2)) v_main_~r~0_BEFORE_CALL_68)))) (< v_main_~r~0_BEFORE_CALL_68 (* 2 v_main_~d~0_BEFORE_CALL_62))))) .cse16) (or (forall ((v_main_~q~0_BEFORE_CALL_69 Int) (v_main_~p~0_BEFORE_CALL_78 Int) (v_main_~B~0_BEFORE_CALL_76 Int) (v_main_~A~0_BEFORE_CALL_68 Int) (v_main_~r~0_BEFORE_CALL_68 Int)) (let ((.cse24 (* v_main_~B~0_BEFORE_CALL_76 v_main_~p~0_BEFORE_CALL_78))) (let ((.cse19 (* 4 .cse24))) (or (= v_main_~A~0_BEFORE_CALL_68 (+ (* v_main_~B~0_BEFORE_CALL_76 (let ((.cse17 (div (* 4 v_main_~p~0_BEFORE_CALL_78) 2))) (+ v_main_~q~0_BEFORE_CALL_69 .cse17 (div .cse17 2)))) (let ((.cse18 (div .cse19 2))) (+ (* (- 1) (div .cse18 2)) (* (- 1) .cse18) v_main_~r~0_BEFORE_CALL_68)))) (exists ((main_~p~0 Int) (main_~B~0 Int)) (let ((.cse23 (* main_~B~0 main_~p~0))) (let ((.cse21 (* 4 .cse23))) (and (not (= v_main_~A~0_BEFORE_CALL_68 (+ (let ((.cse20 (div .cse21 2))) (+ (* (- 1) .cse20) (* (- 1) (div .cse20 2)) v_main_~r~0_BEFORE_CALL_68)) (* (let ((.cse22 (div (* 4 main_~p~0) 2))) (+ v_main_~q~0_BEFORE_CALL_69 (div .cse22 2) .cse22)) main_~B~0)))) (not (<= .cse21 v_main_~r~0_BEFORE_CALL_68)) (not (< v_main_~r~0_BEFORE_CALL_68 (* 2 .cse23))))))) (<= .cse19 v_main_~r~0_BEFORE_CALL_68) (< v_main_~r~0_BEFORE_CALL_68 (* 2 .cse24)))))) .cse16) (= 1 c___VERIFIER_assert_~cond) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond)))) is different from false [2019-09-10 02:26:39,232 WARN L188 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-10 02:27:05,918 WARN L188 SmtUtils]: Spent 4.42 s on a formula simplification that was a NOOP. DAG size: 91 [2019-09-10 02:27:20,568 WARN L188 SmtUtils]: Spent 6.64 s on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-09-10 02:27:41,806 WARN L188 SmtUtils]: Spent 758.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-09-10 02:27:58,939 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2019-09-10 02:28:10,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:28:10,275 INFO L93 Difference]: Finished difference Result 114 states and 138 transitions. [2019-09-10 02:28:10,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 02:28:10,276 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 87 [2019-09-10 02:28:10,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:28:10,278 INFO L225 Difference]: With dead ends: 114 [2019-09-10 02:28:10,278 INFO L226 Difference]: Without dead ends: 114 [2019-09-10 02:28:10,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 144 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 126.9s TimeCoverageRelationStatistics Valid=208, Invalid=1021, Unknown=47, NotChecked=284, Total=1560 [2019-09-10 02:28:10,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-10 02:28:10,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 101. [2019-09-10 02:28:10,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-10 02:28:10,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 120 transitions. [2019-09-10 02:28:10,287 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 120 transitions. Word has length 87 [2019-09-10 02:28:10,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:28:10,288 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 120 transitions. [2019-09-10 02:28:10,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-10 02:28:10,288 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 120 transitions. [2019-09-10 02:28:10,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 02:28:10,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:28:10,290 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 14, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:28:10,290 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:28:10,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:28:10,290 INFO L82 PathProgramCache]: Analyzing trace with hash -16273295, now seen corresponding path program 4 times [2019-09-10 02:28:10,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:28:10,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:28:10,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:28:10,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:28:10,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:28:10,298 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 02:28:10,298 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 02:28:10,299 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) [2019-09-10 02:28:10,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:28:10,326 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 02:28:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:28:10,351 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:28:10,351 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:28:10,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:28:10,351 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:28:10,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:28:10,363 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:28:10,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:28:10,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-10 02:28:10,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:28:10,487 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 28 proven. 26 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:28:10,488 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:28:10,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:10,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:10,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:10,704 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-09-10 02:28:10,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:10,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:10,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:10,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:10,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:10,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:10,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:13,243 WARN L188 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 119 DAG size of output: 105 [2019-09-10 02:28:13,431 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 28 proven. 26 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:28:13,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-10 02:28:13,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-09-10 02:28:13,435 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:28:13,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:28:13,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:28:13,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:28:13,437 INFO L87 Difference]: Start difference. First operand 101 states and 120 transitions. Second operand 12 states. [2019-09-10 02:28:16,217 WARN L188 SmtUtils]: Spent 2.52 s on a formula simplification. DAG size of input: 124 DAG size of output: 88 [2019-09-10 02:28:17,079 WARN L188 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2019-09-10 02:28:19,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:28:19,266 INFO L93 Difference]: Finished difference Result 142 states and 178 transitions. [2019-09-10 02:28:19,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 02:28:19,268 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 92 [2019-09-10 02:28:19,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:28:19,270 INFO L225 Difference]: With dead ends: 142 [2019-09-10 02:28:19,270 INFO L226 Difference]: Without dead ends: 142 [2019-09-10 02:28:19,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 169 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:28:19,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-09-10 02:28:19,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 136. [2019-09-10 02:28:19,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-09-10 02:28:19,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 169 transitions. [2019-09-10 02:28:19,285 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 169 transitions. Word has length 92 [2019-09-10 02:28:19,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:28:19,286 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 169 transitions. [2019-09-10 02:28:19,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:28:19,289 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 169 transitions. [2019-09-10 02:28:19,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 02:28:19,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:28:19,290 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:28:19,291 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:28:19,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:28:19,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1784958798, now seen corresponding path program 2 times [2019-09-10 02:28:19,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:28:19,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:28:19,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:28:19,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:28:19,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:28:19,304 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 02:28:19,304 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 02:28:19,304 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 02:28:19,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:28:19,316 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 02:28:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:28:19,339 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:28:19,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:28:19,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:28:19,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:28:19,355 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:28:19,355 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:28:19,385 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-10 02:28:19,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:28:19,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-10 02:28:19,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:28:19,477 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 108 proven. 4 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2019-09-10 02:28:19,477 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:28:19,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:19,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:19,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:19,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:19,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:19,642 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 110 proven. 2 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2019-09-10 02:28:19,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-10 02:28:19,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2019-09-10 02:28:19,648 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:28:19,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 02:28:19,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 02:28:19,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:28:19,650 INFO L87 Difference]: Start difference. First operand 136 states and 169 transitions. Second operand 15 states. [2019-09-10 02:28:20,765 WARN L188 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 20 [2019-09-10 02:28:27,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:28:27,687 INFO L93 Difference]: Finished difference Result 150 states and 181 transitions. [2019-09-10 02:28:27,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 02:28:27,689 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 98 [2019-09-10 02:28:27,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:28:27,691 INFO L225 Difference]: With dead ends: 150 [2019-09-10 02:28:27,691 INFO L226 Difference]: Without dead ends: 133 [2019-09-10 02:28:27,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2019-09-10 02:28:27,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-10 02:28:27,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 124. [2019-09-10 02:28:27,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-09-10 02:28:27,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 140 transitions. [2019-09-10 02:28:27,710 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 140 transitions. Word has length 98 [2019-09-10 02:28:27,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:28:27,711 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 140 transitions. [2019-09-10 02:28:27,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 02:28:27,711 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 140 transitions. [2019-09-10 02:28:27,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 02:28:27,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:28:27,712 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 18, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:28:27,713 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:28:27,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:28:27,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1767580262, now seen corresponding path program 5 times [2019-09-10 02:28:27,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:28:27,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:28:27,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:28:27,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:28:27,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:28:27,719 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 02:28:27,720 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 02:28:27,720 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 02:28:27,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:28:27,730 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 02:28:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:28:27,769 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:28:27,769 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:28:27,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:28:27,770 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:28:27,780 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:28:27,781 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:28:31,193 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-10 02:28:31,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:28:31,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-10 02:28:31,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:28:31,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:31,621 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 86 proven. 52 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-09-10 02:28:31,622 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:28:31,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:31,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:31,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:31,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,203 WARN L188 SmtUtils]: Spent 7.27 s on a formula simplification that was a NOOP. DAG size: 53 [2019-09-10 02:28:39,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:28:39,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:28:39,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:28:39,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:28:39,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:28:39,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:28:39,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:28:39,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:28:39,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:28:39,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:28:39,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:28:39,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:28:39,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:28:39,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:28:39,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:28:39,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:28:39,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:28:39,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:28:39,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:28:39,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:28:39,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:28:39,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:28:39,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:28:39,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:28:39,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:39,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:28:41,516 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse36 (div c_main_~p~0 2))) (let ((.cse44 (+ .cse36 1))) (let ((.cse41 (* .cse44 c_main_~B~0)) (.cse37 (* .cse36 c_main_~B~0))) (let ((.cse51 (div .cse36 2)) (.cse53 (div .cse44 2)) (.cse50 (* (- 1) (div .cse37 2))) (.cse38 (div c_main_~d~0 2)) (.cse52 (* (- 1) (div .cse41 2)))) (let ((.cse3 (= 0 (mod c_main_~p~0 2))) (.cse17 (= 0 (mod (* c_main_~B~0 .cse36) 2))) (.cse20 (= 0 (mod (* c_main_~B~0 .cse44) 2))) (.cse22 (= 0 (mod c_main_~d~0 2))) (.cse2 (= (mod .cse44 2) 0)) (.cse43 (+ .cse52 c_main_~r~0)) (.cse45 (+ .cse38 1)) (.cse40 (+ c_main_~r~0 .cse50)) (.cse13 (= 0 (mod .cse36 2))) (.cse46 (* c_main_~B~0 (+ .cse53 c_main_~q~0))) (.cse47 (* c_main_~B~0 (+ c_main_~q~0 .cse51))) (.cse42 (* (+ .cse53 c_main_~q~0 1) c_main_~B~0)) (.cse48 (+ .cse52 c_main_~r~0 (- 1))) (.cse39 (* c_main_~B~0 (+ c_main_~q~0 .cse51 1))) (.cse49 (+ c_main_~r~0 .cse50 (- 1)))) (let ((.cse16 (= c_main_~A~0 (+ .cse39 .cse49))) (.cse21 (= (+ .cse42 .cse48) c_main_~A~0)) (.cse33 (= (+ .cse47 .cse49) c_main_~A~0)) (.cse18 (<= 0 .cse37)) (.cse19 (<= 0 .cse41)) (.cse34 (= (+ .cse46 .cse48) c_main_~A~0)) (.cse25 (< .cse44 0)) (.cse30 (< .cse36 0)) (.cse32 (not .cse13)) (.cse29 (= (+ .cse47 .cse40) c_main_~A~0)) (.cse14 (< .cse37 0)) (.cse31 (not (= .cse37 .cse45))) (.cse1 (< .cse41 0)) (.cse24 (= c_main_~A~0 (+ .cse46 .cse43))) (.cse27 (not (= .cse41 .cse45))) (.cse35 (not .cse2)) (.cse23 (<= 0 c_main_~d~0)) (.cse0 (and (not .cse22) (< c_main_~d~0 0))) (.cse26 (not .cse20)) (.cse4 (<= 0 .cse44)) (.cse5 (= .cse36 0)) (.cse6 (= c_main_~A~0 (+ .cse42 .cse43))) (.cse7 (not (= .cse38 .cse41))) (.cse8 (<= 0 c_main_~p~0)) (.cse9 (= .cse36 1)) (.cse28 (not .cse17)) (.cse10 (= c_main_~A~0 (+ .cse39 .cse40))) (.cse11 (and (< c_main_~p~0 0) (not .cse3))) (.cse12 (not (= .cse37 .cse38))) (.cse15 (<= 0 .cse36))) (and (or .cse0 (and (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) (or .cse0 (and (or .cse9 .cse16 .cse11 .cse12 .cse13 .cse17 .cse15 .cse18) (or .cse2 .cse19 .cse20 .cse21 .cse3 .cse4 .cse5 .cse7 .cse8))) (or .cse22 .cse23 (and (or .cse24 .cse25 .cse26 .cse3 .cse5 .cse27 .cse8) (or .cse9 .cse28 .cse11 .cse29 .cse30 .cse31))) (or .cse22 (and (or .cse1 .cse24 .cse25 .cse3 .cse5 .cse27 .cse8) (or .cse9 .cse11 .cse29 .cse14 .cse30 .cse31)) .cse23) (or .cse0 (and (or .cse9 .cse32 .cse11 .cse12 .cse17 .cse33 .cse18) (or .cse19 .cse20 .cse3 .cse5 .cse34 .cse7 .cse8 .cse35))) (or .cse22 (and (or .cse9 .cse32 .cse11 .cse17 .cse31 .cse33 .cse18) (or .cse19 .cse20 .cse3 .cse5 .cse34 .cse27 .cse8 .cse35)) .cse23) (or .cse22 .cse23 (and (or .cse9 .cse16 .cse11 .cse13 .cse17 .cse31 .cse15 .cse18) (or .cse2 .cse19 .cse20 .cse21 .cse3 .cse4 .cse5 .cse27 .cse8))) (or .cse0 (and (or .cse24 .cse25 .cse26 .cse3 .cse5 .cse7 .cse8) (or .cse9 .cse28 .cse11 .cse12 .cse29 .cse30))) (or .cse22 (and (or .cse24 .cse26 .cse3 .cse5 .cse27 .cse8 .cse35) (or .cse9 .cse32 .cse28 .cse11 .cse29 .cse31)) .cse23) (or .cse0 (and (or .cse9 .cse11 .cse12 .cse17 .cse30 .cse33 .cse18) (or .cse19 .cse20 .cse25 .cse3 .cse5 .cse34 .cse7 .cse8))) (or .cse0 (and (or .cse9 .cse32 .cse28 .cse11 .cse12 .cse29) (or .cse24 .cse26 .cse3 .cse5 .cse7 .cse8 .cse35))) (or .cse22 (and (or .cse9 .cse11 .cse17 .cse30 .cse31 .cse33 .cse18) (or .cse19 .cse20 .cse25 .cse3 .cse5 .cse34 .cse27 .cse8)) .cse23) (or .cse22 .cse23 (and (or .cse9 .cse28 .cse10 .cse11 .cse13 .cse31 .cse15) (or .cse2 .cse26 .cse3 .cse4 .cse5 .cse6 .cse27 .cse8))) (or .cse0 (and (or .cse1 .cse24 .cse3 .cse5 .cse7 .cse8 .cse35) (or .cse9 .cse32 .cse11 .cse12 .cse29 .cse14))) (or .cse22 (and (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse27 .cse8) (or .cse9 .cse10 .cse11 .cse13 .cse14 .cse31 .cse15)) .cse23) (or .cse0 (and (or .cse1 .cse24 .cse25 .cse3 .cse5 .cse7 .cse8) (or .cse9 .cse11 .cse12 .cse29 .cse14 .cse30))) (or .cse22 (and (or .cse9 .cse32 .cse11 .cse29 .cse14 .cse31) (or .cse1 .cse24 .cse3 .cse5 .cse27 .cse8 .cse35)) .cse23) (or .cse0 (and (or .cse2 .cse26 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse28 .cse10 .cse11 .cse12 .cse13 .cse15)))))))))) is different from true