java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:29:15,739 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:29:15,741 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:29:15,755 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:29:15,755 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:29:15,756 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:29:15,757 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:29:15,759 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:29:15,761 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:29:15,762 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:29:15,763 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:29:15,763 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:29:15,764 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:29:15,765 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:29:15,767 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:29:15,767 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:29:15,768 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:29:15,770 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:29:15,772 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:29:15,774 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:29:15,776 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:29:15,777 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:29:15,783 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:29:15,783 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:29:15,783 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:29:15,784 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:29:15,785 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:29:15,791 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:29:15,792 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:29:15,794 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:29:15,794 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:29:15,794 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:29:15,795 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:29:15,795 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:29:15,796 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:29:15,797 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:29:15,799 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:29:15,825 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:29:15,826 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:29:15,827 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:29:15,827 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:29:15,827 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:29:15,828 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:29:15,828 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:29:15,828 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:29:15,828 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:29:15,828 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:29:15,829 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:29:15,829 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:29:15,829 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:29:15,829 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:29:15,829 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:29:15,830 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:29:15,830 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:29:15,830 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:29:15,830 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:29:15,830 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:29:15,831 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:29:15,831 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:29:15,831 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:29:15,831 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:29:15,831 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:29:15,832 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:29:15,832 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:29:15,832 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:29:15,832 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:29:15,832 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:29:15,833 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:29:15,833 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:29:15,833 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:29:15,877 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:29:15,894 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:29:15,899 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:29:15,901 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:29:15,902 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:29:15,902 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call2.i [2018-11-23 11:29:15,980 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4897b7bb0/42be6d0fb167442bb092dea50f2fbdb4/FLAG657e51699 [2018-11-23 11:29:16,444 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:29:16,444 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call2.i [2018-11-23 11:29:16,451 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4897b7bb0/42be6d0fb167442bb092dea50f2fbdb4/FLAG657e51699 [2018-11-23 11:29:16,794 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4897b7bb0/42be6d0fb167442bb092dea50f2fbdb4 [2018-11-23 11:29:16,805 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:29:16,806 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:29:16,807 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:29:16,807 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:29:16,811 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:29:16,813 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:29:16" (1/1) ... [2018-11-23 11:29:16,816 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@693145f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:16, skipping insertion in model container [2018-11-23 11:29:16,816 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:29:16" (1/1) ... [2018-11-23 11:29:16,827 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:29:16,854 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:29:17,104 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:29:17,112 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:29:17,152 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:29:17,174 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:29:17,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:17 WrapperNode [2018-11-23 11:29:17,174 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:29:17,175 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:29:17,175 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:29:17,176 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:29:17,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:17" (1/1) ... [2018-11-23 11:29:17,196 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:17" (1/1) ... [2018-11-23 11:29:17,204 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:29:17,204 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:29:17,204 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:29:17,204 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:29:17,213 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:17" (1/1) ... [2018-11-23 11:29:17,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:17" (1/1) ... [2018-11-23 11:29:17,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:17" (1/1) ... [2018-11-23 11:29:17,215 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:17" (1/1) ... [2018-11-23 11:29:17,225 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:17" (1/1) ... [2018-11-23 11:29:17,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:17" (1/1) ... [2018-11-23 11:29:17,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:17" (1/1) ... [2018-11-23 11:29:17,237 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:29:17,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:29:17,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:29:17,237 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:29:17,239 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29: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 [2018-11-23 11:29:17,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:29:17,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:29:17,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:29:17,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:29:17,376 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:29:17,376 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:29:17,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:29:17,376 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:29:17,981 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:29:17,981 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:29:17,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:29:17 BoogieIcfgContainer [2018-11-23 11:29:17,982 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:29:17,983 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:29:17,984 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:29:17,987 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:29:17,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:29:16" (1/3) ... [2018-11-23 11:29:17,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48de5dfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:29:17, skipping insertion in model container [2018-11-23 11:29:17,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:17" (2/3) ... [2018-11-23 11:29:17,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48de5dfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:29:17, skipping insertion in model container [2018-11-23 11:29:17,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:29:17" (3/3) ... [2018-11-23 11:29:17,991 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_true-unreach-call2.i [2018-11-23 11:29:18,000 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:29:18,008 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:29:18,026 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:29:18,060 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:29:18,061 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:29:18,061 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:29:18,061 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:29:18,062 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:29:18,062 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:29:18,062 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:29:18,062 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:29:18,062 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:29:18,080 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-23 11:29:18,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 11:29:18,087 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:18,088 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:18,092 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:18,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:18,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1906239810, now seen corresponding path program 1 times [2018-11-23 11:29:18,102 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:18,103 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:29:18,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:29:18,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:18,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:18,228 INFO L256 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2018-11-23 11:29:18,232 INFO L273 TraceCheckUtils]: 1: Hoare triple {30#true} assume true; {30#true} is VALID [2018-11-23 11:29:18,233 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {30#true} {30#true} #91#return; {30#true} is VALID [2018-11-23 11:29:18,234 INFO L256 TraceCheckUtils]: 3: Hoare triple {30#true} call #t~ret2 := main(); {30#true} is VALID [2018-11-23 11:29:18,234 INFO L273 TraceCheckUtils]: 4: Hoare triple {30#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {30#true} is VALID [2018-11-23 11:29:18,235 INFO L273 TraceCheckUtils]: 5: Hoare triple {30#true} assume !true; {31#false} is VALID [2018-11-23 11:29:18,235 INFO L256 TraceCheckUtils]: 6: Hoare triple {31#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {31#false} is VALID [2018-11-23 11:29:18,235 INFO L273 TraceCheckUtils]: 7: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2018-11-23 11:29:18,236 INFO L273 TraceCheckUtils]: 8: Hoare triple {31#false} assume 0bv32 == ~cond; {31#false} is VALID [2018-11-23 11:29:18,236 INFO L273 TraceCheckUtils]: 9: Hoare triple {31#false} assume !false; {31#false} is VALID [2018-11-23 11:29:18,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:18,239 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:29:18,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:29:18,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:29:18,249 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 11:29:18,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:29:18,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:29:18,363 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:18,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:29:18,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:29:18,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:29:18,375 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-23 11:29:18,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:18,712 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2018-11-23 11:29:18,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:29:18,712 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 11:29:18,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:29:18,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:29:18,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 51 transitions. [2018-11-23 11:29:18,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:29:18,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 51 transitions. [2018-11-23 11:29:18,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 51 transitions. [2018-11-23 11:29:18,879 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:18,893 INFO L225 Difference]: With dead ends: 38 [2018-11-23 11:29:18,893 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 11:29:18,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:29:18,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 11:29:18,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 11:29:18,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:29:18,954 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 11:29:18,955 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 11:29:18,955 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 11:29:18,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:18,959 INFO L93 Difference]: Finished difference Result 21 states and 31 transitions. [2018-11-23 11:29:18,959 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2018-11-23 11:29:18,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:18,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:18,960 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 11:29:18,960 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 11:29:18,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:18,964 INFO L93 Difference]: Finished difference Result 21 states and 31 transitions. [2018-11-23 11:29:18,964 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2018-11-23 11:29:18,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:18,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:18,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:29:18,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:29:18,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:29:18,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2018-11-23 11:29:18,970 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 10 [2018-11-23 11:29:18,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:29:18,971 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 31 transitions. [2018-11-23 11:29:18,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:29:18,971 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2018-11-23 11:29:18,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 11:29:18,972 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:18,972 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:18,972 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:18,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:18,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1847134466, now seen corresponding path program 1 times [2018-11-23 11:29:18,973 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:18,973 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:29:18,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:29:19,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:19,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:19,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:19,156 INFO L256 TraceCheckUtils]: 0: Hoare triple {178#true} call ULTIMATE.init(); {178#true} is VALID [2018-11-23 11:29:19,156 INFO L273 TraceCheckUtils]: 1: Hoare triple {178#true} assume true; {178#true} is VALID [2018-11-23 11:29:19,156 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {178#true} {178#true} #91#return; {178#true} is VALID [2018-11-23 11:29:19,157 INFO L256 TraceCheckUtils]: 3: Hoare triple {178#true} call #t~ret2 := main(); {178#true} is VALID [2018-11-23 11:29:19,157 INFO L273 TraceCheckUtils]: 4: Hoare triple {178#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {195#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:19,158 INFO L273 TraceCheckUtils]: 5: Hoare triple {195#(= main_~x~0 (_ bv0 32))} assume !~bvult32(~x~0, 99bv32); {179#false} is VALID [2018-11-23 11:29:19,158 INFO L256 TraceCheckUtils]: 6: Hoare triple {179#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {179#false} is VALID [2018-11-23 11:29:19,159 INFO L273 TraceCheckUtils]: 7: Hoare triple {179#false} ~cond := #in~cond; {179#false} is VALID [2018-11-23 11:29:19,159 INFO L273 TraceCheckUtils]: 8: Hoare triple {179#false} assume 0bv32 == ~cond; {179#false} is VALID [2018-11-23 11:29:19,159 INFO L273 TraceCheckUtils]: 9: Hoare triple {179#false} assume !false; {179#false} is VALID [2018-11-23 11:29:19,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:19,161 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:29:19,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:29:19,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:29:19,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 11:29:19,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:29:19,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:29:19,196 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:19,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:29:19,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:29:19,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:29:19,197 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. Second operand 3 states. [2018-11-23 11:29:19,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:19,383 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2018-11-23 11:29:19,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:29:19,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 11:29:19,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:29:19,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:29:19,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2018-11-23 11:29:19,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:29:19,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2018-11-23 11:29:19,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 39 transitions. [2018-11-23 11:29:19,816 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:19,817 INFO L225 Difference]: With dead ends: 28 [2018-11-23 11:29:19,818 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 11:29:19,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:29:19,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 11:29:19,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-11-23 11:29:19,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:29:19,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 22 states. [2018-11-23 11:29:19,861 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 22 states. [2018-11-23 11:29:19,861 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 22 states. [2018-11-23 11:29:19,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:19,863 INFO L93 Difference]: Finished difference Result 23 states and 34 transitions. [2018-11-23 11:29:19,864 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 34 transitions. [2018-11-23 11:29:19,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:19,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:19,864 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 23 states. [2018-11-23 11:29:19,864 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 23 states. [2018-11-23 11:29:19,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:19,867 INFO L93 Difference]: Finished difference Result 23 states and 34 transitions. [2018-11-23 11:29:19,867 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 34 transitions. [2018-11-23 11:29:19,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:19,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:19,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:29:19,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:29:19,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:29:19,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2018-11-23 11:29:19,871 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 10 [2018-11-23 11:29:19,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:29:19,871 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2018-11-23 11:29:19,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:29:19,871 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2018-11-23 11:29:19,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:29:19,872 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:19,873 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:19,873 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:19,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:19,873 INFO L82 PathProgramCache]: Analyzing trace with hash -129940435, now seen corresponding path program 1 times [2018-11-23 11:29:19,874 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:19,874 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:29:19,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:29:19,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:19,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:19,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:20,058 INFO L256 TraceCheckUtils]: 0: Hoare triple {324#true} call ULTIMATE.init(); {324#true} is VALID [2018-11-23 11:29:20,059 INFO L273 TraceCheckUtils]: 1: Hoare triple {324#true} assume true; {324#true} is VALID [2018-11-23 11:29:20,059 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {324#true} {324#true} #91#return; {324#true} is VALID [2018-11-23 11:29:20,060 INFO L256 TraceCheckUtils]: 3: Hoare triple {324#true} call #t~ret2 := main(); {324#true} is VALID [2018-11-23 11:29:20,060 INFO L273 TraceCheckUtils]: 4: Hoare triple {324#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {324#true} is VALID [2018-11-23 11:29:20,060 INFO L273 TraceCheckUtils]: 5: Hoare triple {324#true} assume !!~bvult32(~x~0, 99bv32); {324#true} is VALID [2018-11-23 11:29:20,061 INFO L273 TraceCheckUtils]: 6: Hoare triple {324#true} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {347#(= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:20,064 INFO L273 TraceCheckUtils]: 7: Hoare triple {347#(= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {347#(= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:20,065 INFO L273 TraceCheckUtils]: 8: Hoare triple {347#(= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {347#(= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:20,066 INFO L273 TraceCheckUtils]: 9: Hoare triple {347#(= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {347#(= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:20,066 INFO L273 TraceCheckUtils]: 10: Hoare triple {347#(= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {347#(= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:20,067 INFO L273 TraceCheckUtils]: 11: Hoare triple {347#(= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvsub32(~x~0, 4bv32); {325#false} is VALID [2018-11-23 11:29:20,067 INFO L273 TraceCheckUtils]: 12: Hoare triple {325#false} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {325#false} is VALID [2018-11-23 11:29:20,068 INFO L273 TraceCheckUtils]: 13: Hoare triple {325#false} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {325#false} is VALID [2018-11-23 11:29:20,068 INFO L273 TraceCheckUtils]: 14: Hoare triple {325#false} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {325#false} is VALID [2018-11-23 11:29:20,068 INFO L273 TraceCheckUtils]: 15: Hoare triple {325#false} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {325#false} is VALID [2018-11-23 11:29:20,068 INFO L273 TraceCheckUtils]: 16: Hoare triple {325#false} assume !~bvult32(~x~0, 99bv32); {325#false} is VALID [2018-11-23 11:29:20,069 INFO L256 TraceCheckUtils]: 17: Hoare triple {325#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {325#false} is VALID [2018-11-23 11:29:20,069 INFO L273 TraceCheckUtils]: 18: Hoare triple {325#false} ~cond := #in~cond; {325#false} is VALID [2018-11-23 11:29:20,069 INFO L273 TraceCheckUtils]: 19: Hoare triple {325#false} assume 0bv32 == ~cond; {325#false} is VALID [2018-11-23 11:29:20,069 INFO L273 TraceCheckUtils]: 20: Hoare triple {325#false} assume !false; {325#false} is VALID [2018-11-23 11:29:20,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:20,072 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:29:20,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:29:20,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:29:20,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 11:29:20,077 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:29:20,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:29:20,117 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:20,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:29:20,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:29:20,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:29:20,118 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 3 states. [2018-11-23 11:29:20,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:20,394 INFO L93 Difference]: Finished difference Result 50 states and 81 transitions. [2018-11-23 11:29:20,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:29:20,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 11:29:20,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:29:20,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:29:20,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2018-11-23 11:29:20,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:29:20,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2018-11-23 11:29:20,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 80 transitions. [2018-11-23 11:29:20,639 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:20,642 INFO L225 Difference]: With dead ends: 50 [2018-11-23 11:29:20,642 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 11:29:20,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:29:20,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 11:29:20,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 11:29:20,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:29:20,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-23 11:29:20,680 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-23 11:29:20,680 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-23 11:29:20,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:20,683 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2018-11-23 11:29:20,683 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2018-11-23 11:29:20,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:20,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:20,684 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-23 11:29:20,685 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-23 11:29:20,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:20,688 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2018-11-23 11:29:20,688 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2018-11-23 11:29:20,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:20,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:20,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:29:20,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:29:20,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:29:20,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2018-11-23 11:29:20,691 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 21 [2018-11-23 11:29:20,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:29:20,692 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2018-11-23 11:29:20,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:29:20,692 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2018-11-23 11:29:20,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:29:20,693 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:20,693 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:20,694 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:20,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:20,694 INFO L82 PathProgramCache]: Analyzing trace with hash 263086575, now seen corresponding path program 1 times [2018-11-23 11:29:20,695 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:20,695 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:29:20,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:29:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:20,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:21,264 INFO L256 TraceCheckUtils]: 0: Hoare triple {562#true} call ULTIMATE.init(); {562#true} is VALID [2018-11-23 11:29:21,264 INFO L273 TraceCheckUtils]: 1: Hoare triple {562#true} assume true; {562#true} is VALID [2018-11-23 11:29:21,265 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {562#true} {562#true} #91#return; {562#true} is VALID [2018-11-23 11:29:21,265 INFO L256 TraceCheckUtils]: 3: Hoare triple {562#true} call #t~ret2 := main(); {562#true} is VALID [2018-11-23 11:29:21,265 INFO L273 TraceCheckUtils]: 4: Hoare triple {562#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {579#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:21,267 INFO L273 TraceCheckUtils]: 5: Hoare triple {579#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {579#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:21,267 INFO L273 TraceCheckUtils]: 6: Hoare triple {579#(= main_~x~0 (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {586#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:21,269 INFO L273 TraceCheckUtils]: 7: Hoare triple {586#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {590#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-23 11:29:21,269 INFO L273 TraceCheckUtils]: 8: Hoare triple {590#(= (_ bv4 32) main_~x~0)} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {594#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:21,271 INFO L273 TraceCheckUtils]: 9: Hoare triple {594#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {598#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:21,276 INFO L273 TraceCheckUtils]: 10: Hoare triple {598#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {602#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:21,277 INFO L273 TraceCheckUtils]: 11: Hoare triple {602#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {606#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:21,279 INFO L273 TraceCheckUtils]: 12: Hoare triple {606#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {610#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:21,280 INFO L273 TraceCheckUtils]: 13: Hoare triple {610#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {614#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:21,281 INFO L273 TraceCheckUtils]: 14: Hoare triple {614#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {618#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:21,282 INFO L273 TraceCheckUtils]: 15: Hoare triple {618#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {622#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:21,283 INFO L273 TraceCheckUtils]: 16: Hoare triple {622#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} assume !~bvult32(~x~0, 99bv32); {563#false} is VALID [2018-11-23 11:29:21,283 INFO L256 TraceCheckUtils]: 17: Hoare triple {563#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {563#false} is VALID [2018-11-23 11:29:21,284 INFO L273 TraceCheckUtils]: 18: Hoare triple {563#false} ~cond := #in~cond; {563#false} is VALID [2018-11-23 11:29:21,284 INFO L273 TraceCheckUtils]: 19: Hoare triple {563#false} assume 0bv32 == ~cond; {563#false} is VALID [2018-11-23 11:29:21,284 INFO L273 TraceCheckUtils]: 20: Hoare triple {563#false} assume !false; {563#false} is VALID [2018-11-23 11:29:21,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:21,286 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:29:22,003 INFO L273 TraceCheckUtils]: 20: Hoare triple {563#false} assume !false; {563#false} is VALID [2018-11-23 11:29:22,004 INFO L273 TraceCheckUtils]: 19: Hoare triple {563#false} assume 0bv32 == ~cond; {563#false} is VALID [2018-11-23 11:29:22,004 INFO L273 TraceCheckUtils]: 18: Hoare triple {563#false} ~cond := #in~cond; {563#false} is VALID [2018-11-23 11:29:22,004 INFO L256 TraceCheckUtils]: 17: Hoare triple {563#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {563#false} is VALID [2018-11-23 11:29:22,005 INFO L273 TraceCheckUtils]: 16: Hoare triple {650#(bvult main_~x~0 (_ bv99 32))} assume !~bvult32(~x~0, 99bv32); {563#false} is VALID [2018-11-23 11:29:22,007 INFO L273 TraceCheckUtils]: 15: Hoare triple {654#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {650#(bvult main_~x~0 (_ bv99 32))} is VALID [2018-11-23 11:29:22,011 INFO L273 TraceCheckUtils]: 14: Hoare triple {658#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {654#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:22,017 INFO L273 TraceCheckUtils]: 13: Hoare triple {662#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {658#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:22,022 INFO L273 TraceCheckUtils]: 12: Hoare triple {666#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {662#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:22,025 INFO L273 TraceCheckUtils]: 11: Hoare triple {670#(bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {666#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:22,029 INFO L273 TraceCheckUtils]: 10: Hoare triple {674#(bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {670#(bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:22,034 INFO L273 TraceCheckUtils]: 9: Hoare triple {678#(bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {674#(bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:22,038 INFO L273 TraceCheckUtils]: 8: Hoare triple {682#(bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {678#(bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:22,043 INFO L273 TraceCheckUtils]: 7: Hoare triple {686#(bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {682#(bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:22,048 INFO L273 TraceCheckUtils]: 6: Hoare triple {690#(bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {686#(bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:22,049 INFO L273 TraceCheckUtils]: 5: Hoare triple {690#(bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {690#(bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:22,050 INFO L273 TraceCheckUtils]: 4: Hoare triple {562#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {690#(bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:22,050 INFO L256 TraceCheckUtils]: 3: Hoare triple {562#true} call #t~ret2 := main(); {562#true} is VALID [2018-11-23 11:29:22,051 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {562#true} {562#true} #91#return; {562#true} is VALID [2018-11-23 11:29:22,051 INFO L273 TraceCheckUtils]: 1: Hoare triple {562#true} assume true; {562#true} is VALID [2018-11-23 11:29:22,051 INFO L256 TraceCheckUtils]: 0: Hoare triple {562#true} call ULTIMATE.init(); {562#true} is VALID [2018-11-23 11:29:22,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:22,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:29:22,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 11:29:22,055 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2018-11-23 11:29:22,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:29:22,056 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 11:29:22,218 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:22,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 11:29:22,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 11:29:22,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:29:22,219 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 24 states. [2018-11-23 11:29:30,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:30,411 INFO L93 Difference]: Finished difference Result 127 states and 147 transitions. [2018-11-23 11:29:30,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 11:29:30,411 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2018-11-23 11:29:30,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:29:30,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:29:30,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 142 transitions. [2018-11-23 11:29:30,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:29:30,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 142 transitions. [2018-11-23 11:29:30,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 142 transitions. [2018-11-23 11:29:30,884 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:30,889 INFO L225 Difference]: With dead ends: 127 [2018-11-23 11:29:30,889 INFO L226 Difference]: Without dead ends: 122 [2018-11-23 11:29:30,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=554, Invalid=1006, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 11:29:30,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-23 11:29:30,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 55. [2018-11-23 11:29:30,928 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:29:30,928 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 55 states. [2018-11-23 11:29:30,928 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 55 states. [2018-11-23 11:29:30,928 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 55 states. [2018-11-23 11:29:30,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:30,934 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2018-11-23 11:29:30,934 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2018-11-23 11:29:30,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:30,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:30,936 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 122 states. [2018-11-23 11:29:30,936 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 122 states. [2018-11-23 11:29:30,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:30,943 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2018-11-23 11:29:30,943 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2018-11-23 11:29:30,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:30,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:30,945 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:29:30,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:29:30,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 11:29:30,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2018-11-23 11:29:30,948 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 21 [2018-11-23 11:29:30,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:29:30,949 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2018-11-23 11:29:30,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 11:29:30,949 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2018-11-23 11:29:30,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:29:30,950 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:30,950 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:30,950 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:30,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:30,951 INFO L82 PathProgramCache]: Analyzing trace with hash -402778255, now seen corresponding path program 1 times [2018-11-23 11:29:30,951 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:30,951 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:29:30,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:29:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:31,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:31,050 INFO L256 TraceCheckUtils]: 0: Hoare triple {1201#true} call ULTIMATE.init(); {1201#true} is VALID [2018-11-23 11:29:31,051 INFO L273 TraceCheckUtils]: 1: Hoare triple {1201#true} assume true; {1201#true} is VALID [2018-11-23 11:29:31,051 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1201#true} {1201#true} #91#return; {1201#true} is VALID [2018-11-23 11:29:31,052 INFO L256 TraceCheckUtils]: 3: Hoare triple {1201#true} call #t~ret2 := main(); {1201#true} is VALID [2018-11-23 11:29:31,052 INFO L273 TraceCheckUtils]: 4: Hoare triple {1201#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {1201#true} is VALID [2018-11-23 11:29:31,053 INFO L273 TraceCheckUtils]: 5: Hoare triple {1201#true} assume !!~bvult32(~x~0, 99bv32); {1201#true} is VALID [2018-11-23 11:29:31,055 INFO L273 TraceCheckUtils]: 6: Hoare triple {1201#true} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1224#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:29:31,055 INFO L273 TraceCheckUtils]: 7: Hoare triple {1224#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvsub32(~x~0, 2bv32); {1224#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:29:31,057 INFO L273 TraceCheckUtils]: 8: Hoare triple {1224#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {1224#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:29:31,057 INFO L273 TraceCheckUtils]: 9: Hoare triple {1224#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvsub32(~x~0, 2bv32); {1224#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:29:31,058 INFO L273 TraceCheckUtils]: 10: Hoare triple {1224#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {1224#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:29:31,058 INFO L273 TraceCheckUtils]: 11: Hoare triple {1224#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvsub32(~x~0, 4bv32); {1224#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:29:31,059 INFO L273 TraceCheckUtils]: 12: Hoare triple {1224#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(4bv32, ~x~0); {1224#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:29:31,059 INFO L273 TraceCheckUtils]: 13: Hoare triple {1224#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {1224#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:29:31,059 INFO L273 TraceCheckUtils]: 14: Hoare triple {1224#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvsub32(~x~0, 4bv32); {1224#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:29:31,077 INFO L273 TraceCheckUtils]: 15: Hoare triple {1224#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1202#false} is VALID [2018-11-23 11:29:31,077 INFO L273 TraceCheckUtils]: 16: Hoare triple {1202#false} assume !~bvult32(~x~0, 99bv32); {1202#false} is VALID [2018-11-23 11:29:31,078 INFO L256 TraceCheckUtils]: 17: Hoare triple {1202#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {1202#false} is VALID [2018-11-23 11:29:31,078 INFO L273 TraceCheckUtils]: 18: Hoare triple {1202#false} ~cond := #in~cond; {1202#false} is VALID [2018-11-23 11:29:31,078 INFO L273 TraceCheckUtils]: 19: Hoare triple {1202#false} assume 0bv32 == ~cond; {1202#false} is VALID [2018-11-23 11:29:31,078 INFO L273 TraceCheckUtils]: 20: Hoare triple {1202#false} assume !false; {1202#false} is VALID [2018-11-23 11:29:31,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:31,080 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:29:31,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:29:31,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:29:31,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 11:29:31,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:29:31,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:29:31,113 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:31,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:29:31,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:29:31,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:29:31,114 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand 3 states. [2018-11-23 11:29:31,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:31,395 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2018-11-23 11:29:31,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:29:31,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 11:29:31,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:29:31,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:29:31,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-23 11:29:31,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:29:31,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-23 11:29:31,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2018-11-23 11:29:31,609 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:31,611 INFO L225 Difference]: With dead ends: 82 [2018-11-23 11:29:31,611 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 11:29:31,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:29:31,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 11:29:31,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-11-23 11:29:31,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:29:31,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 55 states. [2018-11-23 11:29:31,656 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 55 states. [2018-11-23 11:29:31,656 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 55 states. [2018-11-23 11:29:31,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:31,659 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-11-23 11:29:31,659 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-11-23 11:29:31,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:31,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:31,660 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 56 states. [2018-11-23 11:29:31,660 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 56 states. [2018-11-23 11:29:31,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:31,662 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-11-23 11:29:31,663 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-11-23 11:29:31,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:31,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:31,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:29:31,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:29:31,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 11:29:31,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-11-23 11:29:31,666 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 21 [2018-11-23 11:29:31,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:29:31,666 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-11-23 11:29:31,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:29:31,666 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-11-23 11:29:31,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:29:31,667 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:31,667 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:31,667 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:31,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:31,668 INFO L82 PathProgramCache]: Analyzing trace with hash -345519953, now seen corresponding path program 1 times [2018-11-23 11:29:31,668 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:31,668 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:29:31,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:29:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:31,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:31,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:32,464 INFO L256 TraceCheckUtils]: 0: Hoare triple {1542#true} call ULTIMATE.init(); {1542#true} is VALID [2018-11-23 11:29:32,464 INFO L273 TraceCheckUtils]: 1: Hoare triple {1542#true} assume true; {1542#true} is VALID [2018-11-23 11:29:32,465 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1542#true} {1542#true} #91#return; {1542#true} is VALID [2018-11-23 11:29:32,465 INFO L256 TraceCheckUtils]: 3: Hoare triple {1542#true} call #t~ret2 := main(); {1542#true} is VALID [2018-11-23 11:29:32,471 INFO L273 TraceCheckUtils]: 4: Hoare triple {1542#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {1559#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:32,471 INFO L273 TraceCheckUtils]: 5: Hoare triple {1559#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {1559#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:32,473 INFO L273 TraceCheckUtils]: 6: Hoare triple {1559#(= main_~x~0 (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1566#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-23 11:29:32,473 INFO L273 TraceCheckUtils]: 7: Hoare triple {1566#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvsub32(~x~0, 2bv32); {1570#(and (= (bvadd main_~x~0 (_ bv1 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-23 11:29:32,474 INFO L273 TraceCheckUtils]: 8: Hoare triple {1570#(and (= (bvadd main_~x~0 (_ bv1 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {1566#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-23 11:29:32,475 INFO L273 TraceCheckUtils]: 9: Hoare triple {1566#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvsub32(~x~0, 2bv32); {1570#(and (= (bvadd main_~x~0 (_ bv1 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-23 11:29:32,476 INFO L273 TraceCheckUtils]: 10: Hoare triple {1570#(and (= (bvadd main_~x~0 (_ bv1 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {1566#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-23 11:29:32,477 INFO L273 TraceCheckUtils]: 11: Hoare triple {1566#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvsub32(~x~0, 4bv32); {1583#(and (= (bvadd main_~x~0 (_ bv3 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-23 11:29:32,478 INFO L273 TraceCheckUtils]: 12: Hoare triple {1583#(and (= (bvadd main_~x~0 (_ bv3 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(4bv32, ~x~0); {1566#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-23 11:29:32,479 INFO L273 TraceCheckUtils]: 13: Hoare triple {1566#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {1590#(and (= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-23 11:29:32,489 INFO L273 TraceCheckUtils]: 14: Hoare triple {1590#(and (= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvsub32(~x~0, 4bv32); {1570#(and (= (bvadd main_~x~0 (_ bv1 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-23 11:29:32,503 INFO L273 TraceCheckUtils]: 15: Hoare triple {1570#(and (= (bvadd main_~x~0 (_ bv1 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvsub32(~x~0, 4bv32); {1597#(and (= (bvadd main_~x~0 (_ bv5 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-23 11:29:32,514 INFO L273 TraceCheckUtils]: 16: Hoare triple {1597#(and (= (bvadd main_~x~0 (_ bv5 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} assume !~bvult32(~x~0, 99bv32); {1597#(and (= (bvadd main_~x~0 (_ bv5 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-23 11:29:32,524 INFO L256 TraceCheckUtils]: 17: Hoare triple {1597#(and (= (bvadd main_~x~0 (_ bv5 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {1604#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:32,529 INFO L273 TraceCheckUtils]: 18: Hoare triple {1604#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1608#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:32,535 INFO L273 TraceCheckUtils]: 19: Hoare triple {1608#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {1543#false} is VALID [2018-11-23 11:29:32,535 INFO L273 TraceCheckUtils]: 20: Hoare triple {1543#false} assume !false; {1543#false} is VALID [2018-11-23 11:29:32,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:32,537 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:29:33,062 INFO L273 TraceCheckUtils]: 20: Hoare triple {1543#false} assume !false; {1543#false} is VALID [2018-11-23 11:29:33,063 INFO L273 TraceCheckUtils]: 19: Hoare triple {1618#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {1543#false} is VALID [2018-11-23 11:29:33,064 INFO L273 TraceCheckUtils]: 18: Hoare triple {1622#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {1618#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:29:33,067 INFO L256 TraceCheckUtils]: 17: Hoare triple {1626#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {1622#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:29:33,068 INFO L273 TraceCheckUtils]: 16: Hoare triple {1626#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !~bvult32(~x~0, 99bv32); {1626#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:29:33,069 INFO L273 TraceCheckUtils]: 15: Hoare triple {1626#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvsub32(~x~0, 4bv32); {1626#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:29:33,070 INFO L273 TraceCheckUtils]: 14: Hoare triple {1626#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvsub32(~x~0, 4bv32); {1626#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:29:33,071 INFO L273 TraceCheckUtils]: 13: Hoare triple {1626#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {1626#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:29:33,072 INFO L273 TraceCheckUtils]: 12: Hoare triple {1626#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(4bv32, ~x~0); {1626#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:29:33,074 INFO L273 TraceCheckUtils]: 11: Hoare triple {1626#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvsub32(~x~0, 4bv32); {1626#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:29:33,075 INFO L273 TraceCheckUtils]: 10: Hoare triple {1626#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {1626#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:29:33,077 INFO L273 TraceCheckUtils]: 9: Hoare triple {1626#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvsub32(~x~0, 2bv32); {1626#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:29:33,079 INFO L273 TraceCheckUtils]: 8: Hoare triple {1654#(or (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {1626#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:29:33,081 INFO L273 TraceCheckUtils]: 7: Hoare triple {1654#(or (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvsub32(~x~0, 2bv32); {1654#(or (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))))} is VALID [2018-11-23 11:29:33,083 INFO L273 TraceCheckUtils]: 6: Hoare triple {1661#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem main_~y~0 (_ bv2 32)) (bvurem (bvadd main_~x~0 (_ bv3 32)) (_ bv2 32))) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1654#(or (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))))} is VALID [2018-11-23 11:29:33,084 INFO L273 TraceCheckUtils]: 5: Hoare triple {1661#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem main_~y~0 (_ bv2 32)) (bvurem (bvadd main_~x~0 (_ bv3 32)) (_ bv2 32))) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} assume !!~bvult32(~x~0, 99bv32); {1661#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem main_~y~0 (_ bv2 32)) (bvurem (bvadd main_~x~0 (_ bv3 32)) (_ bv2 32))) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-23 11:29:33,096 INFO L273 TraceCheckUtils]: 4: Hoare triple {1542#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {1661#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem main_~y~0 (_ bv2 32)) (bvurem (bvadd main_~x~0 (_ bv3 32)) (_ bv2 32))) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-23 11:29:33,096 INFO L256 TraceCheckUtils]: 3: Hoare triple {1542#true} call #t~ret2 := main(); {1542#true} is VALID [2018-11-23 11:29:33,096 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1542#true} {1542#true} #91#return; {1542#true} is VALID [2018-11-23 11:29:33,097 INFO L273 TraceCheckUtils]: 1: Hoare triple {1542#true} assume true; {1542#true} is VALID [2018-11-23 11:29:33,097 INFO L256 TraceCheckUtils]: 0: Hoare triple {1542#true} call ULTIMATE.init(); {1542#true} is VALID [2018-11-23 11:29:33,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:33,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:29:33,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2018-11-23 11:29:33,102 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2018-11-23 11:29:33,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:29:33,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:29:33,200 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:33,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:29:33,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:29:33,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:29:33,202 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 15 states. [2018-11-23 11:29:35,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:35,071 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-11-23 11:29:35,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:29:35,071 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2018-11-23 11:29:35,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:29:35,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:29:35,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 51 transitions. [2018-11-23 11:29:35,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:29:35,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 51 transitions. [2018-11-23 11:29:35,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 51 transitions. [2018-11-23 11:29:35,180 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:35,181 INFO L225 Difference]: With dead ends: 69 [2018-11-23 11:29:35,181 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:29:35,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:29:35,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:29:35,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:29:35,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:29:35,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 11:29:35,183 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:29:35,183 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:29:35,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:35,183 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:29:35,184 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:29:35,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:35,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:35,184 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:29:35,184 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:29:35,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:35,184 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:29:35,184 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:29:35,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:35,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:35,185 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:29:35,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:29:35,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:29:35,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:29:35,185 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-11-23 11:29:35,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:29:35,185 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:29:35,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:29:35,185 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:29:35,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:35,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:29:35,498 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 11:29:35,498 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:29:35,498 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:29:35,498 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 11:29:35,498 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:29:35,498 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:29:35,499 INFO L444 ceAbstractionStarter]: At program point L31-1(lines 12 33) the Hoare annotation is: (let ((.cse0 (bvurem main_~y~0 (_ bv2 32)))) (or (and (= (bvadd main_~x~0 (_ bv5 32)) (_ bv0 32)) (not (= .cse0 (_ bv0 32)))) (= main_~x~0 (_ bv0 32)) (and (= .cse0 (bvurem main_~x~0 (_ bv2 32))) (forall ((main_~y~0 (_ BitVec 32))) (let ((.cse1 (bvurem main_~y~0 (_ bv2 32)))) (or (= .cse1 (bvurem (bvadd main_~x~0 (_ bv3 32)) (_ bv2 32))) (= .cse1 (_ bv0 32)))))))) [2018-11-23 11:29:35,499 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 12 33) no Hoare annotation was computed. [2018-11-23 11:29:35,499 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 9 35) no Hoare annotation was computed. [2018-11-23 11:29:35,499 INFO L448 ceAbstractionStarter]: For program point L23-1(lines 12 33) no Hoare annotation was computed. [2018-11-23 11:29:35,499 INFO L448 ceAbstractionStarter]: For program point L19-1(lines 12 33) no Hoare annotation was computed. [2018-11-23 11:29:35,499 INFO L448 ceAbstractionStarter]: For program point L15-1(lines 12 33) no Hoare annotation was computed. [2018-11-23 11:29:35,499 INFO L444 ceAbstractionStarter]: At program point L12-2(lines 12 33) the Hoare annotation is: (let ((.cse0 (bvurem main_~y~0 (_ bv2 32)))) (or (and (= .cse0 (bvurem main_~x~0 (_ bv2 32))) (forall ((main_~y~0 (_ BitVec 32))) (let ((.cse1 (bvurem main_~y~0 (_ bv2 32)))) (or (= .cse1 (bvurem (bvadd main_~x~0 (_ bv3 32)) (_ bv2 32))) (= .cse1 (_ bv0 32)))))) (and (= (bvadd main_~x~0 (_ bv5 32)) (_ bv0 32)) (not (= .cse0 (_ bv0 32)))))) [2018-11-23 11:29:35,499 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 12 33) no Hoare annotation was computed. [2018-11-23 11:29:35,500 INFO L448 ceAbstractionStarter]: For program point L25-1(lines 12 33) no Hoare annotation was computed. [2018-11-23 11:29:35,500 INFO L448 ceAbstractionStarter]: For program point L21-1(lines 12 33) no Hoare annotation was computed. [2018-11-23 11:29:35,500 INFO L448 ceAbstractionStarter]: For program point L17-1(lines 12 33) no Hoare annotation was computed. [2018-11-23 11:29:35,500 INFO L448 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. [2018-11-23 11:29:35,500 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 9 35) no Hoare annotation was computed. [2018-11-23 11:29:35,500 INFO L448 ceAbstractionStarter]: For program point L13-2(lines 12 33) no Hoare annotation was computed. [2018-11-23 11:29:35,500 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 9 35) the Hoare annotation is: true [2018-11-23 11:29:35,500 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 11:29:35,500 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 11:29:35,500 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 11:29:35,500 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 11:29:35,501 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 11:29:35,501 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 11:29:35,502 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:29:35,503 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:29:35,503 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:29:35,503 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:29:35,504 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-23 11:29:35,504 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:29:35,504 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:29:35,505 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:29:35,505 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:29:35,505 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-23 11:29:35,505 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-23 11:29:35,505 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:29:35,505 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:29:35,505 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 11:29:35,505 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:29:35,506 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2018-11-23 11:29:35,506 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2018-11-23 11:29:35,506 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:29:35,506 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:29:35,506 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2018-11-23 11:29:35,506 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2018-11-23 11:29:35,506 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2018-11-23 11:29:35,507 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2018-11-23 11:29:35,507 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2018-11-23 11:29:35,507 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2018-11-23 11:29:35,507 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2018-11-23 11:29:35,507 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2018-11-23 11:29:35,507 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2018-11-23 11:29:35,508 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2018-11-23 11:29:35,508 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2018-11-23 11:29:35,508 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2018-11-23 11:29:35,508 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2018-11-23 11:29:35,508 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2018-11-23 11:29:35,508 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2018-11-23 11:29:35,508 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2018-11-23 11:29:35,508 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 11:29:35,514 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] [2018-11-23 11:29:35,515 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] [2018-11-23 11:29:35,521 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] [2018-11-23 11:29:35,521 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] [2018-11-23 11:29:35,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:29:35 BoogieIcfgContainer [2018-11-23 11:29:35,524 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:29:35,524 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:29:35,524 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:29:35,525 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:29:35,525 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:29:17" (3/4) ... [2018-11-23 11:29:35,529 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 11:29:35,536 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 11:29:35,537 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 11:29:35,537 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 11:29:35,542 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-23 11:29:35,542 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 11:29:35,542 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 11:29:35,602 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-acceleration/diamond_true-unreach-call2.i-witness.graphml [2018-11-23 11:29:35,602 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:29:35,603 INFO L168 Benchmark]: Toolchain (without parser) took 18798.09 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 852.0 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -479.0 MB). Peak memory consumption was 373.0 MB. Max. memory is 7.1 GB. [2018-11-23 11:29:35,605 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:29:35,605 INFO L168 Benchmark]: CACSL2BoogieTranslator took 367.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2018-11-23 11:29:35,609 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:29:35,610 INFO L168 Benchmark]: Boogie Preprocessor took 32.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:29:35,610 INFO L168 Benchmark]: RCFGBuilder took 745.36 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 718.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -751.4 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-23 11:29:35,611 INFO L168 Benchmark]: TraceAbstraction took 17540.62 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 133.7 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 259.2 MB). Peak memory consumption was 392.9 MB. Max. memory is 7.1 GB. [2018-11-23 11:29:35,611 INFO L168 Benchmark]: Witness Printer took 78.19 ms. Allocated memory is still 2.4 GB. Free memory is still 1.9 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:29:35,621 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 367.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 28.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 745.36 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 718.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -751.4 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17540.62 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 133.7 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 259.2 MB). Peak memory consumption was 392.9 MB. Max. memory is 7.1 GB. * Witness Printer took 78.19 ms. Allocated memory is still 2.4 GB. Free memory is still 1.9 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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 - InvariantResult [Line: 12]: Loop Invariant [2018-11-23 11:29:35,630 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] [2018-11-23 11:29:35,630 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] [2018-11-23 11:29:35,630 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] [2018-11-23 11:29:35,631 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] Derived loop invariant: ((~bvadd64(x, 5bv32) == 0bv32 && !(~bvurem32(y, 2bv32) == 0bv32)) || x == 0bv32) || (~bvurem32(y, 2bv32) == ~bvurem32(x, 2bv32) && (forall main_~y~0 : bv32 :: ~bvurem32(main_~y~0, 2bv32) == ~bvurem32(~bvadd64(x, 3bv32), 2bv32) || ~bvurem32(main_~y~0, 2bv32) == 0bv32)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. SAFE Result, 17.4s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 12.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 127 SDtfs, 69 SDslu, 184 SDs, 0 SdLazy, 988 SolverSat, 473 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 94 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 70 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 14 PreInvPairs, 21 NumberOfFragments, 82 HoareAnnotationTreeSize, 14 FomulaSimplifications, 155 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 15 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 104 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 138 ConstructedInterpolants, 2 QuantifiedInterpolants, 10660 SizeOfPredicates, 5 NumberOfNonLiveVariables, 198 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 2/6 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...