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-c6af20d [2019-09-03 20:37:16,248 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:37:16,251 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:37:16,268 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:37:16,269 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:37:16,270 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:37:16,273 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:37:16,285 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:37:16,286 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:37:16,289 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:37:16,291 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:37:16,293 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:37:16,293 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:37:16,294 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:37:16,297 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:37:16,299 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:37:16,300 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:37:16,301 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:37:16,304 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:37:16,309 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:37:16,312 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:37:16,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:37:16,318 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:37:16,319 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:37:16,321 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:37:16,321 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:37:16,321 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:37:16,335 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:37:16,336 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:37:16,337 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:37:16,337 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:37:16,338 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:37:16,338 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:37:16,339 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:37:16,340 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:37:16,340 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:37:16,341 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:37:16,341 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:37:16,341 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:37:16,342 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:37:16,343 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:37:16,343 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-03 20:37:16,359 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:37:16,359 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:37:16,360 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 20:37:16,360 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 20:37:16,361 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 20:37:16,361 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 20:37:16,361 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 20:37:16,361 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 20:37:16,362 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 20:37:16,362 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 20:37:16,363 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:37:16,363 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:37:16,363 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:37:16,363 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:37:16,363 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:37:16,364 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:37:16,364 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:37:16,364 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:37:16,364 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:37:16,364 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:37:16,365 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:37:16,365 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 20:37:16,365 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:37:16,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:37:16,366 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:37:16,366 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:37:16,366 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 20:37:16,366 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:37:16,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:37:16,367 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 20:37:16,396 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:37:16,409 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:37:16,412 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:37:16,414 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:37:16,414 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:37:16,415 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-03 20:37:16,477 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5eee9ca87/4ad354790e784bab99b6a1ab98f4f1a8/FLAGf77c5021e [2019-09-03 20:37:16,924 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:37:16,925 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_2-2.c [2019-09-03 20:37:16,932 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5eee9ca87/4ad354790e784bab99b6a1ab98f4f1a8/FLAGf77c5021e [2019-09-03 20:37:17,321 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5eee9ca87/4ad354790e784bab99b6a1ab98f4f1a8 [2019-09-03 20:37:17,330 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:37:17,331 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:37:17,332 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:37:17,332 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:37:17,336 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:37:17,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:37:17" (1/1) ... [2019-09-03 20:37:17,339 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5811e807 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:17, skipping insertion in model container [2019-09-03 20:37:17,340 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:37:17" (1/1) ... [2019-09-03 20:37:17,346 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:37:17,364 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:37:17,573 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:37:17,578 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:37:17,603 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:37:17,617 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:37:17,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:17 WrapperNode [2019-09-03 20:37:17,617 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:37:17,618 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:37:17,618 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:37:17,618 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:37:17,711 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:17" (1/1) ... [2019-09-03 20:37:17,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:17" (1/1) ... [2019-09-03 20:37:17,716 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:17" (1/1) ... [2019-09-03 20:37:17,717 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:17" (1/1) ... [2019-09-03 20:37:17,722 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:17" (1/1) ... [2019-09-03 20:37:17,728 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:17" (1/1) ... [2019-09-03 20:37:17,729 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:17" (1/1) ... [2019-09-03 20:37:17,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:37:17,732 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:37:17,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:37:17,732 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:37:17,733 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:37:17,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:37:17,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:37:17,798 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 20:37:17,798 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:37:17,798 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:37:17,798 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-03 20:37:17,798 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:37:17,799 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:37:17,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:37:17,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:37:18,104 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:37:18,105 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 20:37:18,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:37:18 BoogieIcfgContainer [2019-09-03 20:37:18,107 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:37:18,107 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:37:18,108 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:37:18,111 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:37:18,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:37:17" (1/3) ... [2019-09-03 20:37:18,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dbd7652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:37:18, skipping insertion in model container [2019-09-03 20:37:18,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:17" (2/3) ... [2019-09-03 20:37:18,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dbd7652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:37:18, skipping insertion in model container [2019-09-03 20:37:18,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:37:18" (3/3) ... [2019-09-03 20:37:18,124 INFO L109 eAbstractionObserver]: Analyzing ICFG diamond_2-2.c [2019-09-03 20:37:18,134 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:37:18,144 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:37:18,173 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:37:18,201 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:37:18,201 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 20:37:18,201 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:37:18,201 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:37:18,201 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:37:18,202 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:37:18,202 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:37:18,202 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:37:18,215 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-09-03 20:37:18,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:37:18,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:18,225 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:18,227 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:18,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:18,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1906239810, now seen corresponding path program 1 times [2019-09-03 20:37:18,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:18,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:18,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:18,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:18,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:18,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:18,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:37:18,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 20:37:18,338 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:37:18,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 20:37:18,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 20:37:18,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:37:18,357 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-09-03 20:37:18,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:18,375 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2019-09-03 20:37:18,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 20:37:18,376 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-03 20:37:18,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:18,386 INFO L225 Difference]: With dead ends: 27 [2019-09-03 20:37:18,386 INFO L226 Difference]: Without dead ends: 21 [2019-09-03 20:37:18,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:37:18,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-03 20:37:18,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-03 20:37:18,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-03 20:37:18,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2019-09-03 20:37:18,426 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 10 [2019-09-03 20:37:18,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:18,426 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 31 transitions. [2019-09-03 20:37:18,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 20:37:18,427 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2019-09-03 20:37:18,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:37:18,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:18,428 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:18,428 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:18,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:18,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1847134466, now seen corresponding path program 1 times [2019-09-03 20:37:18,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:18,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:18,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:18,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:18,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:18,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:18,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:37:18,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:37:18,544 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:37:18,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:37:18,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:37:18,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:37:18,547 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. Second operand 3 states. [2019-09-03 20:37:18,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:18,646 INFO L93 Difference]: Finished difference Result 23 states and 34 transitions. [2019-09-03 20:37:18,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:37:18,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-03 20:37:18,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:18,650 INFO L225 Difference]: With dead ends: 23 [2019-09-03 20:37:18,650 INFO L226 Difference]: Without dead ends: 23 [2019-09-03 20:37:18,651 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-03 20:37:18,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-03 20:37:18,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-09-03 20:37:18,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-03 20:37:18,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2019-09-03 20:37:18,658 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 10 [2019-09-03 20:37:18,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:18,658 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2019-09-03 20:37:18,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:37:18,658 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2019-09-03 20:37:18,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 20:37:18,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:18,660 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-03 20:37:18,660 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:18,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:18,660 INFO L82 PathProgramCache]: Analyzing trace with hash -129940435, now seen corresponding path program 1 times [2019-09-03 20:37:18,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:18,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:18,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:18,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:18,663 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:18,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:18,806 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-03 20:37:18,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:37:18,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:37:18,807 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:37:18,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:37:18,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:37:18,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:37:18,808 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 3 states. [2019-09-03 20:37:18,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:18,933 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2019-09-03 20:37:18,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:37:18,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-03 20:37:18,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:18,936 INFO L225 Difference]: With dead ends: 34 [2019-09-03 20:37:18,936 INFO L226 Difference]: Without dead ends: 34 [2019-09-03 20:37:18,936 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-03 20:37:18,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-03 20:37:18,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-09-03 20:37:18,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-03 20:37:18,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2019-09-03 20:37:18,943 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 21 [2019-09-03 20:37:18,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:18,944 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-09-03 20:37:18,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:37:18,944 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2019-09-03 20:37:18,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 20:37:18,945 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:18,945 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-03 20:37:18,946 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:18,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:18,946 INFO L82 PathProgramCache]: Analyzing trace with hash 263086575, now seen corresponding path program 1 times [2019-09-03 20:37:18,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:18,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:18,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:18,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:18,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:19,287 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-03 20:37:19,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:19,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:19,289 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2019-09-03 20:37:19,291 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-03 20:37:19,338 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:37:19,339 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:37:19,406 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-03 20:37:20,153 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:37:20,156 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-03 20:37:20,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:20,166 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:37:20,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:20,166 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) [2019-09-03 20:37:20,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:20,199 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:20,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 20:37:20,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:20,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-03 20:37:20,340 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:21,851 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-03 20:37:21,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:21,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-09-03 20:37:21,856 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:21,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 20:37:21,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 20:37:21,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-09-03 20:37:21,859 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 14 states. [2019-09-03 20:37:22,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:22,098 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2019-09-03 20:37:22,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 20:37:22,099 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2019-09-03 20:37:22,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:22,100 INFO L225 Difference]: With dead ends: 46 [2019-09-03 20:37:22,100 INFO L226 Difference]: Without dead ends: 46 [2019-09-03 20:37:22,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-09-03 20:37:22,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-03 20:37:22,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2019-09-03 20:37:22,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-03 20:37:22,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2019-09-03 20:37:22,107 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 21 [2019-09-03 20:37:22,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:22,107 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2019-09-03 20:37:22,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 20:37:22,108 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2019-09-03 20:37:22,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 20:37:22,109 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:22,109 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-03 20:37:22,109 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:22,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:22,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1016777103, now seen corresponding path program 1 times [2019-09-03 20:37:22,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:22,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:22,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:22,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:22,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:24,157 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-03 20:37:24,161 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-03 20:37:24,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:37:24,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:37:24,162 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:37:24,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:37:24,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:37:24,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-09-03 20:37:24,163 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 3 states. [2019-09-03 20:37:24,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:24,166 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2019-09-03 20:37:24,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:37:24,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-03 20:37:24,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:24,170 INFO L225 Difference]: With dead ends: 44 [2019-09-03 20:37:24,170 INFO L226 Difference]: Without dead ends: 44 [2019-09-03 20:37:24,171 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-03 20:37:24,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-03 20:37:24,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-03 20:37:24,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-03 20:37:24,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2019-09-03 20:37:24,180 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 21 [2019-09-03 20:37:24,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:24,181 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2019-09-03 20:37:24,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:37:24,181 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2019-09-03 20:37:24,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 20:37:24,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:24,182 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-03 20:37:24,183 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:24,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:24,183 INFO L82 PathProgramCache]: Analyzing trace with hash -2027894353, now seen corresponding path program 1 times [2019-09-03 20:37:24,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:24,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:24,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:24,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:24,185 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:26,227 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-03 20:37:26,232 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-03 20:37:26,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:37:26,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:37:26,233 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:37:26,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:37:26,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:37:26,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-09-03 20:37:26,234 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand 3 states. [2019-09-03 20:37:26,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:26,237 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2019-09-03 20:37:26,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:37:26,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-03 20:37:26,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:26,238 INFO L225 Difference]: With dead ends: 44 [2019-09-03 20:37:26,238 INFO L226 Difference]: Without dead ends: 44 [2019-09-03 20:37:26,238 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-03 20:37:26,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-03 20:37:26,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-03 20:37:26,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-03 20:37:26,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2019-09-03 20:37:26,243 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 21 [2019-09-03 20:37:26,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:26,244 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2019-09-03 20:37:26,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:37:26,244 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2019-09-03 20:37:26,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 20:37:26,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:26,245 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-03 20:37:26,245 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:26,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:26,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1680266929, now seen corresponding path program 1 times [2019-09-03 20:37:26,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:26,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:26,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:26,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:26,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:26,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:28,292 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-03 20:37:28,296 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-03 20:37:28,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:37:28,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:37:28,297 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:37:28,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:37:28,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:37:28,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-09-03 20:37:28,298 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand 3 states. [2019-09-03 20:37:28,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:28,300 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2019-09-03 20:37:28,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:37:28,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-03 20:37:28,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:28,301 INFO L225 Difference]: With dead ends: 44 [2019-09-03 20:37:28,301 INFO L226 Difference]: Without dead ends: 44 [2019-09-03 20:37:28,302 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-03 20:37:28,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-03 20:37:28,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-03 20:37:28,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-03 20:37:28,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2019-09-03 20:37:28,308 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 21 [2019-09-03 20:37:28,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:28,308 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2019-09-03 20:37:28,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:37:28,308 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2019-09-03 20:37:28,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 20:37:28,309 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:28,309 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-03 20:37:28,310 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:28,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:28,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1938432367, now seen corresponding path program 1 times [2019-09-03 20:37:28,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:28,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:28,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:28,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:28,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:28,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:30,353 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-03 20:37:30,359 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-03 20:37:30,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:37:30,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:37:30,359 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:37:30,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:37:30,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:37:30,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-09-03 20:37:30,361 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 3 states. [2019-09-03 20:37:30,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:30,363 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2019-09-03 20:37:30,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:37:30,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-03 20:37:30,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:30,364 INFO L225 Difference]: With dead ends: 44 [2019-09-03 20:37:30,364 INFO L226 Difference]: Without dead ends: 44 [2019-09-03 20:37:30,365 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-03 20:37:30,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-03 20:37:30,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-03 20:37:30,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-03 20:37:30,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2019-09-03 20:37:30,369 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 21 [2019-09-03 20:37:30,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:30,369 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2019-09-03 20:37:30,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:37:30,370 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2019-09-03 20:37:30,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 20:37:30,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:30,371 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-03 20:37:30,371 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:30,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:30,371 INFO L82 PathProgramCache]: Analyzing trace with hash -2048497361, now seen corresponding path program 1 times [2019-09-03 20:37:30,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:30,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:30,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:30,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:30,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:32,434 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-03 20:37:32,437 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-03 20:37:32,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:37:32,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:37:32,438 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:37:32,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:37:32,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:37:32,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-09-03 20:37:32,439 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 3 states. [2019-09-03 20:37:32,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:32,440 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2019-09-03 20:37:32,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:37:32,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-03 20:37:32,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:32,441 INFO L225 Difference]: With dead ends: 44 [2019-09-03 20:37:32,441 INFO L226 Difference]: Without dead ends: 44 [2019-09-03 20:37:32,442 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-03 20:37:32,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-03 20:37:32,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-03 20:37:32,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-03 20:37:32,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2019-09-03 20:37:32,449 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 21 [2019-09-03 20:37:32,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:32,449 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2019-09-03 20:37:32,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:37:32,449 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2019-09-03 20:37:32,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 20:37:32,450 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:32,450 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-03 20:37:32,450 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:32,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:32,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1368438991, now seen corresponding path program 1 times [2019-09-03 20:37:32,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:32,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:32,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:32,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:32,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:32,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:34,492 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-03 20:37:34,498 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-03 20:37:34,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:37:34,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:37:34,499 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:37:34,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:37:34,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:37:34,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-09-03 20:37:34,500 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 3 states. [2019-09-03 20:37:34,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:34,502 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2019-09-03 20:37:34,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:37:34,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-03 20:37:34,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:34,503 INFO L225 Difference]: With dead ends: 44 [2019-09-03 20:37:34,503 INFO L226 Difference]: Without dead ends: 44 [2019-09-03 20:37:34,503 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-03 20:37:34,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-03 20:37:34,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-03 20:37:34,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-03 20:37:34,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2019-09-03 20:37:34,507 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 21 [2019-09-03 20:37:34,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:34,508 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2019-09-03 20:37:34,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:37:34,508 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2019-09-03 20:37:34,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 20:37:34,509 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:34,509 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-03 20:37:34,509 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:34,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:34,510 INFO L82 PathProgramCache]: Analyzing trace with hash 2117181679, now seen corresponding path program 1 times [2019-09-03 20:37:34,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:34,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:34,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:34,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:34,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:36,569 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-03 20:37:36,574 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-03 20:37:36,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:37:36,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:37:36,575 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:37:36,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:37:36,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:37:36,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-09-03 20:37:36,576 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 3 states. [2019-09-03 20:37:36,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:36,578 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2019-09-03 20:37:36,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:37:36,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-03 20:37:36,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:36,579 INFO L225 Difference]: With dead ends: 44 [2019-09-03 20:37:36,579 INFO L226 Difference]: Without dead ends: 44 [2019-09-03 20:37:36,580 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-03 20:37:36,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-03 20:37:36,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-03 20:37:36,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-03 20:37:36,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2019-09-03 20:37:36,584 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 21 [2019-09-03 20:37:36,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:36,584 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2019-09-03 20:37:36,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:37:36,585 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2019-09-03 20:37:36,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 20:37:36,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:36,586 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-03 20:37:36,586 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:36,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:36,586 INFO L82 PathProgramCache]: Analyzing trace with hash -402778255, now seen corresponding path program 1 times [2019-09-03 20:37:36,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:36,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:36,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:36,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:36,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:36,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:38,634 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-03 20:37:38,639 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-03 20:37:38,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:37:38,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:37:38,640 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:37:38,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:37:38,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:37:38,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-09-03 20:37:38,641 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 3 states. [2019-09-03 20:37:38,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:38,644 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2019-09-03 20:37:38,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:37:38,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-03 20:37:38,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:38,645 INFO L225 Difference]: With dead ends: 44 [2019-09-03 20:37:38,645 INFO L226 Difference]: Without dead ends: 44 [2019-09-03 20:37:38,645 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-03 20:37:38,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-03 20:37:38,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-03 20:37:38,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-03 20:37:38,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-09-03 20:37:38,650 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 21 [2019-09-03 20:37:38,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:38,664 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-09-03 20:37:38,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:37:38,665 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-09-03 20:37:38,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 20:37:38,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:38,665 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-03 20:37:38,666 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:38,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:38,666 INFO L82 PathProgramCache]: Analyzing trace with hash -345519953, now seen corresponding path program 1 times [2019-09-03 20:37:38,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:38,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:38,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:38,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:38,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:38,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:40,816 WARN L838 $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 false [2019-09-03 20:37:42,855 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-03 20:37:44,886 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 (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 true [2019-09-03 20:37:46,922 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-03 20:37:48,954 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-03 20:37:50,993 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-03 20:37:53,047 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-03 20:37:55,060 WARN L860 $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 true [2019-09-03 20:37:57,076 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-03 20:37:59,086 WARN L860 $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 true [2019-09-03 20:38:01,131 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-03 20:38:03,141 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-03 20:38:05,200 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse48 (div c_main_~y~0 2))) (let ((.cse17 (* 2 .cse48))) (let ((.cse9 (= .cse17 c_main_~y~0)) (.cse46 (* (- 2) .cse48)) (.cse47 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse11 (<= .cse47 c_main_~y~0)) (.cse44 (div (+ .cse46 c_main_~y~0 (- 2)) 4294967296)) (.cse2 (not .cse9)) (.cse4 (< c_main_~y~0 .cse47)) (.cse45 (div (+ .cse46 c_main_~y~0) 4294967296))) (let ((.cse1 (+ .cse45 1)) (.cse8 (and .cse2 .cse4)) (.cse3 (+ .cse44 1)) (.cse0 (or .cse9 .cse11))) (and (or (and .cse0 (<= .cse1 0)) (and .cse2 (<= .cse3 0) .cse4) (let ((.cse43 (div c_main_~x~0 2))) (let ((.cse6 (+ c_main_~x~0 5)) (.cse5 (+ .cse43 3))) (and (or (<= .cse5 0) (<= .cse6 0)) (or (let ((.cse19 (* 4294967296 .cse45)) (.cse18 (* 4294967296 .cse44))) (let ((.cse28 (and .cse0 (<= c_main_~y~0 (+ .cse17 1)))) (.cse10 (+ .cse17 .cse18 3)) (.cse7 (+ .cse17 .cse19 1)) (.cse35 (and .cse2 (<= c_main_~y~0 (+ .cse17 3)) .cse4))) (and (<= 0 .cse6) (or (and (or (< .cse7 c_main_~y~0) .cse8) (or .cse9 (< .cse10 c_main_~y~0) .cse11)) (let ((.cse40 (* 2 .cse43)) (.cse41 (* 4294967296 (div c_main_~x~0 4294967296)))) (let ((.cse42 (* (- 2) .cse43)) (.cse15 (+ .cse17 .cse19)) (.cse16 (+ .cse17 .cse18 2)) (.cse26 (<= .cse41 c_main_~x~0)) (.cse27 (= c_main_~x~0 .cse40))) (let ((.cse24 (or .cse26 .cse27)) (.cse12 (and .cse2 .cse4 (<= .cse10 c_main_~y~0))) (.cse13 (and (or .cse8 (< .cse15 c_main_~y~0)) (or .cse9 (< .cse16 c_main_~y~0) .cse11))) (.cse14 (and .cse0 (<= .cse7 c_main_~y~0))) (.cse23 (div (+ c_main_~x~0 .cse42) 4294967296)) (.cse21 (div (+ c_main_~x~0 .cse42 (- 2)) 4294967296)) (.cse20 (not .cse27)) (.cse22 (< c_main_~x~0 .cse41))) (and (or (and (or .cse12 .cse13 .cse14) (or (and .cse0 (<= c_main_~y~0 .cse15)) (and .cse2 (<= c_main_~y~0 .cse16) .cse4) (and .cse2 (<= c_main_~y~0 (+ .cse17 .cse18 4294967297)) .cse4) (and .cse0 (<= c_main_~y~0 (+ .cse17 .cse19 4294967295))))) (and .cse20 (<= .cse21 0) .cse22) (and (<= .cse23 0) .cse24)) (let ((.cse25 (and .cse20 .cse22))) (or (and (or .cse25 (< 0 .cse23)) (or (< 0 .cse21) .cse26 .cse27)) (let ((.cse39 (* 4294967296 .cse21))) (let ((.cse36 (<= c_main_~x~0 .cse40)) (.cse34 (+ .cse17 c_main_~x~0 .cse18 2)) (.cse33 (+ c_main_~y~0 .cse40 (* 4294967296 .cse23))) (.cse30 (+ .cse17 c_main_~x~0 .cse18)) (.cse29 (+ c_main_~y~0 .cse39 .cse40)) (.cse32 (+ .cse17 c_main_~x~0 .cse19)) (.cse31 (+ c_main_~y~0 .cse39 .cse40 2))) (and (or .cse28 (and .cse20 (or (and .cse2 (<= .cse29 .cse30) .cse4) (and .cse0 (<= .cse31 .cse32))) .cse22) (and .cse24 (or (and .cse2 .cse4 (<= .cse33 .cse34)) (and .cse0 (<= .cse33 .cse32)))) .cse35 .cse36) (or (let ((.cse37 (+ .cse23 1)) (.cse38 (+ .cse21 1))) (and (or (and .cse24 (<= .cse37 0)) (and .cse20 .cse22 (<= .cse38 0)) .cse12 .cse13 .cse14) (or (and .cse2 (<= .cse16 c_main_~y~0) .cse4) (and (or .cse25 (< 0 .cse37)) (or .cse26 (< 0 .cse38) .cse27)) (and .cse0 (<= .cse15 c_main_~y~0)) .cse36))) (and (or .cse25 (and (or (< .cse32 .cse33) .cse8) (or .cse9 .cse11 (< .cse34 .cse33)))) (or .cse26 (and (or (< .cse30 .cse29) .cse9 .cse11) (or .cse8 (< .cse32 .cse31))) .cse27))))))))))))) (or .cse28 (and .cse2 (<= c_main_~y~0 .cse10) .cse4) (and .cse0 (<= c_main_~y~0 .cse7)) .cse35)))) (< 0 .cse5)))))) (or (and .cse2 (<= 0 .cse44) .cse4) (and (or (< 0 .cse1) .cse8) (or .cse9 (< 0 .cse3) .cse11)) (and .cse0 (<= 0 .cse45))))))))) is different from true [2019-09-03 20:38:17,546 WARN L188 SmtUtils]: Spent 12.32 s on a formula simplification. DAG size of input: 183 DAG size of output: 21 [2019-09-03 20:38:17,571 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-03 20:38:17,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:17,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:38:17,572 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2019-09-03 20:38:17,572 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-03 20:38:17,575 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:38:17,575 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:38:17,577 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-03 20:38:18,136 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:38:18,137 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-03 20:38:18,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:38:18,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:38:18,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:18,137 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:38:18,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:38:18,148 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:38:18,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:18,162 WARN L254 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-03 20:38:18,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:38:18,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:38:18,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:38:18,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:38:18,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:38:18,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:38:18,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:38:18,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:38:18,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:38:18,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:38:18,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:38:18,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:38:18,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:38:18,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:38:18,357 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-03 20:38:18,358 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:38:18,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 20:38:18,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:38:18,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:38:18,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:38:18,503 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-03 20:38:18,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:38:18,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 6] total 22 [2019-09-03 20:38:18,507 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:38:18,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 20:38:18,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 20:38:18,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=152, Unknown=13, NotChecked=248, Total=462 [2019-09-03 20:38:18,509 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 20 states. [2019-09-03 20:38:20,592 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-03 20:38:22,621 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-03 20:38:24,643 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-03 20:38:26,709 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-03 20:38:28,721 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-03 20:38:30,740 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-03 20:38:32,786 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)) (not (= (mod c_main_~y~0 2) 0)) (or (and .cse7 (<= 0 .cse17) .cse9) (and (or (< 0 .cse19) .cse1) (or .cse2 (< 0 .cse20) .cse4)) (and .cse5 (<= 0 .cse18))) (= c_main_~x~0 3))))))) is different from false [2019-09-03 20:38:34,797 WARN L860 $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)) (not (= (mod c_main_~y~0 2) 0)) (or (and .cse7 (<= 0 .cse17) .cse9) (and (or (< 0 .cse19) .cse1) (or .cse2 (< 0 .cse20) .cse4)) (and .cse5 (<= 0 .cse18))) (= c_main_~x~0 3))))))) is different from true [2019-09-03 20:38:36,835 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)) (.cse5 (+ c_main_~x~0 1))) (and (or (and .cse0 (<= .cse1 0)) (and .cse2 (<= .cse3 0) .cse4) (let ((.cse15 (* 4294967296 .cse19)) (.cse14 (* 4294967296 .cse18))) (let ((.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))))) (not (= (mod c_main_~y~0 2) 0)) (or (and .cse2 (<= 0 .cse18) .cse4) (and (or (< 0 .cse1) .cse7) (or .cse8 (< 0 .cse3) .cse10)) (and .cse0 (<= 0 .cse19))) (= .cse5 0))))))) is different from false [2019-09-03 20:38:36,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:38:36,943 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2019-09-03 20:38:36,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 20:38:36,943 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2019-09-03 20:38:36,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:38:36,944 INFO L225 Difference]: With dead ends: 46 [2019-09-03 20:38:36,944 INFO L226 Difference]: Without dead ends: 38 [2019-09-03 20:38:36,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 57.2s TimeCoverageRelationStatistics Valid=67, Invalid=177, Unknown=22, NotChecked=546, Total=812 [2019-09-03 20:38:36,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-03 20:38:36,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-09-03 20:38:36,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-03 20:38:36,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-09-03 20:38:36,950 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 21 [2019-09-03 20:38:36,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:38:36,951 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-09-03 20:38:36,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 20:38:36,951 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-09-03 20:38:36,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 20:38:36,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:38:36,952 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-03 20:38:36,952 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:38:36,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:38:36,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1655470351, now seen corresponding path program 1 times [2019-09-03 20:38:36,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:38:36,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:36,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:38:36,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:36,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:38:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:39,013 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-03 20:38:39,018 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-03 20:38:39,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:38:39,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:38:39,018 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:38:39,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:38:39,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:38:39,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-09-03 20:38:39,020 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 3 states. [2019-09-03 20:38:39,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:38:39,021 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-09-03 20:38:39,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:38:39,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-03 20:38:39,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:38:39,022 INFO L225 Difference]: With dead ends: 40 [2019-09-03 20:38:39,022 INFO L226 Difference]: Without dead ends: 33 [2019-09-03 20:38:39,022 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-03 20:38:39,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-03 20:38:39,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-03 20:38:39,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-03 20:38:39,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-09-03 20:38:39,025 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 21 [2019-09-03 20:38:39,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:38:39,026 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-09-03 20:38:39,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:38:39,026 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-09-03 20:38:39,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-03 20:38:39,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:38:39,027 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-03 20:38:39,027 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:38:39,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:38:39,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1061692130, now seen corresponding path program 2 times [2019-09-03 20:38:39,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:38:39,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:39,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:38:39,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:39,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:38:39,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:39,452 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-03 20:38:39,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:39,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:38:39,453 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:38:39,453 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:38:39,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:39,453 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:38:39,485 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:38:39,485 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:38:39,509 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 20:38:39,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:38:39,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-03 20:38:39,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:38:39,562 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-03 20:38:39,563 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:38:43,687 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-03 20:38:43,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:38:43,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-09-03 20:38:43,692 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:38:43,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 20:38:43,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 20:38:43,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=1410, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 20:38:43,694 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 24 states. [2019-09-03 20:38:44,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:38:44,238 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-09-03 20:38:44,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 20:38:44,239 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 32 [2019-09-03 20:38:44,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:38:44,240 INFO L225 Difference]: With dead ends: 45 [2019-09-03 20:38:44,240 INFO L226 Difference]: Without dead ends: 45 [2019-09-03 20:38:44,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=570, Invalid=1410, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 20:38:44,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-03 20:38:44,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-09-03 20:38:44,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-03 20:38:44,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-09-03 20:38:44,245 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 32 [2019-09-03 20:38:44,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:38:44,246 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-09-03 20:38:44,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 20:38:44,246 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-09-03 20:38:44,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-03 20:38:44,247 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:38:44,247 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-03 20:38:44,247 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:38:44,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:38:44,248 INFO L82 PathProgramCache]: Analyzing trace with hash 263609359, now seen corresponding path program 3 times [2019-09-03 20:38:44,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:38:44,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:44,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:38:44,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:44,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:38:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:45,059 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-03 20:38:45,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:45,059 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:38:45,059 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:38:45,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:38:45,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:45,060 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:38:45,071 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:38:45,072 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:38:45,101 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:38:45,101 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:38:45,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-03 20:38:45,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:38:45,185 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-03 20:38:45,186 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:38:49,454 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-03 20:38:49,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:38:49,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-09-03 20:38:49,457 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:38:49,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 20:38:49,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 20:38:49,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1073, Invalid=3087, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 20:38:49,460 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 34 states. [2019-09-03 20:38:50,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:38:50,569 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-09-03 20:38:50,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 20:38:50,570 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 43 [2019-09-03 20:38:50,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:38:50,570 INFO L225 Difference]: With dead ends: 56 [2019-09-03 20:38:50,570 INFO L226 Difference]: Without dead ends: 56 [2019-09-03 20:38:50,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1073, Invalid=3087, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 20:38:50,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-03 20:38:50,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-09-03 20:38:50,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-03 20:38:50,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-09-03 20:38:50,575 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 43 [2019-09-03 20:38:50,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:38:50,576 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-09-03 20:38:50,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 20:38:50,576 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-09-03 20:38:50,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-03 20:38:50,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:38:50,577 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-03 20:38:50,577 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:38:50,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:38:50,578 INFO L82 PathProgramCache]: Analyzing trace with hash 915707074, now seen corresponding path program 4 times [2019-09-03 20:38:50,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:38:50,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:50,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:38:50,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:50,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:38:50,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:51,916 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-03 20:38:51,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:51,916 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:38:51,916 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:38:51,916 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:38:51,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:51,917 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-03 20:38:51,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:38:51,940 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-03 20:38:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:51,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-03 20:38:51,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:38:52,067 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-03 20:38:52,067 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:38:56,408 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-03 20:38:56,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:38:56,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-09-03 20:38:56,413 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:38:56,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-03 20:38:56,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-03 20:38:56,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1403, Invalid=5737, Unknown=0, NotChecked=0, Total=7140 [2019-09-03 20:38:56,416 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 44 states. [2019-09-03 20:38:58,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:38:58,158 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-09-03 20:38:58,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-03 20:38:58,159 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 54 [2019-09-03 20:38:58,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:38:58,160 INFO L225 Difference]: With dead ends: 67 [2019-09-03 20:38:58,161 INFO L226 Difference]: Without dead ends: 67 [2019-09-03 20:38:58,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1403, Invalid=5737, Unknown=0, NotChecked=0, Total=7140 [2019-09-03 20:38:58,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-03 20:38:58,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-09-03 20:38:58,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-03 20:38:58,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-09-03 20:38:58,167 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 54 [2019-09-03 20:38:58,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:38:58,167 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-09-03 20:38:58,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-03 20:38:58,168 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-09-03 20:38:58,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-03 20:38:58,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:38:58,169 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-03 20:38:58,170 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:38:58,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:38:58,170 INFO L82 PathProgramCache]: Analyzing trace with hash -161874385, now seen corresponding path program 5 times [2019-09-03 20:38:58,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:38:58,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:58,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:38:58,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:58,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:38:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:39:00,426 WARN L188 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 43 DAG size of output: 18 [2019-09-03 20:39:02,504 WARN L188 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 45 DAG size of output: 19 [2019-09-03 20:39:04,832 WARN L188 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 46 DAG size of output: 19 [2019-09-03 20:39:07,266 WARN L188 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-03 20:39:09,671 WARN L188 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-03 20:39:13,797 WARN L188 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-03 20:39:16,086 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 (or (and .cse0 (<= (+ .cse1 c_main_~x~0 .cse2) (+ c_main_~y~0 38))) (and .cse3 (<= (+ .cse1 c_main_~x~0 .cse4) (+ c_main_~y~0 36)) .cse5)) (<= 38 c_main_~x~0) (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-03 20:39:20,449 WARN L188 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-03 20:39:24,771 WARN L188 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-03 20:39:29,063 WARN L188 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-03 20:39:31,222 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse9 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse9))) (let ((.cse7 (* (- 2) .cse9)) (.cse8 (= .cse0 c_main_~y~0)) (.cse6 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse2 (or .cse8 (<= .cse6 c_main_~y~0))) (.cse1 (* 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 (<= 54 c_main_~x~0) (or (and (<= (+ .cse0 c_main_~x~0 .cse1) (+ c_main_~y~0 54)) .cse2) (and .cse3 (<= (+ .cse0 c_main_~x~0 .cse4) (+ c_main_~y~0 52)) .cse5)) (or (and .cse2 (<= c_main_~y~0 (+ .cse0 .cse1))) (and .cse3 (<= c_main_~y~0 (+ .cse0 .cse4 2)) .cse5))))))) is different from true [2019-09-03 20:39:33,378 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse9 (div c_main_~y~0 2))) (let ((.cse1 (* 2 .cse9))) (let ((.cse6 (* (- 2) .cse9)) (.cse8 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse7 (= .cse1 c_main_~y~0))) (let ((.cse3 (not .cse7)) (.cse5 (< c_main_~y~0 .cse8)) (.cse4 (* 4294967296 (div (+ .cse6 c_main_~y~0 (- 2)) 4294967296))) (.cse0 (or .cse7 (<= .cse8 c_main_~y~0))) (.cse2 (* 4294967296 (div (+ .cse6 c_main_~y~0) 4294967296)))) (and (<= 58 c_main_~x~0) (or (and .cse0 (<= c_main_~y~0 (+ .cse1 .cse2))) (and .cse3 (<= c_main_~y~0 (+ .cse1 .cse4 2)) .cse5)) (or (and .cse3 .cse5 (<= (+ .cse1 c_main_~x~0 .cse4) (+ c_main_~y~0 56))) (and .cse0 (<= (+ .cse1 c_main_~x~0 .cse2) (+ c_main_~y~0 58))))))))) is different from true [2019-09-03 20:39:35,546 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 (<= 62 c_main_~x~0) (or (and .cse0 (<= c_main_~y~0 (+ .cse1 .cse2))) (and .cse3 (<= c_main_~y~0 (+ .cse1 .cse4 2)) .cse5)) (or (and .cse0 (<= (+ .cse1 c_main_~x~0 .cse2) (+ c_main_~y~0 62))) (and .cse3 (<= (+ .cse1 c_main_~x~0 .cse4) (+ c_main_~y~0 60)) .cse5))))))) is different from true [2019-09-03 20:39:39,715 WARN L188 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-03 20:39:43,892 WARN L188 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-03 20:39:46,224 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 (<= 72 c_main_~x~0) (or (and .cse0 (<= c_main_~y~0 (+ .cse1 .cse2))) (and .cse3 (<= c_main_~y~0 (+ .cse1 .cse4 2)) .cse5)) (or (and .cse0 (<= (+ .cse1 c_main_~x~0 .cse2) (+ c_main_~y~0 72))) (and .cse3 (<= (+ .cse1 c_main_~x~0 .cse4) (+ c_main_~y~0 70)) .cse5))))))) is different from true [2019-09-03 20:39:51,317 WARN L188 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-03 20:39:56,150 WARN L188 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-03 20:39:58,369 WARN L188 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-03 20:40:02,792 WARN L188 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-09-03 20:40:33,485 WARN L188 SmtUtils]: Spent 12.25 s on a formula simplification. DAG size of input: 120 DAG size of output: 27 [2019-09-03 20:41:02,140 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 94 refuted. 2 times theorem prover too weak. 0 trivial. 19 not checked. [2019-09-03 20:41:02,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:02,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:41:02,141 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:41:02,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:41:02,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:02,141 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:41:02,157 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:41:02,157 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:41:02,249 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 20:41:02,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:41:02,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 109 conjunts are in the unsatisfiable core [2019-09-03 20:41:02,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:41:05,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:41:05,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:41:05,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:41:05,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:41:05,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:41:05,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:41:05,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:41:05,859 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-03 20:41:05,859 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:41:06,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:41:06,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:41:06,470 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-03 20:41:06,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:41:06,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 6] total 100 [2019-09-03 20:41:06,475 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:41:06,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-09-03 20:41:06,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-09-03 20:41:06,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=8569, Unknown=14, NotChecked=950, Total=9900 [2019-09-03 20:41:06,481 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 98 states. [2019-09-03 20:41:12,067 WARN L188 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 42 DAG size of output: 19 [2019-09-03 20:41:17,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:41:17,282 INFO L93 Difference]: Finished difference Result 64 states and 63 transitions. [2019-09-03 20:41:17,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-03 20:41:17,283 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 65 [2019-09-03 20:41:17,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:41:17,283 INFO L225 Difference]: With dead ends: 64 [2019-09-03 20:41:17,283 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 20:41:17,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 104 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 904 ImplicationChecksByTransitivity, 134.9s TimeCoverageRelationStatistics Valid=398, Invalid=9707, Unknown=15, NotChecked=1010, Total=11130 [2019-09-03 20:41:17,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 20:41:17,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 20:41:17,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 20:41:17,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 20:41:17,287 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2019-09-03 20:41:17,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:41:17,288 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 20:41:17,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-09-03 20:41:17,288 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 20:41:17,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 20:41:17,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 08:41:17 BoogieIcfgContainer [2019-09-03 20:41:17,293 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 20:41:17,294 INFO L168 Benchmark]: Toolchain (without parser) took 239963.15 ms. Allocated memory was 133.2 MB in the beginning and 392.7 MB in the end (delta: 259.5 MB). Free memory was 89.2 MB in the beginning and 240.6 MB in the end (delta: -151.4 MB). Peak memory consumption was 108.2 MB. Max. memory is 7.1 GB. [2019-09-03 20:41:17,295 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 133.2 MB. Free memory was 107.4 MB in the beginning and 107.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-03 20:41:17,296 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.35 ms. Allocated memory is still 133.2 MB. Free memory was 89.0 MB in the beginning and 78.9 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2019-09-03 20:41:17,297 INFO L168 Benchmark]: Boogie Preprocessor took 113.52 ms. Allocated memory was 133.2 MB in the beginning and 199.8 MB in the end (delta: 66.6 MB). Free memory was 78.9 MB in the beginning and 175.7 MB in the end (delta: -96.8 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. [2019-09-03 20:41:17,298 INFO L168 Benchmark]: RCFGBuilder took 375.00 ms. Allocated memory is still 199.8 MB. Free memory was 175.7 MB in the beginning and 160.2 MB in the end (delta: 15.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 7.1 GB. [2019-09-03 20:41:17,298 INFO L168 Benchmark]: TraceAbstraction took 239185.33 ms. Allocated memory was 199.8 MB in the beginning and 392.7 MB in the end (delta: 192.9 MB). Free memory was 160.2 MB in the beginning and 240.6 MB in the end (delta: -80.4 MB). Peak memory consumption was 112.5 MB. Max. memory is 7.1 GB. [2019-09-03 20:41:17,302 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.24 ms. Allocated memory is still 133.2 MB. Free memory was 107.4 MB in the beginning and 107.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 285.35 ms. Allocated memory is still 133.2 MB. Free memory was 89.0 MB in the beginning and 78.9 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 113.52 ms. Allocated memory was 133.2 MB in the beginning and 199.8 MB in the end (delta: 66.6 MB). Free memory was 78.9 MB in the beginning and 175.7 MB in the end (delta: -96.8 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 375.00 ms. Allocated memory is still 199.8 MB. Free memory was 175.7 MB in the beginning and 160.2 MB in the end (delta: 15.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 239185.33 ms. Allocated memory was 199.8 MB in the beginning and 392.7 MB in the end (delta: 192.9 MB). Free memory was 160.2 MB in the beginning and 240.6 MB in the end (delta: -80.4 MB). Peak memory consumption was 112.5 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, 239.1s OverallTime, 18 OverallIterations, 5 TraceHistogramMax, 33.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 402 SDtfs, 28 SDslu, 1147 SDs, 0 SdLazy, 7483 SolverSat, 121 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 705 GetRequests, 334 SyntacticMatches, 17 SemanticMatches, 354 ConstructedPredicates, 28 IntricatePredicates, 0 DeprecatedPredicates, 2176 ImplicationChecksByTransitivity, 227.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.4s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 8 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 203.3s InterpolantComputationTime, 702 NumberOfCodeBlocks, 702 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 908 ConstructedInterpolants, 48 QuantifiedInterpolants, 661746 SizeOfPredicates, 10 NumberOfNonLiveVariables, 790 ConjunctsInSsa, 350 ConjunctsInUnsatCore, 30 InterpolantComputations, 12 PerfectInterpolantSequences, 84/718 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...