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/loop-acceleration/diamond_2-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 12:46:26,103 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 12:46:26,105 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 12:46:26,116 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 12:46:26,117 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 12:46:26,118 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 12:46:26,119 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 12:46:26,121 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 12:46:26,122 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 12:46:26,123 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 12:46:26,124 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 12:46:26,125 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 12:46:26,126 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 12:46:26,127 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 12:46:26,128 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 12:46:26,129 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 12:46:26,130 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 12:46:26,131 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 12:46:26,132 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 12:46:26,134 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 12:46:26,136 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 12:46:26,137 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 12:46:26,138 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 12:46:26,139 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 12:46:26,141 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 12:46:26,141 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 12:46:26,141 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 12:46:26,142 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 12:46:26,142 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 12:46:26,143 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 12:46:26,144 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 12:46:26,144 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 12:46:26,145 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 12:46:26,146 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 12:46:26,147 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 12:46:26,147 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 12:46:26,148 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 12:46:26,148 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 12:46:26,148 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 12:46:26,149 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 12:46:26,150 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 12:46:26,151 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-05 12:46:26,165 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 12:46:26,165 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 12:46:26,165 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-05 12:46:26,166 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-05 12:46:26,166 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-05 12:46:26,166 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-05 12:46:26,167 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-05 12:46:26,167 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-05 12:46:26,167 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-05 12:46:26,167 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-05 12:46:26,168 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 12:46:26,168 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 12:46:26,168 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 12:46:26,168 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 12:46:26,169 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 12:46:26,169 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 12:46:26,169 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 12:46:26,169 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 12:46:26,169 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 12:46:26,170 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 12:46:26,170 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 12:46:26,170 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-05 12:46:26,170 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 12:46:26,170 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 12:46:26,171 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 12:46:26,171 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 12:46:26,171 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-05 12:46:26,171 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 12:46:26,171 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 12:46:26,171 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-05 12:46:26,199 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 12:46:26,211 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 12:46:26,214 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 12:46:26,216 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 12:46:26,216 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 12:46:26,217 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_2-2.c [2019-09-05 12:46:26,276 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a43debe1a/818bdc92ffce4c9c92d38e42cbd5b385/FLAGd6d7dbce8 [2019-09-05 12:46:26,709 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 12:46:26,709 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_2-2.c [2019-09-05 12:46:26,716 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a43debe1a/818bdc92ffce4c9c92d38e42cbd5b385/FLAGd6d7dbce8 [2019-09-05 12:46:27,096 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a43debe1a/818bdc92ffce4c9c92d38e42cbd5b385 [2019-09-05 12:46:27,106 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 12:46:27,108 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 12:46:27,109 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 12:46:27,109 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 12:46:27,112 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 12:46:27,113 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 12:46:27" (1/1) ... [2019-09-05 12:46:27,116 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2914a9e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:27, skipping insertion in model container [2019-09-05 12:46:27,116 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 12:46:27" (1/1) ... [2019-09-05 12:46:27,123 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 12:46:27,142 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 12:46:27,346 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 12:46:27,350 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 12:46:27,371 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 12:46:27,383 INFO L192 MainTranslator]: Completed translation [2019-09-05 12:46:27,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:27 WrapperNode [2019-09-05 12:46:27,383 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 12:46:27,384 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 12:46:27,384 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 12:46:27,384 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 12:46:27,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:27" (1/1) ... [2019-09-05 12:46:27,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:27" (1/1) ... [2019-09-05 12:46:27,503 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:27" (1/1) ... [2019-09-05 12:46:27,504 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:27" (1/1) ... [2019-09-05 12:46:27,514 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:27" (1/1) ... [2019-09-05 12:46:27,522 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:27" (1/1) ... [2019-09-05 12:46:27,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:27" (1/1) ... [2019-09-05 12:46:27,525 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 12:46:27,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 12:46:27,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 12:46:27,526 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 12:46:27,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 12:46:27,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 12:46:27,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 12:46:27,584 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 12:46:27,584 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 12:46:27,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 12:46:27,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-05 12:46:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 12:46:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 12:46:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 12:46:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 12:46:27,820 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 12:46:27,821 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-05 12:46:27,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 12:46:27 BoogieIcfgContainer [2019-09-05 12:46:27,822 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 12:46:27,823 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 12:46:27,823 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 12:46:27,826 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 12:46:27,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 12:46:27" (1/3) ... [2019-09-05 12:46:27,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fa27aa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 12:46:27, skipping insertion in model container [2019-09-05 12:46:27,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:27" (2/3) ... [2019-09-05 12:46:27,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fa27aa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 12:46:27, skipping insertion in model container [2019-09-05 12:46:27,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 12:46:27" (3/3) ... [2019-09-05 12:46:27,830 INFO L109 eAbstractionObserver]: Analyzing ICFG diamond_2-2.c [2019-09-05 12:46:27,839 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 12:46:27,847 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 12:46:27,865 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 12:46:27,914 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 12:46:27,914 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-05 12:46:27,915 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 12:46:27,915 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 12:46:27,915 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 12:46:27,916 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 12:46:27,916 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 12:46:27,916 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 12:46:27,949 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-09-05 12:46:27,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 12:46:27,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:27,962 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:27,966 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:27,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:27,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1906239810, now seen corresponding path program 1 times [2019-09-05 12:46:27,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:28,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:28,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:28,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:28,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:28,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:28,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:28,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:28,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-05 12:46:28,092 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:28,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-05 12:46:28,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-05 12:46:28,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 12:46:28,113 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-09-05 12:46:28,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:28,130 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2019-09-05 12:46:28,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-05 12:46:28,132 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-05 12:46:28,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:28,142 INFO L225 Difference]: With dead ends: 27 [2019-09-05 12:46:28,142 INFO L226 Difference]: Without dead ends: 21 [2019-09-05 12:46:28,144 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 12:46:28,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-05 12:46:28,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-05 12:46:28,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-05 12:46:28,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2019-09-05 12:46:28,182 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 10 [2019-09-05 12:46:28,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:28,182 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 31 transitions. [2019-09-05 12:46:28,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-05 12:46:28,182 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2019-09-05 12:46:28,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 12:46:28,183 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:28,183 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:28,184 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:28,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:28,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1847134466, now seen corresponding path program 1 times [2019-09-05 12:46:28,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:28,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:28,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:28,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:28,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:28,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:28,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:28,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:28,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 12:46:28,348 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:28,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 12:46:28,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 12:46:28,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 12:46:28,352 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. Second operand 3 states. [2019-09-05 12:46:28,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:28,452 INFO L93 Difference]: Finished difference Result 23 states and 34 transitions. [2019-09-05 12:46:28,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 12:46:28,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-05 12:46:28,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:28,458 INFO L225 Difference]: With dead ends: 23 [2019-09-05 12:46:28,458 INFO L226 Difference]: Without dead ends: 23 [2019-09-05 12:46:28,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 12:46:28,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-05 12:46:28,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-09-05 12:46:28,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-05 12:46:28,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2019-09-05 12:46:28,469 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 10 [2019-09-05 12:46:28,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:28,470 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2019-09-05 12:46:28,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 12:46:28,470 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2019-09-05 12:46:28,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-05 12:46:28,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:28,471 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:28,472 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:28,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:28,472 INFO L82 PathProgramCache]: Analyzing trace with hash -129940435, now seen corresponding path program 1 times [2019-09-05 12:46:28,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:28,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:28,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:28,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:28,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:28,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:28,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:28,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:28,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 12:46:28,604 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:28,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 12:46:28,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 12:46:28,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 12:46:28,606 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 3 states. [2019-09-05 12:46:28,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:28,717 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2019-09-05 12:46:28,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 12:46:28,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-05 12:46:28,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:28,720 INFO L225 Difference]: With dead ends: 34 [2019-09-05 12:46:28,720 INFO L226 Difference]: Without dead ends: 34 [2019-09-05 12:46:28,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 12:46:28,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-05 12:46:28,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-09-05 12:46:28,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-05 12:46:28,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2019-09-05 12:46:28,727 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 21 [2019-09-05 12:46:28,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:28,727 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-09-05 12:46:28,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 12:46:28,727 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2019-09-05 12:46:28,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-05 12:46:28,728 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:28,729 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:28,729 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:28,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:28,729 INFO L82 PathProgramCache]: Analyzing trace with hash 263086575, now seen corresponding path program 1 times [2019-09-05 12:46:28,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:28,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:28,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:28,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:28,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:29,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:29,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:29,035 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:29,036 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2019-09-05 12:46:29,038 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [22], [28], [34], [40], [46], [52], [58], [64], [70], [79], [82], [84], [90], [91], [92], [94] [2019-09-05 12:46:29,074 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 12:46:29,075 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 12:46:29,138 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-05 12:46:29,788 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 12:46:29,791 INFO L272 AbstractInterpreter]: Visited 21 different actions 101 times. Merged at 12 different actions 60 times. Widened at 1 different actions 3 times. Performed 227 root evaluator evaluations with a maximum evaluation depth of 13. Performed 227 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 3 variables. [2019-09-05 12:46:29,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:29,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 12:46:29,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:29,796 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 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:29,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:29,817 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 12:46:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:29,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-05 12:46:29,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:29,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:29,902 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:31,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:31,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:31,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-09-05 12:46:31,344 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:31,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-05 12:46:31,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-05 12:46:31,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-09-05 12:46:31,347 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 14 states. [2019-09-05 12:46:31,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:31,561 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2019-09-05 12:46:31,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-05 12:46:31,562 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2019-09-05 12:46:31,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:31,563 INFO L225 Difference]: With dead ends: 46 [2019-09-05 12:46:31,563 INFO L226 Difference]: Without dead ends: 46 [2019-09-05 12:46:31,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-09-05 12:46:31,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-05 12:46:31,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2019-09-05 12:46:31,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-05 12:46:31,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2019-09-05 12:46:31,570 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 21 [2019-09-05 12:46:31,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:31,570 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2019-09-05 12:46:31,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-05 12:46:31,570 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2019-09-05 12:46:31,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-05 12:46:31,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:31,572 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:31,572 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:31,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:31,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1016777103, now seen corresponding path program 1 times [2019-09-05 12:46:31,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:31,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:31,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:31,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:31,574 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:31,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:33,622 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse4))) (let ((.cse1 (* (- 2) .cse4)) (.cse2 (= .cse0 c_main_~y~0)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296)))) (and (or (not (= c_main_~y~0 (+ .cse0 (* 4294967296 (div (+ .cse1 c_main_~y~0 (- 2)) 4294967296)) 2))) .cse2 (<= .cse3 c_main_~y~0)) (or (not (= (+ .cse0 (* 4294967296 (div (+ .cse1 c_main_~y~0) 4294967296))) c_main_~y~0)) (and (not .cse2) (< c_main_~y~0 .cse3))))))) is different from false [2019-09-05 12:46:33,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:33,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:33,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 12:46:33,629 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:33,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 12:46:33,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 12:46:33,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-09-05 12:46:33,630 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 3 states. [2019-09-05 12:46:33,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:33,633 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2019-09-05 12:46:33,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 12:46:33,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-05 12:46:33,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:33,634 INFO L225 Difference]: With dead ends: 44 [2019-09-05 12:46:33,634 INFO L226 Difference]: Without dead ends: 44 [2019-09-05 12:46:33,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-09-05 12:46:33,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-05 12:46:33,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-05 12:46:33,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-05 12:46:33,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2019-09-05 12:46:33,644 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 21 [2019-09-05 12:46:33,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:33,644 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2019-09-05 12:46:33,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 12:46:33,645 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2019-09-05 12:46:33,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-05 12:46:33,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:33,646 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:33,646 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:33,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:33,648 INFO L82 PathProgramCache]: Analyzing trace with hash -2027894353, now seen corresponding path program 1 times [2019-09-05 12:46:33,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:33,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:33,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:33,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:33,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:35,711 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse4))) (let ((.cse1 (* (- 2) .cse4)) (.cse2 (= .cse0 c_main_~y~0)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296)))) (and (or (not (= c_main_~y~0 (+ .cse0 (* 4294967296 (div (+ .cse1 c_main_~y~0 (- 2)) 4294967296)) 2))) .cse2 (<= .cse3 c_main_~y~0)) (or (not (= (+ .cse0 (* 4294967296 (div (+ .cse1 c_main_~y~0) 4294967296))) c_main_~y~0)) (and (not .cse2) (< c_main_~y~0 .cse3))))))) is different from false [2019-09-05 12:46:35,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:35,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:35,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 12:46:35,715 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:35,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 12:46:35,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 12:46:35,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-09-05 12:46:35,717 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand 3 states. [2019-09-05 12:46:35,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:35,719 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2019-09-05 12:46:35,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 12:46:35,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-05 12:46:35,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:35,720 INFO L225 Difference]: With dead ends: 44 [2019-09-05 12:46:35,721 INFO L226 Difference]: Without dead ends: 44 [2019-09-05 12:46:35,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-09-05 12:46:35,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-05 12:46:35,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-05 12:46:35,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-05 12:46:35,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2019-09-05 12:46:35,731 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 21 [2019-09-05 12:46:35,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:35,732 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2019-09-05 12:46:35,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 12:46:35,732 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2019-09-05 12:46:35,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-05 12:46:35,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:35,733 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:35,733 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:35,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:35,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1680266929, now seen corresponding path program 1 times [2019-09-05 12:46:35,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:35,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:35,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:35,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:35,735 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:35,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:37,773 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse4))) (let ((.cse1 (* (- 2) .cse4)) (.cse2 (= .cse0 c_main_~y~0)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296)))) (and (or (not (= c_main_~y~0 (+ .cse0 (* 4294967296 (div (+ .cse1 c_main_~y~0 (- 2)) 4294967296)) 2))) .cse2 (<= .cse3 c_main_~y~0)) (or (not (= (+ .cse0 (* 4294967296 (div (+ .cse1 c_main_~y~0) 4294967296))) c_main_~y~0)) (and (not .cse2) (< c_main_~y~0 .cse3))))))) is different from false [2019-09-05 12:46:37,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:37,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:37,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 12:46:37,779 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:37,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 12:46:37,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 12:46:37,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-09-05 12:46:37,780 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand 3 states. [2019-09-05 12:46:37,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:37,783 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2019-09-05 12:46:37,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 12:46:37,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-05 12:46:37,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:37,785 INFO L225 Difference]: With dead ends: 44 [2019-09-05 12:46:37,785 INFO L226 Difference]: Without dead ends: 44 [2019-09-05 12:46:37,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-09-05 12:46:37,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-05 12:46:37,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-05 12:46:37,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-05 12:46:37,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2019-09-05 12:46:37,794 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 21 [2019-09-05 12:46:37,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:37,795 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2019-09-05 12:46:37,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 12:46:37,795 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2019-09-05 12:46:37,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-05 12:46:37,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:37,796 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:37,796 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:37,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:37,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1938432367, now seen corresponding path program 1 times [2019-09-05 12:46:37,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:37,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:37,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:37,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:37,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:37,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:39,827 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse4))) (let ((.cse1 (* (- 2) .cse4)) (.cse2 (= .cse0 c_main_~y~0)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296)))) (and (or (not (= c_main_~y~0 (+ .cse0 (* 4294967296 (div (+ .cse1 c_main_~y~0 (- 2)) 4294967296)) 2))) .cse2 (<= .cse3 c_main_~y~0)) (or (not (= (+ .cse0 (* 4294967296 (div (+ .cse1 c_main_~y~0) 4294967296))) c_main_~y~0)) (and (not .cse2) (< c_main_~y~0 .cse3))))))) is different from false [2019-09-05 12:46:39,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:39,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:39,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 12:46:39,832 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:39,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 12:46:39,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 12:46:39,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-09-05 12:46:39,833 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 3 states. [2019-09-05 12:46:39,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:39,836 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2019-09-05 12:46:39,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 12:46:39,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-05 12:46:39,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:39,837 INFO L225 Difference]: With dead ends: 44 [2019-09-05 12:46:39,837 INFO L226 Difference]: Without dead ends: 44 [2019-09-05 12:46:39,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-09-05 12:46:39,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-05 12:46:39,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-05 12:46:39,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-05 12:46:39,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2019-09-05 12:46:39,842 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 21 [2019-09-05 12:46:39,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:39,842 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2019-09-05 12:46:39,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 12:46:39,842 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2019-09-05 12:46:39,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-05 12:46:39,843 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:39,843 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:39,844 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:39,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:39,844 INFO L82 PathProgramCache]: Analyzing trace with hash -2048497361, now seen corresponding path program 1 times [2019-09-05 12:46:39,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:39,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:39,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:39,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:39,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:41,890 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse4))) (let ((.cse1 (* (- 2) .cse4)) (.cse2 (= .cse0 c_main_~y~0)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296)))) (and (or (not (= c_main_~y~0 (+ .cse0 (* 4294967296 (div (+ .cse1 c_main_~y~0 (- 2)) 4294967296)) 2))) .cse2 (<= .cse3 c_main_~y~0)) (or (not (= (+ .cse0 (* 4294967296 (div (+ .cse1 c_main_~y~0) 4294967296))) c_main_~y~0)) (and (not .cse2) (< c_main_~y~0 .cse3))))))) is different from false [2019-09-05 12:46:41,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:41,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:41,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 12:46:41,893 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:41,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 12:46:41,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 12:46:41,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-09-05 12:46:41,894 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 3 states. [2019-09-05 12:46:41,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:41,897 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2019-09-05 12:46:41,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 12:46:41,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-05 12:46:41,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:41,898 INFO L225 Difference]: With dead ends: 44 [2019-09-05 12:46:41,898 INFO L226 Difference]: Without dead ends: 44 [2019-09-05 12:46:41,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-09-05 12:46:41,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-05 12:46:41,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-05 12:46:41,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-05 12:46:41,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2019-09-05 12:46:41,902 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 21 [2019-09-05 12:46:41,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:41,902 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2019-09-05 12:46:41,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 12:46:41,903 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2019-09-05 12:46:41,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-05 12:46:41,907 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:41,907 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:41,907 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:41,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:41,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1368438991, now seen corresponding path program 1 times [2019-09-05 12:46:41,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:41,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:41,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:41,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:41,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:41,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:41,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:41,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:41,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 12:46:41,977 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:41,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 12:46:41,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 12:46:41,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 12:46:41,978 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 3 states. [2019-09-05 12:46:42,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:42,033 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2019-09-05 12:46:42,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 12:46:42,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-05 12:46:42,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:42,035 INFO L225 Difference]: With dead ends: 45 [2019-09-05 12:46:42,035 INFO L226 Difference]: Without dead ends: 45 [2019-09-05 12:46:42,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 12:46:42,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-05 12:46:42,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-09-05 12:46:42,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-05 12:46:42,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2019-09-05 12:46:42,040 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 21 [2019-09-05 12:46:42,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:42,040 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2019-09-05 12:46:42,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 12:46:42,040 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2019-09-05 12:46:42,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-05 12:46:42,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:42,041 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:42,042 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:42,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:42,042 INFO L82 PathProgramCache]: Analyzing trace with hash -345519953, now seen corresponding path program 1 times [2019-09-05 12:46:42,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:42,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:42,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:42,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:42,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:44,234 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (div c_main_~y~0 2))) (let ((.cse0 (= (* 2 .cse3) c_main_~y~0)) (.cse2 (* (- 2) .cse3)) (.cse1 (* 4294967296 (div c_main_~y~0 4294967296)))) (or (and (<= c_main_~x~0 0) (<= 0 c_main_~x~0)) (and (or .cse0 (<= .cse1 c_main_~y~0)) (<= (+ (div (+ .cse2 c_main_~y~0) 4294967296) 1) 0)) (and (not .cse0) (<= (+ (div (+ .cse2 c_main_~y~0 (- 2)) 4294967296) 1) 0) (< c_main_~y~0 .cse1))))) is different from true [2019-09-05 12:46:46,283 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse20 (div c_main_~y~0 2))) (let ((.cse11 (* 2 .cse20))) (let ((.cse2 (= .cse11 c_main_~y~0)) (.cse19 (* (- 2) .cse20)) (.cse18 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse4 (<= .cse18 c_main_~y~0)) (.cse14 (div (+ .cse19 c_main_~y~0 (- 2)) 4294967296)) (.cse8 (not .cse2)) (.cse10 (< c_main_~y~0 .cse18)) (.cse15 (div (+ .cse19 c_main_~y~0) 4294967296))) (let ((.cse16 (+ .cse15 1)) (.cse1 (and .cse8 .cse10)) (.cse17 (+ .cse14 1)) (.cse5 (or .cse2 .cse4))) (and (or (let ((.cse12 (* 4294967296 .cse15)) (.cse13 (* 4294967296 .cse14))) (let ((.cse9 (+ .cse11 .cse13 2)) (.cse7 (+ .cse11 .cse12)) (.cse6 (<= c_main_~y~0 (+ .cse11 1))) (.cse3 (+ .cse11 .cse13 3)) (.cse0 (+ .cse11 .cse12 1))) (and (or (and (or (< .cse0 c_main_~y~0) .cse1) (or .cse2 (< .cse3 c_main_~y~0) .cse4)) (and .cse5 .cse6 (or (and .cse5 (<= c_main_~y~0 .cse7)) (and .cse8 (<= c_main_~y~0 .cse9) .cse10) .cse2 .cse1 .cse4) (or (and .cse8 (<= .cse9 c_main_~y~0) .cse10) (and .cse5 (<= .cse7 c_main_~y~0)) (and (or .cse1 (< .cse7 c_main_~y~0)) (or .cse2 (< .cse9 c_main_~y~0) .cse4))))) (<= c_main_~x~0 1) (or (not (= c_main_~y~0 .cse9)) .cse2 .cse4) (<= 1 c_main_~x~0) (or (not (= .cse7 c_main_~y~0)) .cse1) (or (and .cse5 .cse6) (and .cse8 (<= c_main_~y~0 .cse3) .cse10) (and .cse5 (<= c_main_~y~0 .cse0)) (and .cse8 (<= c_main_~y~0 (+ .cse11 3)) .cse10))))) (and .cse5 (<= .cse16 0)) (and .cse8 (<= .cse17 0) .cse10)) (< .cse18 (+ c_main_~y~0 1)) (or (and .cse8 (<= 0 .cse14) .cse10) (and (or (< 0 .cse16) .cse1) (or .cse2 (< 0 .cse17) .cse4)) (and .cse5 (<= 0 .cse15))))))))) is different from false [2019-09-05 12:46:48,304 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse21 (div c_main_~y~0 2))) (let ((.cse15 (* 2 .cse21))) (let ((.cse8 (= .cse15 c_main_~y~0)) (.cse20 (* (- 2) .cse21)) (.cse0 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse10 (<= .cse0 c_main_~y~0)) (.cse18 (div (+ .cse20 c_main_~y~0 (- 2)) 4294967296)) (.cse3 (not .cse8)) (.cse5 (< c_main_~y~0 .cse0)) (.cse19 (div (+ .cse20 c_main_~y~0) 4294967296))) (let ((.cse2 (+ .cse19 1)) (.cse7 (and .cse3 .cse5)) (.cse4 (+ .cse18 1)) (.cse1 (or .cse8 .cse10))) (and (< .cse0 (+ c_main_~y~0 1)) (or (and .cse1 (<= .cse2 0)) (and .cse3 (<= .cse4 0) .cse5) (let ((.cse16 (* 4294967296 .cse19)) (.cse17 (* 4294967296 .cse18))) (let ((.cse13 (+ .cse15 .cse17 2)) (.cse14 (+ c_main_~x~0 1)) (.cse12 (+ .cse15 .cse16)) (.cse11 (<= c_main_~y~0 (+ .cse15 1))) (.cse9 (+ .cse15 .cse17 3)) (.cse6 (+ .cse15 .cse16 1))) (and (or (and (or (< .cse6 c_main_~y~0) .cse7) (or .cse8 (< .cse9 c_main_~y~0) .cse10)) (and .cse1 .cse11 (or (and .cse1 (<= c_main_~y~0 .cse12)) (and .cse3 (<= c_main_~y~0 .cse13) .cse5) .cse8 .cse7 .cse10) (or (and .cse3 (<= .cse13 c_main_~y~0) .cse5) (and .cse1 (<= .cse12 c_main_~y~0)) (and (or .cse7 (< .cse12 c_main_~y~0)) (or .cse8 (< .cse13 c_main_~y~0) .cse10))))) (<= .cse14 0) (or (not (= c_main_~y~0 .cse13)) .cse8 .cse10) (<= 0 .cse14) (or (not (= .cse12 c_main_~y~0)) .cse7) (or (and .cse1 .cse11) (and .cse3 (<= c_main_~y~0 .cse9) .cse5) (and .cse1 (<= c_main_~y~0 .cse6)) (and .cse3 (<= c_main_~y~0 (+ .cse15 3)) .cse5)))))) (or (and .cse3 (<= 0 .cse18) .cse5) (and (or (< 0 .cse2) .cse7) (or .cse8 (< 0 .cse4) .cse10)) (and .cse1 (<= 0 .cse19))))))))) is different from false [2019-09-05 12:46:50,316 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse21 (div c_main_~y~0 2))) (let ((.cse15 (* 2 .cse21))) (let ((.cse8 (= .cse15 c_main_~y~0)) (.cse20 (* (- 2) .cse21)) (.cse0 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse10 (<= .cse0 c_main_~y~0)) (.cse18 (div (+ .cse20 c_main_~y~0 (- 2)) 4294967296)) (.cse3 (not .cse8)) (.cse5 (< c_main_~y~0 .cse0)) (.cse19 (div (+ .cse20 c_main_~y~0) 4294967296))) (let ((.cse2 (+ .cse19 1)) (.cse7 (and .cse3 .cse5)) (.cse4 (+ .cse18 1)) (.cse1 (or .cse8 .cse10))) (and (< .cse0 (+ c_main_~y~0 1)) (or (and .cse1 (<= .cse2 0)) (and .cse3 (<= .cse4 0) .cse5) (let ((.cse16 (* 4294967296 .cse19)) (.cse17 (* 4294967296 .cse18))) (let ((.cse13 (+ .cse15 .cse17 2)) (.cse14 (+ c_main_~x~0 1)) (.cse12 (+ .cse15 .cse16)) (.cse11 (<= c_main_~y~0 (+ .cse15 1))) (.cse9 (+ .cse15 .cse17 3)) (.cse6 (+ .cse15 .cse16 1))) (and (or (and (or (< .cse6 c_main_~y~0) .cse7) (or .cse8 (< .cse9 c_main_~y~0) .cse10)) (and .cse1 .cse11 (or (and .cse1 (<= c_main_~y~0 .cse12)) (and .cse3 (<= c_main_~y~0 .cse13) .cse5) .cse8 .cse7 .cse10) (or (and .cse3 (<= .cse13 c_main_~y~0) .cse5) (and .cse1 (<= .cse12 c_main_~y~0)) (and (or .cse7 (< .cse12 c_main_~y~0)) (or .cse8 (< .cse13 c_main_~y~0) .cse10))))) (<= .cse14 0) (or (not (= c_main_~y~0 .cse13)) .cse8 .cse10) (<= 0 .cse14) (or (not (= .cse12 c_main_~y~0)) .cse7) (or (and .cse1 .cse11) (and .cse3 (<= c_main_~y~0 .cse9) .cse5) (and .cse1 (<= c_main_~y~0 .cse6)) (and .cse3 (<= c_main_~y~0 (+ .cse15 3)) .cse5)))))) (or (and .cse3 (<= 0 .cse18) .cse5) (and (or (< 0 .cse2) .cse7) (or .cse8 (< 0 .cse4) .cse10)) (and .cse1 (<= 0 .cse19))))))))) is different from true [2019-09-05 12:46:52,357 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse24 (div c_main_~y~0 2))) (let ((.cse13 (* 2 .cse24))) (let ((.cse8 (= .cse13 c_main_~y~0)) (.cse22 (* (- 2) .cse24)) (.cse23 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse10 (<= .cse23 c_main_~y~0)) (.cse20 (div (+ .cse22 c_main_~y~0 (- 2)) 4294967296)) (.cse2 (not .cse8)) (.cse4 (< c_main_~y~0 .cse23)) (.cse21 (div (+ .cse22 c_main_~y~0) 4294967296))) (let ((.cse1 (+ .cse21 1)) (.cse7 (and .cse2 .cse4)) (.cse3 (+ .cse20 1)) (.cse0 (or .cse8 .cse10))) (and (or (and .cse0 (<= .cse1 0)) (and .cse2 (<= .cse3 0) .cse4) (let ((.cse15 (* 4294967296 .cse21)) (.cse14 (* 4294967296 .cse20))) (let ((.cse12 (+ .cse13 .cse14 2)) (.cse11 (+ .cse13 .cse15)) (.cse5 (+ c_main_~x~0 3)) (.cse16 (and .cse0 (<= c_main_~y~0 (+ .cse13 1)))) (.cse9 (+ .cse13 .cse14 3)) (.cse6 (+ .cse13 .cse15 1)) (.cse17 (and .cse2 (<= c_main_~y~0 (+ .cse13 3)) .cse4))) (and (<= 0 .cse5) (or (and (or (< .cse6 c_main_~y~0) .cse7) (or .cse8 (< .cse9 c_main_~y~0) .cse10)) (let ((.cse18 (and .cse2 (<= .cse12 c_main_~y~0) .cse4)) (.cse19 (and .cse0 (<= .cse11 c_main_~y~0)))) (and (or (and .cse0 (<= c_main_~y~0 .cse11)) (and .cse2 (<= c_main_~y~0 .cse12) .cse4) (and .cse2 (<= c_main_~y~0 (+ .cse13 .cse14 4294967297)) .cse4) (and .cse0 (<= c_main_~y~0 (+ .cse13 .cse15 4294967295)))) (or .cse16 .cse17) (or .cse18 .cse19) (or .cse18 .cse19 (and (or .cse7 (< .cse11 c_main_~y~0)) (or .cse8 (< .cse12 c_main_~y~0) .cse10)))))) (or (not (= c_main_~y~0 .cse12)) .cse8 .cse10) (or (not (= .cse11 c_main_~y~0)) .cse7) (<= .cse5 0) (or .cse16 (and .cse2 (<= c_main_~y~0 .cse9) .cse4) (and .cse0 (<= c_main_~y~0 .cse6)) .cse17))))) (or (and .cse2 (<= 0 .cse20) .cse4) (and (or (< 0 .cse1) .cse7) (or .cse8 (< 0 .cse3) .cse10)) (and .cse0 (<= 0 .cse21))))))))) is different from false [2019-09-05 12:46:54,385 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse23 (div c_main_~y~0 2))) (let ((.cse12 (* 2 .cse23))) (let ((.cse7 (= .cse12 c_main_~y~0)) (.cse21 (* (- 2) .cse23)) (.cse22 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse9 (<= .cse22 c_main_~y~0)) (.cse19 (div (+ .cse21 c_main_~y~0 (- 2)) 4294967296)) (.cse2 (not .cse7)) (.cse4 (< c_main_~y~0 .cse22)) (.cse20 (div (+ .cse21 c_main_~y~0) 4294967296))) (let ((.cse1 (+ .cse20 1)) (.cse6 (and .cse2 .cse4)) (.cse3 (+ .cse19 1)) (.cse0 (or .cse7 .cse9))) (and (or (and .cse0 (<= .cse1 0)) (and .cse2 (<= .cse3 0) .cse4) (let ((.cse14 (* 4294967296 .cse20)) (.cse13 (* 4294967296 .cse19))) (let ((.cse11 (+ .cse12 .cse13 2)) (.cse10 (+ .cse12 .cse14)) (.cse15 (and .cse0 (<= c_main_~y~0 (+ .cse12 1)))) (.cse8 (+ .cse12 .cse13 3)) (.cse5 (+ .cse12 .cse14 1)) (.cse16 (and .cse2 (<= c_main_~y~0 (+ .cse12 3)) .cse4))) (and (or (and (or (< .cse5 c_main_~y~0) .cse6) (or .cse7 (< .cse8 c_main_~y~0) .cse9)) (let ((.cse17 (and .cse2 (<= .cse11 c_main_~y~0) .cse4)) (.cse18 (and .cse0 (<= .cse10 c_main_~y~0)))) (and (or (and .cse0 (<= c_main_~y~0 .cse10)) (and .cse2 (<= c_main_~y~0 .cse11) .cse4) (and .cse2 (<= c_main_~y~0 (+ .cse12 .cse13 4294967297)) .cse4) (and .cse0 (<= c_main_~y~0 (+ .cse12 .cse14 4294967295)))) (or .cse15 .cse16) (or .cse17 .cse18) (or .cse17 .cse18 (and (or .cse6 (< .cse10 c_main_~y~0)) (or .cse7 (< .cse11 c_main_~y~0) .cse9)))))) (<= c_main_~x~0 1) (or (not (= c_main_~y~0 .cse11)) .cse7 .cse9) (<= 1 c_main_~x~0) (or (not (= .cse10 c_main_~y~0)) .cse6) (or .cse15 (and .cse2 (<= c_main_~y~0 .cse8) .cse4) (and .cse0 (<= c_main_~y~0 .cse5)) .cse16))))) (or (and .cse2 (<= 0 .cse19) .cse4) (and (or (< 0 .cse1) .cse6) (or .cse7 (< 0 .cse3) .cse9)) (and .cse0 (<= 0 .cse20))))))))) is different from false [2019-09-05 12:46:56,412 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse23 (div c_main_~y~0 2))) (let ((.cse10 (* 2 .cse23))) (let ((.cse2 (= .cse10 c_main_~y~0)) (.cse21 (* (- 2) .cse23)) (.cse22 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse4 (<= .cse22 c_main_~y~0)) (.cse17 (div (+ .cse21 c_main_~y~0 (- 2)) 4294967296)) (.cse7 (not .cse2)) (.cse9 (< c_main_~y~0 .cse22)) (.cse18 (div (+ .cse21 c_main_~y~0) 4294967296))) (let ((.cse19 (+ .cse18 1)) (.cse1 (and .cse7 .cse9)) (.cse20 (+ .cse17 1)) (.cse5 (or .cse2 .cse4))) (and (or (let ((.cse12 (* 4294967296 .cse18)) (.cse11 (* 4294967296 .cse17))) (let ((.cse8 (+ .cse10 .cse11 2)) (.cse6 (+ .cse10 .cse12)) (.cse13 (and .cse5 (<= c_main_~y~0 (+ .cse10 1)))) (.cse3 (+ .cse10 .cse11 3)) (.cse0 (+ .cse10 .cse12 1)) (.cse14 (and .cse7 (<= c_main_~y~0 (+ .cse10 3)) .cse9))) (and (or (and (or (< .cse0 c_main_~y~0) .cse1) (or .cse2 (< .cse3 c_main_~y~0) .cse4)) (let ((.cse15 (and .cse7 (<= .cse8 c_main_~y~0) .cse9)) (.cse16 (and .cse5 (<= .cse6 c_main_~y~0)))) (and (or (and .cse5 (<= c_main_~y~0 .cse6)) (and .cse7 (<= c_main_~y~0 .cse8) .cse9) (and .cse7 (<= c_main_~y~0 (+ .cse10 .cse11 4294967297)) .cse9) (and .cse5 (<= c_main_~y~0 (+ .cse10 .cse12 4294967295)))) (or .cse13 .cse14) (or .cse15 .cse16) (or .cse15 .cse16 (and (or .cse1 (< .cse6 c_main_~y~0)) (or .cse2 (< .cse8 c_main_~y~0) .cse4)))))) (<= c_main_~x~0 3) (or (not (= c_main_~y~0 .cse8)) .cse2 .cse4) (or (not (= .cse6 c_main_~y~0)) .cse1) (<= 3 c_main_~x~0) (or .cse13 (and .cse7 (<= c_main_~y~0 .cse3) .cse9) (and .cse5 (<= c_main_~y~0 .cse0)) .cse14)))) (and .cse5 (<= .cse19 0)) (and .cse7 (<= .cse20 0) .cse9)) (or (and .cse7 (<= 0 .cse17) .cse9) (and (or (< 0 .cse19) .cse1) (or .cse2 (< 0 .cse20) .cse4)) (and .cse5 (<= 0 .cse18))))))))) is different from false [2019-09-05 12:46:58,439 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse22 (div c_main_~y~0 2))) (let ((.cse13 (* 2 .cse22))) (let ((.cse8 (= .cse13 c_main_~y~0)) (.cse20 (* (- 2) .cse22)) (.cse21 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse10 (<= .cse21 c_main_~y~0)) (.cse18 (div (+ .cse20 c_main_~y~0 (- 2)) 4294967296)) (.cse2 (not .cse8)) (.cse4 (< c_main_~y~0 .cse21)) (.cse19 (div (+ .cse20 c_main_~y~0) 4294967296))) (let ((.cse1 (+ .cse19 1)) (.cse7 (and .cse2 .cse4)) (.cse3 (+ .cse18 1)) (.cse0 (or .cse8 .cse10))) (and (or (and .cse0 (<= .cse1 0)) (and .cse2 (<= .cse3 0) .cse4) (let ((.cse15 (* 4294967296 .cse19)) (.cse14 (* 4294967296 .cse18))) (let ((.cse5 (+ c_main_~x~0 1)) (.cse16 (and .cse0 (<= c_main_~y~0 (+ .cse13 1)))) (.cse9 (+ .cse13 .cse14 3)) (.cse6 (+ .cse13 .cse15 1)) (.cse17 (and .cse2 (<= c_main_~y~0 (+ .cse13 3)) .cse4))) (and (<= .cse5 0) (or (and (or (< .cse6 c_main_~y~0) .cse7) (or .cse8 (< .cse9 c_main_~y~0) .cse10)) (let ((.cse12 (+ .cse13 .cse14 2)) (.cse11 (+ .cse13 .cse15))) (and (or (and .cse2 .cse4 (<= .cse9 c_main_~y~0)) (and (or .cse7 (< .cse11 c_main_~y~0)) (or .cse8 (< .cse12 c_main_~y~0) .cse10)) (and .cse0 (<= .cse6 c_main_~y~0))) (or (and .cse0 (<= c_main_~y~0 .cse11)) (and .cse2 (<= c_main_~y~0 .cse12) .cse4) (and .cse2 (<= c_main_~y~0 (+ .cse13 .cse14 4294967297)) .cse4) (and .cse0 (<= c_main_~y~0 (+ .cse13 .cse15 4294967295)))) (or .cse16 .cse17) (or (and .cse2 (<= .cse12 c_main_~y~0) .cse4) (and .cse0 (<= .cse11 c_main_~y~0)))))) (<= 0 .cse5) (or .cse16 (and .cse2 (<= c_main_~y~0 .cse9) .cse4) (and .cse0 (<= c_main_~y~0 .cse6)) .cse17))))) (or (and .cse2 (<= 0 .cse18) .cse4) (and (or (< 0 .cse1) .cse7) (or .cse8 (< 0 .cse3) .cse10)) (and .cse0 (<= 0 .cse19))))))))) is different from false [2019-09-05 12:47:00,448 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse22 (div c_main_~y~0 2))) (let ((.cse13 (* 2 .cse22))) (let ((.cse8 (= .cse13 c_main_~y~0)) (.cse20 (* (- 2) .cse22)) (.cse21 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse10 (<= .cse21 c_main_~y~0)) (.cse18 (div (+ .cse20 c_main_~y~0 (- 2)) 4294967296)) (.cse2 (not .cse8)) (.cse4 (< c_main_~y~0 .cse21)) (.cse19 (div (+ .cse20 c_main_~y~0) 4294967296))) (let ((.cse1 (+ .cse19 1)) (.cse7 (and .cse2 .cse4)) (.cse3 (+ .cse18 1)) (.cse0 (or .cse8 .cse10))) (and (or (and .cse0 (<= .cse1 0)) (and .cse2 (<= .cse3 0) .cse4) (let ((.cse15 (* 4294967296 .cse19)) (.cse14 (* 4294967296 .cse18))) (let ((.cse5 (+ c_main_~x~0 1)) (.cse16 (and .cse0 (<= c_main_~y~0 (+ .cse13 1)))) (.cse9 (+ .cse13 .cse14 3)) (.cse6 (+ .cse13 .cse15 1)) (.cse17 (and .cse2 (<= c_main_~y~0 (+ .cse13 3)) .cse4))) (and (<= .cse5 0) (or (and (or (< .cse6 c_main_~y~0) .cse7) (or .cse8 (< .cse9 c_main_~y~0) .cse10)) (let ((.cse12 (+ .cse13 .cse14 2)) (.cse11 (+ .cse13 .cse15))) (and (or (and .cse2 .cse4 (<= .cse9 c_main_~y~0)) (and (or .cse7 (< .cse11 c_main_~y~0)) (or .cse8 (< .cse12 c_main_~y~0) .cse10)) (and .cse0 (<= .cse6 c_main_~y~0))) (or (and .cse0 (<= c_main_~y~0 .cse11)) (and .cse2 (<= c_main_~y~0 .cse12) .cse4) (and .cse2 (<= c_main_~y~0 (+ .cse13 .cse14 4294967297)) .cse4) (and .cse0 (<= c_main_~y~0 (+ .cse13 .cse15 4294967295)))) (or .cse16 .cse17) (or (and .cse2 (<= .cse12 c_main_~y~0) .cse4) (and .cse0 (<= .cse11 c_main_~y~0)))))) (<= 0 .cse5) (or .cse16 (and .cse2 (<= c_main_~y~0 .cse9) .cse4) (and .cse0 (<= c_main_~y~0 .cse6)) .cse17))))) (or (and .cse2 (<= 0 .cse18) .cse4) (and (or (< 0 .cse1) .cse7) (or .cse8 (< 0 .cse3) .cse10)) (and .cse0 (<= 0 .cse19))))))))) is different from true [2019-09-05 12:47:16,870 WARN L188 SmtUtils]: Spent 16.38 s on a formula simplification. DAG size of input: 181 DAG size of output: 21 [2019-09-05 12:47:16,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2019-09-05 12:47:16,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:16,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:47:16,922 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2019-09-05 12:47:16,922 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [18], [24], [30], [36], [42], [48], [54], [60], [66], [72], [79], [82], [84], [90], [91], [92], [94] [2019-09-05 12:47:16,924 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 12:47:16,925 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 12:47:16,926 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-05 12:47:17,530 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 12:47:17,530 INFO L272 AbstractInterpreter]: Visited 21 different actions 69 times. Merged at 12 different actions 36 times. Widened at 1 different actions 1 times. Performed 224 root evaluator evaluations with a maximum evaluation depth of 13. Performed 224 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2019-09-05 12:47:17,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:47:17,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 12:47:17,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:17,531 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-05 12:47:17,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:47:17,545 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-05 12:47:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:47:17,559 WARN L254 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-05 12:47:17,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:47:17,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:47:17,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:47:17,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:47:17,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:47:17,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:47:17,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:47:17,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:47:17,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:47:17,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:47:17,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:47:17,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:47:17,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:47:17,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:47:17,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:17,728 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:47:17,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 12:47:17,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:47:17,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:47:17,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:47:17,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:17,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:47:17,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 6] total 21 [2019-09-05 12:47:17,869 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:47:17,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-05 12:47:17,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-05 12:47:17,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=154, Unknown=9, NotChecked=210, Total=420 [2019-09-05 12:47:17,871 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 19 states. [2019-09-05 12:47:19,959 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse20 (div c_main_~y~0 2))) (let ((.cse11 (* 2 .cse20))) (let ((.cse2 (= .cse11 c_main_~y~0)) (.cse19 (* (- 2) .cse20)) (.cse18 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse4 (<= .cse18 c_main_~y~0)) (.cse14 (div (+ .cse19 c_main_~y~0 (- 2)) 4294967296)) (.cse8 (not .cse2)) (.cse10 (< c_main_~y~0 .cse18)) (.cse15 (div (+ .cse19 c_main_~y~0) 4294967296))) (let ((.cse16 (+ .cse15 1)) (.cse1 (and .cse8 .cse10)) (.cse17 (+ .cse14 1)) (.cse5 (or .cse2 .cse4))) (and (= c_main_~x~0 1) (or (let ((.cse12 (* 4294967296 .cse15)) (.cse13 (* 4294967296 .cse14))) (let ((.cse9 (+ .cse11 .cse13 2)) (.cse7 (+ .cse11 .cse12)) (.cse6 (<= c_main_~y~0 (+ .cse11 1))) (.cse3 (+ .cse11 .cse13 3)) (.cse0 (+ .cse11 .cse12 1))) (and (or (and (or (< .cse0 c_main_~y~0) .cse1) (or .cse2 (< .cse3 c_main_~y~0) .cse4)) (and .cse5 .cse6 (or (and .cse5 (<= c_main_~y~0 .cse7)) (and .cse8 (<= c_main_~y~0 .cse9) .cse10) .cse2 .cse1 .cse4) (or (and .cse8 (<= .cse9 c_main_~y~0) .cse10) (and .cse5 (<= .cse7 c_main_~y~0)) (and (or .cse1 (< .cse7 c_main_~y~0)) (or .cse2 (< .cse9 c_main_~y~0) .cse4))))) (<= c_main_~x~0 1) (or (not (= c_main_~y~0 .cse9)) .cse2 .cse4) (<= 1 c_main_~x~0) (or (not (= .cse7 c_main_~y~0)) .cse1) (or (and .cse5 .cse6) (and .cse8 (<= c_main_~y~0 .cse3) .cse10) (and .cse5 (<= c_main_~y~0 .cse0)) (and .cse8 (<= c_main_~y~0 (+ .cse11 3)) .cse10))))) (and .cse5 (<= .cse16 0)) (and .cse8 (<= .cse17 0) .cse10)) (< .cse18 (+ c_main_~y~0 1)) (not (= (mod c_main_~y~0 2) 0)) (or (and .cse8 (<= 0 .cse14) .cse10) (and (or (< 0 .cse16) .cse1) (or .cse2 (< 0 .cse17) .cse4)) (and .cse5 (<= 0 .cse15))))))))) is different from false [2019-09-05 12:47:21,987 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse20 (div c_main_~y~0 2))) (let ((.cse11 (* 2 .cse20))) (let ((.cse2 (= .cse11 c_main_~y~0)) (.cse19 (* (- 2) .cse20)) (.cse18 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse4 (<= .cse18 c_main_~y~0)) (.cse14 (div (+ .cse19 c_main_~y~0 (- 2)) 4294967296)) (.cse8 (not .cse2)) (.cse10 (< c_main_~y~0 .cse18)) (.cse15 (div (+ .cse19 c_main_~y~0) 4294967296))) (let ((.cse16 (+ .cse15 1)) (.cse1 (and .cse8 .cse10)) (.cse17 (+ .cse14 1)) (.cse5 (or .cse2 .cse4))) (and (= c_main_~x~0 1) (or (let ((.cse12 (* 4294967296 .cse15)) (.cse13 (* 4294967296 .cse14))) (let ((.cse9 (+ .cse11 .cse13 2)) (.cse7 (+ .cse11 .cse12)) (.cse6 (<= c_main_~y~0 (+ .cse11 1))) (.cse3 (+ .cse11 .cse13 3)) (.cse0 (+ .cse11 .cse12 1))) (and (or (and (or (< .cse0 c_main_~y~0) .cse1) (or .cse2 (< .cse3 c_main_~y~0) .cse4)) (and .cse5 .cse6 (or (and .cse5 (<= c_main_~y~0 .cse7)) (and .cse8 (<= c_main_~y~0 .cse9) .cse10) .cse2 .cse1 .cse4) (or (and .cse8 (<= .cse9 c_main_~y~0) .cse10) (and .cse5 (<= .cse7 c_main_~y~0)) (and (or .cse1 (< .cse7 c_main_~y~0)) (or .cse2 (< .cse9 c_main_~y~0) .cse4))))) (<= c_main_~x~0 1) (or (not (= c_main_~y~0 .cse9)) .cse2 .cse4) (<= 1 c_main_~x~0) (or (not (= .cse7 c_main_~y~0)) .cse1) (or (and .cse5 .cse6) (and .cse8 (<= c_main_~y~0 .cse3) .cse10) (and .cse5 (<= c_main_~y~0 .cse0)) (and .cse8 (<= c_main_~y~0 (+ .cse11 3)) .cse10))))) (and .cse5 (<= .cse16 0)) (and .cse8 (<= .cse17 0) .cse10)) (< .cse18 (+ c_main_~y~0 1)) (not (= (mod c_main_~y~0 2) 0)) (or (and .cse8 (<= 0 .cse14) .cse10) (and (or (< 0 .cse16) .cse1) (or .cse2 (< 0 .cse17) .cse4)) (and .cse5 (<= 0 .cse15))))))))) is different from true [2019-09-05 12:47:24,012 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse21 (div c_main_~y~0 2))) (let ((.cse15 (* 2 .cse21))) (let ((.cse8 (= .cse15 c_main_~y~0)) (.cse20 (* (- 2) .cse21)) (.cse0 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse10 (<= .cse0 c_main_~y~0)) (.cse18 (div (+ .cse20 c_main_~y~0 (- 2)) 4294967296)) (.cse3 (not .cse8)) (.cse5 (< c_main_~y~0 .cse0)) (.cse19 (div (+ .cse20 c_main_~y~0) 4294967296))) (let ((.cse2 (+ .cse19 1)) (.cse7 (and .cse3 .cse5)) (.cse4 (+ .cse18 1)) (.cse1 (or .cse8 .cse10)) (.cse14 (+ c_main_~x~0 1))) (and (< .cse0 (+ c_main_~y~0 1)) (or (and .cse1 (<= .cse2 0)) (and .cse3 (<= .cse4 0) .cse5) (let ((.cse16 (* 4294967296 .cse19)) (.cse17 (* 4294967296 .cse18))) (let ((.cse13 (+ .cse15 .cse17 2)) (.cse12 (+ .cse15 .cse16)) (.cse11 (<= c_main_~y~0 (+ .cse15 1))) (.cse9 (+ .cse15 .cse17 3)) (.cse6 (+ .cse15 .cse16 1))) (and (or (and (or (< .cse6 c_main_~y~0) .cse7) (or .cse8 (< .cse9 c_main_~y~0) .cse10)) (and .cse1 .cse11 (or (and .cse1 (<= c_main_~y~0 .cse12)) (and .cse3 (<= c_main_~y~0 .cse13) .cse5) .cse8 .cse7 .cse10) (or (and .cse3 (<= .cse13 c_main_~y~0) .cse5) (and .cse1 (<= .cse12 c_main_~y~0)) (and (or .cse7 (< .cse12 c_main_~y~0)) (or .cse8 (< .cse13 c_main_~y~0) .cse10))))) (<= .cse14 0) (or (not (= c_main_~y~0 .cse13)) .cse8 .cse10) (<= 0 .cse14) (or (not (= .cse12 c_main_~y~0)) .cse7) (or (and .cse1 .cse11) (and .cse3 (<= c_main_~y~0 .cse9) .cse5) (and .cse1 (<= c_main_~y~0 .cse6)) (and .cse3 (<= c_main_~y~0 (+ .cse15 3)) .cse5)))))) (not (= (mod c_main_~y~0 2) 0)) (or (and .cse3 (<= 0 .cse18) .cse5) (and (or (< 0 .cse2) .cse7) (or .cse8 (< 0 .cse4) .cse10)) (and .cse1 (<= 0 .cse19))) (= .cse14 0))))))) is different from false [2019-09-05 12:47:26,069 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse24 (div c_main_~y~0 2))) (let ((.cse13 (* 2 .cse24))) (let ((.cse8 (= .cse13 c_main_~y~0)) (.cse22 (* (- 2) .cse24)) (.cse23 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse10 (<= .cse23 c_main_~y~0)) (.cse20 (div (+ .cse22 c_main_~y~0 (- 2)) 4294967296)) (.cse2 (not .cse8)) (.cse4 (< c_main_~y~0 .cse23)) (.cse21 (div (+ .cse22 c_main_~y~0) 4294967296))) (let ((.cse5 (+ c_main_~x~0 3)) (.cse1 (+ .cse21 1)) (.cse7 (and .cse2 .cse4)) (.cse3 (+ .cse20 1)) (.cse0 (or .cse8 .cse10))) (and (or (and .cse0 (<= .cse1 0)) (and .cse2 (<= .cse3 0) .cse4) (let ((.cse15 (* 4294967296 .cse21)) (.cse14 (* 4294967296 .cse20))) (let ((.cse12 (+ .cse13 .cse14 2)) (.cse11 (+ .cse13 .cse15)) (.cse16 (and .cse0 (<= c_main_~y~0 (+ .cse13 1)))) (.cse9 (+ .cse13 .cse14 3)) (.cse6 (+ .cse13 .cse15 1)) (.cse17 (and .cse2 (<= c_main_~y~0 (+ .cse13 3)) .cse4))) (and (<= 0 .cse5) (or (and (or (< .cse6 c_main_~y~0) .cse7) (or .cse8 (< .cse9 c_main_~y~0) .cse10)) (let ((.cse18 (and .cse2 (<= .cse12 c_main_~y~0) .cse4)) (.cse19 (and .cse0 (<= .cse11 c_main_~y~0)))) (and (or (and .cse0 (<= c_main_~y~0 .cse11)) (and .cse2 (<= c_main_~y~0 .cse12) .cse4) (and .cse2 (<= c_main_~y~0 (+ .cse13 .cse14 4294967297)) .cse4) (and .cse0 (<= c_main_~y~0 (+ .cse13 .cse15 4294967295)))) (or .cse16 .cse17) (or .cse18 .cse19) (or .cse18 .cse19 (and (or .cse7 (< .cse11 c_main_~y~0)) (or .cse8 (< .cse12 c_main_~y~0) .cse10)))))) (or (not (= c_main_~y~0 .cse12)) .cse8 .cse10) (or (not (= .cse11 c_main_~y~0)) .cse7) (<= .cse5 0) (or .cse16 (and .cse2 (<= c_main_~y~0 .cse9) .cse4) (and .cse0 (<= c_main_~y~0 .cse6)) .cse17))))) (= 0 .cse5) (not (= (mod c_main_~y~0 2) 0)) (or (and .cse2 (<= 0 .cse20) .cse4) (and (or (< 0 .cse1) .cse7) (or .cse8 (< 0 .cse3) .cse10)) (and .cse0 (<= 0 .cse21))))))))) is different from false [2019-09-05 12:47:28,078 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse24 (div c_main_~y~0 2))) (let ((.cse13 (* 2 .cse24))) (let ((.cse8 (= .cse13 c_main_~y~0)) (.cse22 (* (- 2) .cse24)) (.cse23 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse10 (<= .cse23 c_main_~y~0)) (.cse20 (div (+ .cse22 c_main_~y~0 (- 2)) 4294967296)) (.cse2 (not .cse8)) (.cse4 (< c_main_~y~0 .cse23)) (.cse21 (div (+ .cse22 c_main_~y~0) 4294967296))) (let ((.cse5 (+ c_main_~x~0 3)) (.cse1 (+ .cse21 1)) (.cse7 (and .cse2 .cse4)) (.cse3 (+ .cse20 1)) (.cse0 (or .cse8 .cse10))) (and (or (and .cse0 (<= .cse1 0)) (and .cse2 (<= .cse3 0) .cse4) (let ((.cse15 (* 4294967296 .cse21)) (.cse14 (* 4294967296 .cse20))) (let ((.cse12 (+ .cse13 .cse14 2)) (.cse11 (+ .cse13 .cse15)) (.cse16 (and .cse0 (<= c_main_~y~0 (+ .cse13 1)))) (.cse9 (+ .cse13 .cse14 3)) (.cse6 (+ .cse13 .cse15 1)) (.cse17 (and .cse2 (<= c_main_~y~0 (+ .cse13 3)) .cse4))) (and (<= 0 .cse5) (or (and (or (< .cse6 c_main_~y~0) .cse7) (or .cse8 (< .cse9 c_main_~y~0) .cse10)) (let ((.cse18 (and .cse2 (<= .cse12 c_main_~y~0) .cse4)) (.cse19 (and .cse0 (<= .cse11 c_main_~y~0)))) (and (or (and .cse0 (<= c_main_~y~0 .cse11)) (and .cse2 (<= c_main_~y~0 .cse12) .cse4) (and .cse2 (<= c_main_~y~0 (+ .cse13 .cse14 4294967297)) .cse4) (and .cse0 (<= c_main_~y~0 (+ .cse13 .cse15 4294967295)))) (or .cse16 .cse17) (or .cse18 .cse19) (or .cse18 .cse19 (and (or .cse7 (< .cse11 c_main_~y~0)) (or .cse8 (< .cse12 c_main_~y~0) .cse10)))))) (or (not (= c_main_~y~0 .cse12)) .cse8 .cse10) (or (not (= .cse11 c_main_~y~0)) .cse7) (<= .cse5 0) (or .cse16 (and .cse2 (<= c_main_~y~0 .cse9) .cse4) (and .cse0 (<= c_main_~y~0 .cse6)) .cse17))))) (= 0 .cse5) (not (= (mod c_main_~y~0 2) 0)) (or (and .cse2 (<= 0 .cse20) .cse4) (and (or (< 0 .cse1) .cse7) (or .cse8 (< 0 .cse3) .cse10)) (and .cse0 (<= 0 .cse21))))))))) is different from true [2019-09-05 12:47:30,108 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse23 (div c_main_~y~0 2))) (let ((.cse12 (* 2 .cse23))) (let ((.cse7 (= .cse12 c_main_~y~0)) (.cse21 (* (- 2) .cse23)) (.cse22 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse9 (<= .cse22 c_main_~y~0)) (.cse19 (div (+ .cse21 c_main_~y~0 (- 2)) 4294967296)) (.cse2 (not .cse7)) (.cse4 (< c_main_~y~0 .cse22)) (.cse20 (div (+ .cse21 c_main_~y~0) 4294967296))) (let ((.cse1 (+ .cse20 1)) (.cse6 (and .cse2 .cse4)) (.cse3 (+ .cse19 1)) (.cse0 (or .cse7 .cse9))) (and (or (and .cse0 (<= .cse1 0)) (and .cse2 (<= .cse3 0) .cse4) (let ((.cse14 (* 4294967296 .cse20)) (.cse13 (* 4294967296 .cse19))) (let ((.cse11 (+ .cse12 .cse13 2)) (.cse10 (+ .cse12 .cse14)) (.cse15 (and .cse0 (<= c_main_~y~0 (+ .cse12 1)))) (.cse8 (+ .cse12 .cse13 3)) (.cse5 (+ .cse12 .cse14 1)) (.cse16 (and .cse2 (<= c_main_~y~0 (+ .cse12 3)) .cse4))) (and (or (and (or (< .cse5 c_main_~y~0) .cse6) (or .cse7 (< .cse8 c_main_~y~0) .cse9)) (let ((.cse17 (and .cse2 (<= .cse11 c_main_~y~0) .cse4)) (.cse18 (and .cse0 (<= .cse10 c_main_~y~0)))) (and (or (and .cse0 (<= c_main_~y~0 .cse10)) (and .cse2 (<= c_main_~y~0 .cse11) .cse4) (and .cse2 (<= c_main_~y~0 (+ .cse12 .cse13 4294967297)) .cse4) (and .cse0 (<= c_main_~y~0 (+ .cse12 .cse14 4294967295)))) (or .cse15 .cse16) (or .cse17 .cse18) (or .cse17 .cse18 (and (or .cse6 (< .cse10 c_main_~y~0)) (or .cse7 (< .cse11 c_main_~y~0) .cse9)))))) (<= c_main_~x~0 1) (or (not (= c_main_~y~0 .cse11)) .cse7 .cse9) (<= 1 c_main_~x~0) (or (not (= .cse10 c_main_~y~0)) .cse6) (or .cse15 (and .cse2 (<= c_main_~y~0 .cse8) .cse4) (and .cse0 (<= c_main_~y~0 .cse5)) .cse16))))) (= c_main_~x~0 1) (not (= (mod c_main_~y~0 2) 0)) (or (and .cse2 (<= 0 .cse19) .cse4) (and (or (< 0 .cse1) .cse6) (or .cse7 (< 0 .cse3) .cse9)) (and .cse0 (<= 0 .cse20))))))))) is different from false [2019-09-05 12:47:42,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:47:42,350 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-09-05 12:47:42,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-05 12:47:42,350 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 21 [2019-09-05 12:47:42,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:47:42,351 INFO L225 Difference]: With dead ends: 46 [2019-09-05 12:47:42,351 INFO L226 Difference]: Without dead ends: 33 [2019-09-05 12:47:42,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 34 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 59.1s TimeCoverageRelationStatistics Valid=61, Invalid=178, Unknown=15, NotChecked=396, Total=650 [2019-09-05 12:47:42,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-05 12:47:42,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-05 12:47:42,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-05 12:47:42,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-09-05 12:47:42,357 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 21 [2019-09-05 12:47:42,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:47:42,358 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-09-05 12:47:42,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-05 12:47:42,358 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-09-05 12:47:42,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-05 12:47:42,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:47:42,362 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:47:42,362 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:47:42,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:47:42,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1061692130, now seen corresponding path program 2 times [2019-09-05 12:47:42,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:47:42,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:42,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:47:42,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:42,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:47:42,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:47:42,724 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:42,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:42,725 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:47:42,725 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:47:42,726 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:47:42,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:42,726 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:47:42,743 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:47:42,744 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:47:42,766 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-05 12:47:42,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:47:42,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-05 12:47:42,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:47:42,848 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:42,848 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:47:46,870 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:46,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:47:46,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-09-05 12:47:46,873 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:47:46,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-05 12:47:46,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-05 12:47:46,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=1410, Unknown=0, NotChecked=0, Total=1980 [2019-09-05 12:47:46,877 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 24 states. [2019-09-05 12:47:47,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:47:47,394 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-09-05 12:47:47,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-05 12:47:47,397 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 32 [2019-09-05 12:47:47,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:47:47,398 INFO L225 Difference]: With dead ends: 45 [2019-09-05 12:47:47,398 INFO L226 Difference]: Without dead ends: 45 [2019-09-05 12:47:47,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=570, Invalid=1410, Unknown=0, NotChecked=0, Total=1980 [2019-09-05 12:47:47,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-05 12:47:47,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-09-05 12:47:47,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-05 12:47:47,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-09-05 12:47:47,403 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 32 [2019-09-05 12:47:47,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:47:47,403 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-09-05 12:47:47,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-05 12:47:47,403 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-09-05 12:47:47,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-05 12:47:47,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:47:47,405 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:47:47,405 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:47:47,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:47:47,405 INFO L82 PathProgramCache]: Analyzing trace with hash 263609359, now seen corresponding path program 3 times [2019-09-05 12:47:47,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:47:47,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:47,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:47:47,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:47,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:47:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:47:48,108 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:48,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:48,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:47:48,109 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:47:48,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:47:48,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:48,109 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) [2019-09-05 12:47:48,128 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:47:48,128 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:47:48,157 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:47:48,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:47:48,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-05 12:47:48,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:47:48,235 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:48,236 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:47:52,513 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:52,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:47:52,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-09-05 12:47:52,516 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:47:52,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-05 12:47:52,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-05 12:47:52,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1073, Invalid=3087, Unknown=0, NotChecked=0, Total=4160 [2019-09-05 12:47:52,520 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 34 states. [2019-09-05 12:47:53,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:47:53,561 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-09-05 12:47:53,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-05 12:47:53,562 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 43 [2019-09-05 12:47:53,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:47:53,563 INFO L225 Difference]: With dead ends: 56 [2019-09-05 12:47:53,563 INFO L226 Difference]: Without dead ends: 56 [2019-09-05 12:47:53,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1073, Invalid=3087, Unknown=0, NotChecked=0, Total=4160 [2019-09-05 12:47:53,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-05 12:47:53,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-09-05 12:47:53,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-05 12:47:53,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-09-05 12:47:53,569 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 43 [2019-09-05 12:47:53,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:47:53,569 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-09-05 12:47:53,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-05 12:47:53,569 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-09-05 12:47:53,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-05 12:47:53,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:47:53,571 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:47:53,571 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:47:53,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:47:53,571 INFO L82 PathProgramCache]: Analyzing trace with hash 915707074, now seen corresponding path program 4 times [2019-09-05 12:47:53,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:47:53,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:53,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:47:53,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:53,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:47:53,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:47:54,725 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:54,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:54,726 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:47:54,726 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:47:54,727 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:47:54,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:54,727 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:47:54,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:47:54,757 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:47:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:47:54,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-05 12:47:54,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:47:54,936 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:54,937 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:47:58,983 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:58,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:47:58,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-09-05 12:47:58,986 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:47:58,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-05 12:47:58,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-05 12:47:58,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1403, Invalid=5737, Unknown=0, NotChecked=0, Total=7140 [2019-09-05 12:47:58,990 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 44 states. [2019-09-05 12:48:00,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:48:00,631 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-09-05 12:48:00,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-05 12:48:00,633 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 54 [2019-09-05 12:48:00,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:48:00,634 INFO L225 Difference]: With dead ends: 67 [2019-09-05 12:48:00,634 INFO L226 Difference]: Without dead ends: 67 [2019-09-05 12:48:00,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1403, Invalid=5737, Unknown=0, NotChecked=0, Total=7140 [2019-09-05 12:48:00,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-05 12:48:00,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-09-05 12:48:00,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-05 12:48:00,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-09-05 12:48:00,646 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 54 [2019-09-05 12:48:00,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:48:00,646 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-09-05 12:48:00,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-05 12:48:00,646 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-09-05 12:48:00,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-05 12:48:00,649 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:48:00,649 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:48:00,650 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:48:00,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:48:00,656 INFO L82 PathProgramCache]: Analyzing trace with hash -161874385, now seen corresponding path program 5 times [2019-09-05 12:48:00,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:48:00,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:48:00,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:48:00,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:48:00,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:48:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:48:02,975 WARN L188 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 45 DAG size of output: 19 [2019-09-05 12:48:05,213 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 46 DAG size of output: 19 [2019-09-05 12:48:09,400 WARN L188 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-05 12:48:13,490 WARN L188 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-05 12:48:15,570 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-05 12:48:19,763 WARN L188 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-05 12:48:21,959 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse9 (div c_main_~y~0 2))) (let ((.cse1 (* 2 .cse9))) (let ((.cse7 (* (- 2) .cse9)) (.cse8 (= .cse1 c_main_~y~0)) (.cse6 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse0 (or .cse8 (<= .cse6 c_main_~y~0))) (.cse2 (* 4294967296 (div (+ .cse7 c_main_~y~0) 4294967296))) (.cse3 (not .cse8)) (.cse4 (* 4294967296 (div (+ .cse7 c_main_~y~0 (- 2)) 4294967296))) (.cse5 (< c_main_~y~0 .cse6))) (and (<= 30 c_main_~x~0) (or (and .cse0 (<= (+ .cse1 c_main_~x~0 .cse2) (+ c_main_~y~0 30))) (and .cse3 (<= (+ .cse1 c_main_~x~0 .cse4) (+ c_main_~y~0 28)) .cse5)) (or (and .cse0 (<= c_main_~y~0 (+ .cse1 .cse2))) (and .cse3 (<= c_main_~y~0 (+ .cse1 .cse4 2)) .cse5))))))) is different from true [2019-09-05 12:48:24,588 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-05 12:48:26,710 WARN L188 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-05 12:48:30,840 WARN L188 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-05 12:48:35,531 WARN L188 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-05 12:48:37,677 WARN L188 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-05 12:48:42,135 WARN L188 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-05 12:48:46,300 WARN L188 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-05 12:48:48,466 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse9 (div c_main_~y~0 2))) (let ((.cse1 (* 2 .cse9))) (let ((.cse7 (* (- 2) .cse9)) (.cse8 (= .cse1 c_main_~y~0)) (.cse6 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse4 (or .cse8 (<= .cse6 c_main_~y~0))) (.cse5 (* 4294967296 (div (+ .cse7 c_main_~y~0) 4294967296))) (.cse0 (not .cse8)) (.cse2 (* 4294967296 (div (+ .cse7 c_main_~y~0 (- 2)) 4294967296))) (.cse3 (< c_main_~y~0 .cse6))) (and (or (and .cse0 (<= (+ .cse1 c_main_~x~0 .cse2) (+ c_main_~y~0 68)) .cse3) (and .cse4 (<= (+ .cse1 c_main_~x~0 .cse5) (+ c_main_~y~0 70)))) (<= 70 c_main_~x~0) (or (and .cse4 (<= c_main_~y~0 (+ .cse1 .cse5))) (and .cse0 (<= c_main_~y~0 (+ .cse1 .cse2 2)) .cse3))))))) is different from true [2019-09-05 12:48:52,817 WARN L188 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-05 12:48:54,988 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-05 12:48:57,001 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse9 (div c_main_~y~0 2))) (let ((.cse1 (* 2 .cse9))) (let ((.cse7 (* (- 2) .cse9)) (.cse8 (= .cse1 c_main_~y~0)) (.cse6 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse0 (or .cse8 (<= .cse6 c_main_~y~0))) (.cse2 (* 4294967296 (div (+ .cse7 c_main_~y~0) 4294967296))) (.cse3 (not .cse8)) (.cse5 (* 4294967296 (div (+ .cse7 c_main_~y~0 (- 2)) 4294967296))) (.cse4 (< c_main_~y~0 .cse6))) (and (or (and .cse0 (<= (+ .cse1 c_main_~x~0 .cse2) (+ c_main_~y~0 78))) (and .cse3 .cse4 (<= (+ .cse1 c_main_~x~0 .cse5) (+ c_main_~y~0 76)))) (or (and .cse0 (<= c_main_~y~0 (+ .cse1 .cse2))) (and .cse3 (<= c_main_~y~0 (+ .cse1 .cse5 2)) .cse4)) (<= 78 c_main_~x~0)))))) is different from true [2019-09-05 12:49:01,381 WARN L188 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-05 12:49:04,906 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (div c_main_~x~0 2))) (and (let ((.cse6 (* 2 .cse2)) (.cse31 (* 4294967296 (div c_main_~x~0 4294967296)))) (let ((.cse30 (* (- 2) .cse2)) (.cse13 (<= .cse31 c_main_~x~0)) (.cse16 (= c_main_~x~0 .cse6))) (let ((.cse0 (or .cse13 .cse16)) (.cse1 (div (+ c_main_~x~0 .cse30) 4294967296)) (.cse23 (not .cse16)) (.cse24 (< c_main_~x~0 .cse31)) (.cse27 (div (+ c_main_~x~0 .cse30 (- 2)) 4294967296))) (or (and .cse0 (<= (+ .cse1 1) 0)) (<= .cse2 49) (let ((.cse29 (div c_main_~y~0 2))) (let ((.cse8 (* 2 .cse29)) (.cse26 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse28 (* (- 2) .cse29))) (let ((.cse25 (* 4294967296 (div (+ .cse28 c_main_~y~0) 4294967296))) (.cse7 (* 4294967296 .cse1)) (.cse12 (<= .cse26 c_main_~y~0)) (.cse11 (= .cse8 c_main_~y~0)) (.cse9 (* 4294967296 (div (+ .cse28 c_main_~y~0 (- 2)) 4294967296))) (.cse14 (* 4294967296 .cse27))) (let ((.cse21 (+ c_main_~y~0 .cse14 .cse6)) (.cse15 (+ .cse8 c_main_~x~0 .cse9)) (.cse22 (+ c_main_~y~0 .cse14 .cse6 2)) (.cse17 (not .cse11)) (.cse18 (< c_main_~y~0 .cse26)) (.cse20 (+ .cse8 c_main_~x~0 .cse9 2)) (.cse19 (or .cse11 .cse12)) (.cse10 (+ c_main_~y~0 .cse6 .cse7)) (.cse5 (+ .cse8 c_main_~x~0 .cse25))) (and (let ((.cse3 (and .cse23 .cse24)) (.cse4 (and .cse17 .cse18))) (or (and (or .cse3 (and (or .cse4 (< .cse5 (+ c_main_~y~0 .cse6 .cse7 1))) (or (< (+ .cse8 c_main_~x~0 .cse9 1) .cse10) .cse11 .cse12))) (or .cse13 (and (or (< .cse5 (+ c_main_~y~0 .cse14 .cse6 3)) .cse4) (or (< .cse15 (+ c_main_~y~0 .cse14 .cse6 1)) .cse11 .cse12)) .cse16)) (and .cse17 .cse18 (<= .cse15 (+ c_main_~y~0 98))) (and .cse19 (<= .cse5 (+ c_main_~y~0 100))) (and (or .cse3 (and (or (< .cse5 .cse10) .cse4) (or .cse11 .cse12 (< .cse20 .cse10)))) (or .cse13 (and (or (< .cse15 .cse21) .cse11 .cse12) (or .cse4 (< .cse5 .cse22))) .cse16)))) (or (and .cse19 (<= c_main_~y~0 (+ .cse8 .cse25))) (and .cse17 (<= c_main_~y~0 (+ .cse8 .cse9 2)) .cse18) (and .cse23 (or (and .cse17 (<= .cse21 .cse15) .cse18) (and .cse19 (<= .cse22 .cse5))) .cse24) (and .cse0 (or (and .cse17 .cse18 (<= .cse10 .cse20)) (and .cse19 (<= .cse10 .cse5)))))))))) (and .cse23 .cse24 (<= (+ .cse27 1) 0)))))) (or (< 49 .cse2) (<= 100 c_main_~x~0)))) is different from false [2019-09-05 12:49:45,557 WARN L188 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 130 DAG size of output: 27 [2019-09-05 12:49:45,718 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2019-09-05 12:49:45,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:49:45,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:49:45,719 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:49:45,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:49:45,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:49:45,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:49:45,731 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:49:45,732 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 12:49:45,820 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-05 12:49:45,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:49:45,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 109 conjunts are in the unsatisfiable core [2019-09-05 12:49:45,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:49:49,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:49:49,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:49:49,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:49:49,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:49:49,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:49:49,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:49:49,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:49:49,500 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:49:49,500 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:49:49,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:49:49,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:49:50,055 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-09-05 12:49:50,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:49:50,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55, 6] total 101 [2019-09-05 12:49:50,074 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:49:50,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-09-05 12:49:50,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-09-05 12:49:50,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=8931, Unknown=22, NotChecked=772, Total=10100 [2019-09-05 12:49:50,078 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 99 states. [2019-09-05 12:49:58,478 WARN L188 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 42 DAG size of output: 19 [2019-09-05 12:50:01,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:50:01,993 INFO L93 Difference]: Finished difference Result 64 states and 63 transitions. [2019-09-05 12:50:01,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-05 12:50:01,993 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 65 [2019-09-05 12:50:01,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:50:01,994 INFO L225 Difference]: With dead ends: 64 [2019-09-05 12:50:01,994 INFO L226 Difference]: Without dead ends: 0 [2019-09-05 12:50:01,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 929 ImplicationChecksByTransitivity, 117.9s TimeCoverageRelationStatistics Valid=396, Invalid=9696, Unknown=24, NotChecked=804, Total=10920 [2019-09-05 12:50:01,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-05 12:50:01,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-05 12:50:01,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-05 12:50:01,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-05 12:50:01,999 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2019-09-05 12:50:01,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:50:01,999 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-05 12:50:01,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-09-05 12:50:01,999 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-05 12:50:01,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-05 12:50:02,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.09 12:50:02 BoogieIcfgContainer [2019-09-05 12:50:02,003 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-05 12:50:02,005 INFO L168 Benchmark]: Toolchain (without parser) took 214897.38 ms. Allocated memory was 131.6 MB in the beginning and 388.5 MB in the end (delta: 256.9 MB). Free memory was 87.7 MB in the beginning and 301.3 MB in the end (delta: -213.6 MB). Peak memory consumption was 43.3 MB. Max. memory is 7.1 GB. [2019-09-05 12:50:02,006 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 131.6 MB. Free memory was 105.9 MB in the beginning and 105.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-05 12:50:02,006 INFO L168 Benchmark]: CACSL2BoogieTranslator took 274.94 ms. Allocated memory is still 131.6 MB. Free memory was 87.3 MB in the beginning and 77.5 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2019-09-05 12:50:02,007 INFO L168 Benchmark]: Boogie Preprocessor took 141.37 ms. Allocated memory was 131.6 MB in the beginning and 199.8 MB in the end (delta: 68.2 MB). Free memory was 77.5 MB in the beginning and 175.5 MB in the end (delta: -98.0 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. [2019-09-05 12:50:02,008 INFO L168 Benchmark]: RCFGBuilder took 296.61 ms. Allocated memory is still 199.8 MB. Free memory was 175.5 MB in the beginning and 160.4 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. [2019-09-05 12:50:02,009 INFO L168 Benchmark]: TraceAbstraction took 214180.33 ms. Allocated memory was 199.8 MB in the beginning and 388.5 MB in the end (delta: 188.7 MB). Free memory was 159.7 MB in the beginning and 301.3 MB in the end (delta: -141.5 MB). Peak memory consumption was 47.2 MB. Max. memory is 7.1 GB. [2019-09-05 12:50:02,012 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 131.6 MB. Free memory was 105.9 MB in the beginning and 105.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 274.94 ms. Allocated memory is still 131.6 MB. Free memory was 87.3 MB in the beginning and 77.5 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 141.37 ms. Allocated memory was 131.6 MB in the beginning and 199.8 MB in the end (delta: 68.2 MB). Free memory was 77.5 MB in the beginning and 175.5 MB in the end (delta: -98.0 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 296.61 ms. Allocated memory is still 199.8 MB. Free memory was 175.5 MB in the beginning and 160.4 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 214180.33 ms. Allocated memory was 199.8 MB in the beginning and 388.5 MB in the end (delta: 188.7 MB). Free memory was 159.7 MB in the beginning and 301.3 MB in the end (delta: -141.5 MB). Peak memory consumption was 47.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. SAFE Result, 214.1s OverallTime, 15 OverallIterations, 5 TraceHistogramMax, 40.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 328 SDtfs, 33 SDslu, 1167 SDs, 0 SdLazy, 7137 SolverSat, 127 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 694 GetRequests, 328 SyntacticMatches, 19 SemanticMatches, 347 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 2203 ImplicationChecksByTransitivity, 203.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.3s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 8 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 171.4s InterpolantComputationTime, 639 NumberOfCodeBlocks, 639 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 848 ConstructedInterpolants, 48 QuantifiedInterpolants, 635998 SizeOfPredicates, 10 NumberOfNonLiveVariables, 790 ConjunctsInSsa, 350 ConjunctsInUnsatCore, 27 InterpolantComputations, 9 PerfectInterpolantSequences, 81/715 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...