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/array-examples/standard_init1_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:06:16,750 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:06:16,757 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:06:16,772 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:06:16,772 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:06:16,773 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:06:16,777 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:06:16,780 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:06:16,788 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:06:16,791 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:06:16,792 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:06:16,792 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:06:16,795 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:06:16,796 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:06:16,798 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:06:16,802 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:06:16,803 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:06:16,805 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:06:16,809 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:06:16,814 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:06:16,815 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:06:16,818 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:06:16,822 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:06:16,823 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:06:16,823 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:06:16,824 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:06:16,825 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:06:16,826 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:06:16,826 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:06:16,828 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:06:16,828 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:06:16,831 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:06:16,832 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:06:16,832 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:06:16,833 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:06:16,835 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:06:16,835 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 10:06:16,849 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:06:16,849 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:06:16,850 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:06:16,850 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:06:16,851 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:06:16,851 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:06:16,851 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:06:16,852 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:06:16,852 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:06:16,852 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:06:16,852 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:06:16,852 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:06:16,853 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:06:16,853 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:06:16,853 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:06:16,853 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:06:16,853 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:06:16,853 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:06:16,854 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:06:16,854 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:06:16,854 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:06:16,854 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:06:16,854 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:06:16,855 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:06:16,855 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:06:16,855 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:06:16,855 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:06:16,855 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:06:16,856 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:06:16,856 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:06:16,856 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:06:16,856 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:06:16,856 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:06:16,918 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:06:16,932 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:06:16,937 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:06:16,938 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:06:16,939 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:06:16,940 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init1_true-unreach-call_ground.i [2018-11-23 10:06:17,007 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88648a37b/ed04de9fa0734f31bcba450aabb5bb7c/FLAG90b466744 [2018-11-23 10:06:17,475 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:06:17,476 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init1_true-unreach-call_ground.i [2018-11-23 10:06:17,483 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88648a37b/ed04de9fa0734f31bcba450aabb5bb7c/FLAG90b466744 [2018-11-23 10:06:17,819 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88648a37b/ed04de9fa0734f31bcba450aabb5bb7c [2018-11-23 10:06:17,830 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:06:17,831 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:06:17,832 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:06:17,833 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:06:17,837 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:06:17,838 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:06:17" (1/1) ... [2018-11-23 10:06:17,841 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c4df8dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:17, skipping insertion in model container [2018-11-23 10:06:17,842 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:06:17" (1/1) ... [2018-11-23 10:06:17,852 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:06:17,876 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:06:18,139 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:06:18,145 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:06:18,173 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:06:18,202 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:06:18,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:18 WrapperNode [2018-11-23 10:06:18,203 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:06:18,203 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:06:18,203 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:06:18,204 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:06:18,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:18" (1/1) ... [2018-11-23 10:06:18,220 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:18" (1/1) ... [2018-11-23 10:06:18,227 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:06:18,228 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:06:18,228 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:06:18,228 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:06:18,236 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:18" (1/1) ... [2018-11-23 10:06:18,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:18" (1/1) ... [2018-11-23 10:06:18,238 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:18" (1/1) ... [2018-11-23 10:06:18,239 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:18" (1/1) ... [2018-11-23 10:06:18,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:18" (1/1) ... [2018-11-23 10:06:18,257 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:18" (1/1) ... [2018-11-23 10:06:18,258 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:18" (1/1) ... [2018-11-23 10:06:18,260 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:06:18,261 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:06:18,261 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:06:18,261 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:06:18,262 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:18" (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 10:06:18,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:06:18,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:06:18,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:06:18,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:06:18,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:06:18,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:06:18,398 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:06:18,398 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:06:18,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:06:18,398 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:06:18,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:06:18,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:06:18,895 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:06:18,895 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 10:06:18,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:06:18 BoogieIcfgContainer [2018-11-23 10:06:18,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:06:18,897 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:06:18,897 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:06:18,900 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:06:18,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:06:17" (1/3) ... [2018-11-23 10:06:18,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48f7847d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:06:18, skipping insertion in model container [2018-11-23 10:06:18,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:18" (2/3) ... [2018-11-23 10:06:18,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48f7847d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:06:18, skipping insertion in model container [2018-11-23 10:06:18,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:06:18" (3/3) ... [2018-11-23 10:06:18,904 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_init1_true-unreach-call_ground.i [2018-11-23 10:06:18,915 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:06:18,924 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:06:18,943 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:06:18,977 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:06:18,978 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:06:18,978 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:06:18,978 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:06:18,979 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:06:18,979 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:06:18,979 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:06:18,980 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:06:18,980 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:06:18,999 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-23 10:06:19,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 10:06:19,008 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:06:19,009 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:06:19,012 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:06:19,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:06:19,018 INFO L82 PathProgramCache]: Analyzing trace with hash -441053002, now seen corresponding path program 1 times [2018-11-23 10:06:19,023 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:06:19,024 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 10:06:19,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:06:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:06:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:06:19,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:06:19,210 INFO L256 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {26#true} is VALID [2018-11-23 10:06:19,215 INFO L273 TraceCheckUtils]: 1: Hoare triple {26#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {26#true} is VALID [2018-11-23 10:06:19,216 INFO L273 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2018-11-23 10:06:19,216 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #48#return; {26#true} is VALID [2018-11-23 10:06:19,217 INFO L256 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret2 := main(); {26#true} is VALID [2018-11-23 10:06:19,217 INFO L273 TraceCheckUtils]: 5: Hoare triple {26#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {26#true} is VALID [2018-11-23 10:06:19,232 INFO L273 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID [2018-11-23 10:06:19,232 INFO L273 TraceCheckUtils]: 7: Hoare triple {27#false} havoc ~x~0;~x~0 := 0bv32; {27#false} is VALID [2018-11-23 10:06:19,233 INFO L273 TraceCheckUtils]: 8: Hoare triple {27#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {27#false} is VALID [2018-11-23 10:06:19,233 INFO L256 TraceCheckUtils]: 9: Hoare triple {27#false} call __VERIFIER_assert((if 42bv32 == #t~mem1 then 1bv32 else 0bv32)); {27#false} is VALID [2018-11-23 10:06:19,234 INFO L273 TraceCheckUtils]: 10: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2018-11-23 10:06:19,234 INFO L273 TraceCheckUtils]: 11: Hoare triple {27#false} assume 0bv32 == ~cond; {27#false} is VALID [2018-11-23 10:06:19,235 INFO L273 TraceCheckUtils]: 12: Hoare triple {27#false} assume !false; {27#false} is VALID [2018-11-23 10:06:19,241 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 10:06:19,241 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:06:19,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:06:19,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:06:19,253 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 10:06:19,256 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:06:19,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:06:19,388 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:19,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:06:19,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:06:19,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:06:19,401 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-11-23 10:06:19,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:19,600 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-23 10:06:19,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:06:19,601 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 10:06:19,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:06:19,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:06:19,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2018-11-23 10:06:19,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:06:19,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2018-11-23 10:06:19,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 46 transitions. [2018-11-23 10:06:19,872 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:19,884 INFO L225 Difference]: With dead ends: 39 [2018-11-23 10:06:19,885 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 10:06:19,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 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 10:06:19,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 10:06:19,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 10:06:19,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:06:19,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-23 10:06:19,935 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 10:06:19,935 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 10:06:19,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:19,939 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 10:06:19,939 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 10:06:19,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:19,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:19,940 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 10:06:19,940 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 10:06:19,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:19,944 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 10:06:19,944 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 10:06:19,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:19,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:19,945 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:06:19,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:06:19,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 10:06:19,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-23 10:06:19,949 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-11-23 10:06:19,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:06:19,949 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-23 10:06:19,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:06:19,950 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 10:06:19,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 10:06:19,951 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:06:19,951 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:06:19,951 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:06:19,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:06:19,952 INFO L82 PathProgramCache]: Analyzing trace with hash 303899570, now seen corresponding path program 1 times [2018-11-23 10:06:19,952 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:06:19,952 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 10:06:19,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:06:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:06:20,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:06:20,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:06:20,138 INFO L256 TraceCheckUtils]: 0: Hoare triple {178#true} call ULTIMATE.init(); {178#true} is VALID [2018-11-23 10:06:20,139 INFO L273 TraceCheckUtils]: 1: Hoare triple {178#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {178#true} is VALID [2018-11-23 10:06:20,139 INFO L273 TraceCheckUtils]: 2: Hoare triple {178#true} assume true; {178#true} is VALID [2018-11-23 10:06:20,139 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {178#true} {178#true} #48#return; {178#true} is VALID [2018-11-23 10:06:20,140 INFO L256 TraceCheckUtils]: 4: Hoare triple {178#true} call #t~ret2 := main(); {178#true} is VALID [2018-11-23 10:06:20,141 INFO L273 TraceCheckUtils]: 5: Hoare triple {178#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {198#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:06:20,144 INFO L273 TraceCheckUtils]: 6: Hoare triple {198#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {179#false} is VALID [2018-11-23 10:06:20,144 INFO L273 TraceCheckUtils]: 7: Hoare triple {179#false} havoc ~x~0;~x~0 := 0bv32; {179#false} is VALID [2018-11-23 10:06:20,144 INFO L273 TraceCheckUtils]: 8: Hoare triple {179#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {179#false} is VALID [2018-11-23 10:06:20,145 INFO L256 TraceCheckUtils]: 9: Hoare triple {179#false} call __VERIFIER_assert((if 42bv32 == #t~mem1 then 1bv32 else 0bv32)); {179#false} is VALID [2018-11-23 10:06:20,145 INFO L273 TraceCheckUtils]: 10: Hoare triple {179#false} ~cond := #in~cond; {179#false} is VALID [2018-11-23 10:06:20,145 INFO L273 TraceCheckUtils]: 11: Hoare triple {179#false} assume 0bv32 == ~cond; {179#false} is VALID [2018-11-23 10:06:20,146 INFO L273 TraceCheckUtils]: 12: Hoare triple {179#false} assume !false; {179#false} is VALID [2018-11-23 10:06:20,147 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 10:06:20,147 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:06:20,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:06:20,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:06:20,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 10:06:20,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:06:20,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:06:20,173 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:20,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:06:20,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:06:20,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:06:20,175 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 3 states. [2018-11-23 10:06:20,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:20,260 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-11-23 10:06:20,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:06:20,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 10:06:20,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:06:20,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:06:20,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2018-11-23 10:06:20,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:06:20,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2018-11-23 10:06:20,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2018-11-23 10:06:20,331 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:20,333 INFO L225 Difference]: With dead ends: 30 [2018-11-23 10:06:20,334 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 10:06:20,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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 10:06:20,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 10:06:20,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 10:06:20,389 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:06:20,389 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 10:06:20,390 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 10:06:20,390 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 10:06:20,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:20,392 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 10:06:20,392 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 10:06:20,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:20,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:20,393 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 10:06:20,393 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 10:06:20,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:20,395 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 10:06:20,395 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 10:06:20,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:20,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:20,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:06:20,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:06:20,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 10:06:20,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-23 10:06:20,399 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 13 [2018-11-23 10:06:20,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:06:20,399 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-23 10:06:20,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:06:20,400 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 10:06:20,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 10:06:20,400 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:06:20,401 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:06:20,401 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:06:20,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:06:20,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1260126610, now seen corresponding path program 1 times [2018-11-23 10:06:20,402 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:06:20,402 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 10:06:20,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:06:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:06:20,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:06:20,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:06:20,818 INFO L256 TraceCheckUtils]: 0: Hoare triple {327#true} call ULTIMATE.init(); {327#true} is VALID [2018-11-23 10:06:20,819 INFO L273 TraceCheckUtils]: 1: Hoare triple {327#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {327#true} is VALID [2018-11-23 10:06:20,819 INFO L273 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2018-11-23 10:06:20,819 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #48#return; {327#true} is VALID [2018-11-23 10:06:20,820 INFO L256 TraceCheckUtils]: 4: Hoare triple {327#true} call #t~ret2 := main(); {327#true} is VALID [2018-11-23 10:06:20,821 INFO L273 TraceCheckUtils]: 5: Hoare triple {327#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {347#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:06:20,822 INFO L273 TraceCheckUtils]: 6: Hoare triple {347#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {351#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:20,823 INFO L273 TraceCheckUtils]: 7: Hoare triple {351#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {328#false} is VALID [2018-11-23 10:06:20,823 INFO L273 TraceCheckUtils]: 8: Hoare triple {328#false} havoc ~x~0;~x~0 := 0bv32; {328#false} is VALID [2018-11-23 10:06:20,823 INFO L273 TraceCheckUtils]: 9: Hoare triple {328#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {328#false} is VALID [2018-11-23 10:06:20,824 INFO L256 TraceCheckUtils]: 10: Hoare triple {328#false} call __VERIFIER_assert((if 42bv32 == #t~mem1 then 1bv32 else 0bv32)); {328#false} is VALID [2018-11-23 10:06:20,824 INFO L273 TraceCheckUtils]: 11: Hoare triple {328#false} ~cond := #in~cond; {328#false} is VALID [2018-11-23 10:06:20,825 INFO L273 TraceCheckUtils]: 12: Hoare triple {328#false} assume 0bv32 == ~cond; {328#false} is VALID [2018-11-23 10:06:20,825 INFO L273 TraceCheckUtils]: 13: Hoare triple {328#false} assume !false; {328#false} is VALID [2018-11-23 10:06:20,827 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 10:06:20,827 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:06:20,915 INFO L273 TraceCheckUtils]: 13: Hoare triple {328#false} assume !false; {328#false} is VALID [2018-11-23 10:06:20,915 INFO L273 TraceCheckUtils]: 12: Hoare triple {328#false} assume 0bv32 == ~cond; {328#false} is VALID [2018-11-23 10:06:20,916 INFO L273 TraceCheckUtils]: 11: Hoare triple {328#false} ~cond := #in~cond; {328#false} is VALID [2018-11-23 10:06:20,916 INFO L256 TraceCheckUtils]: 10: Hoare triple {328#false} call __VERIFIER_assert((if 42bv32 == #t~mem1 then 1bv32 else 0bv32)); {328#false} is VALID [2018-11-23 10:06:20,916 INFO L273 TraceCheckUtils]: 9: Hoare triple {328#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {328#false} is VALID [2018-11-23 10:06:20,916 INFO L273 TraceCheckUtils]: 8: Hoare triple {328#false} havoc ~x~0;~x~0 := 0bv32; {328#false} is VALID [2018-11-23 10:06:20,934 INFO L273 TraceCheckUtils]: 7: Hoare triple {391#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {328#false} is VALID [2018-11-23 10:06:20,948 INFO L273 TraceCheckUtils]: 6: Hoare triple {395#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {391#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:06:20,964 INFO L273 TraceCheckUtils]: 5: Hoare triple {327#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {395#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:20,964 INFO L256 TraceCheckUtils]: 4: Hoare triple {327#true} call #t~ret2 := main(); {327#true} is VALID [2018-11-23 10:06:20,965 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #48#return; {327#true} is VALID [2018-11-23 10:06:20,965 INFO L273 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2018-11-23 10:06:20,965 INFO L273 TraceCheckUtils]: 1: Hoare triple {327#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {327#true} is VALID [2018-11-23 10:06:20,966 INFO L256 TraceCheckUtils]: 0: Hoare triple {327#true} call ULTIMATE.init(); {327#true} is VALID [2018-11-23 10:06:20,966 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 10:06:20,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:06:20,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:06:20,969 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 10:06:20,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:06:20,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:06:21,033 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:21,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:06:21,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:06:21,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:06:21,035 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 6 states. [2018-11-23 10:06:21,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:21,292 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-23 10:06:21,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:06:21,292 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 10:06:21,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:06:21,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:06:21,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2018-11-23 10:06:21,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:06:21,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2018-11-23 10:06:21,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 37 transitions. [2018-11-23 10:06:21,371 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 10:06:21,373 INFO L225 Difference]: With dead ends: 33 [2018-11-23 10:06:21,373 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 10:06:21,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:06:21,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 10:06:21,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 10:06:21,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:06:21,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-23 10:06:21,391 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 10:06:21,391 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 10:06:21,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:21,393 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 10:06:21,393 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 10:06:21,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:21,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:21,394 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 10:06:21,394 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 10:06:21,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:21,397 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 10:06:21,397 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 10:06:21,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:21,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:21,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:06:21,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:06:21,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 10:06:21,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-11-23 10:06:21,400 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 14 [2018-11-23 10:06:21,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:06:21,400 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-11-23 10:06:21,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:06:21,401 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 10:06:21,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 10:06:21,401 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:06:21,402 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:06:21,402 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:06:21,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:06:21,402 INFO L82 PathProgramCache]: Analyzing trace with hash -94637390, now seen corresponding path program 2 times [2018-11-23 10:06:21,403 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:06:21,403 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 10:06:21,426 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:06:21,472 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:06:21,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:06:21,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:06:21,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:06:21,624 INFO L256 TraceCheckUtils]: 0: Hoare triple {544#true} call ULTIMATE.init(); {544#true} is VALID [2018-11-23 10:06:21,624 INFO L273 TraceCheckUtils]: 1: Hoare triple {544#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {544#true} is VALID [2018-11-23 10:06:21,624 INFO L273 TraceCheckUtils]: 2: Hoare triple {544#true} assume true; {544#true} is VALID [2018-11-23 10:06:21,625 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {544#true} {544#true} #48#return; {544#true} is VALID [2018-11-23 10:06:21,625 INFO L256 TraceCheckUtils]: 4: Hoare triple {544#true} call #t~ret2 := main(); {544#true} is VALID [2018-11-23 10:06:21,625 INFO L273 TraceCheckUtils]: 5: Hoare triple {544#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {564#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:06:21,626 INFO L273 TraceCheckUtils]: 6: Hoare triple {564#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {568#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:21,627 INFO L273 TraceCheckUtils]: 7: Hoare triple {568#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {572#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:06:21,630 INFO L273 TraceCheckUtils]: 8: Hoare triple {572#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {576#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:21,649 INFO L273 TraceCheckUtils]: 9: Hoare triple {576#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {580#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:06:21,663 INFO L273 TraceCheckUtils]: 10: Hoare triple {580#(= (_ bv4 32) main_~i~0)} assume !~bvslt32(~i~0, 100000bv32); {545#false} is VALID [2018-11-23 10:06:21,663 INFO L273 TraceCheckUtils]: 11: Hoare triple {545#false} havoc ~x~0;~x~0 := 0bv32; {545#false} is VALID [2018-11-23 10:06:21,664 INFO L273 TraceCheckUtils]: 12: Hoare triple {545#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {545#false} is VALID [2018-11-23 10:06:21,664 INFO L256 TraceCheckUtils]: 13: Hoare triple {545#false} call __VERIFIER_assert((if 42bv32 == #t~mem1 then 1bv32 else 0bv32)); {545#false} is VALID [2018-11-23 10:06:21,664 INFO L273 TraceCheckUtils]: 14: Hoare triple {545#false} ~cond := #in~cond; {545#false} is VALID [2018-11-23 10:06:21,665 INFO L273 TraceCheckUtils]: 15: Hoare triple {545#false} assume 0bv32 == ~cond; {545#false} is VALID [2018-11-23 10:06:21,665 INFO L273 TraceCheckUtils]: 16: Hoare triple {545#false} assume !false; {545#false} is VALID [2018-11-23 10:06:21,666 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:06:21,666 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:06:21,921 INFO L273 TraceCheckUtils]: 16: Hoare triple {545#false} assume !false; {545#false} is VALID [2018-11-23 10:06:21,922 INFO L273 TraceCheckUtils]: 15: Hoare triple {545#false} assume 0bv32 == ~cond; {545#false} is VALID [2018-11-23 10:06:21,922 INFO L273 TraceCheckUtils]: 14: Hoare triple {545#false} ~cond := #in~cond; {545#false} is VALID [2018-11-23 10:06:21,922 INFO L256 TraceCheckUtils]: 13: Hoare triple {545#false} call __VERIFIER_assert((if 42bv32 == #t~mem1 then 1bv32 else 0bv32)); {545#false} is VALID [2018-11-23 10:06:21,922 INFO L273 TraceCheckUtils]: 12: Hoare triple {545#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {545#false} is VALID [2018-11-23 10:06:21,923 INFO L273 TraceCheckUtils]: 11: Hoare triple {545#false} havoc ~x~0;~x~0 := 0bv32; {545#false} is VALID [2018-11-23 10:06:21,923 INFO L273 TraceCheckUtils]: 10: Hoare triple {620#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {545#false} is VALID [2018-11-23 10:06:21,924 INFO L273 TraceCheckUtils]: 9: Hoare triple {624#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {620#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:06:21,929 INFO L273 TraceCheckUtils]: 8: Hoare triple {628#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {624#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:21,932 INFO L273 TraceCheckUtils]: 7: Hoare triple {632#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {628#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:21,937 INFO L273 TraceCheckUtils]: 6: Hoare triple {636#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {632#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:21,938 INFO L273 TraceCheckUtils]: 5: Hoare triple {544#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {636#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:21,938 INFO L256 TraceCheckUtils]: 4: Hoare triple {544#true} call #t~ret2 := main(); {544#true} is VALID [2018-11-23 10:06:21,939 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {544#true} {544#true} #48#return; {544#true} is VALID [2018-11-23 10:06:21,939 INFO L273 TraceCheckUtils]: 2: Hoare triple {544#true} assume true; {544#true} is VALID [2018-11-23 10:06:21,939 INFO L273 TraceCheckUtils]: 1: Hoare triple {544#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {544#true} is VALID [2018-11-23 10:06:21,939 INFO L256 TraceCheckUtils]: 0: Hoare triple {544#true} call ULTIMATE.init(); {544#true} is VALID [2018-11-23 10:06:21,940 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:06:21,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:06:21,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 10:06:21,942 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-11-23 10:06:21,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:06:21,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 10:06:21,977 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:21,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 10:06:21,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 10:06:21,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 10:06:21,978 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 12 states. [2018-11-23 10:06:22,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:22,619 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-23 10:06:22,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 10:06:22,619 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-11-23 10:06:22,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:06:22,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:06:22,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 46 transitions. [2018-11-23 10:06:22,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:06:22,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 46 transitions. [2018-11-23 10:06:22,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 46 transitions. [2018-11-23 10:06:22,713 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:22,715 INFO L225 Difference]: With dead ends: 39 [2018-11-23 10:06:22,715 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 10:06:22,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 10:06:22,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 10:06:22,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 10:06:22,757 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:06:22,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-23 10:06:22,757 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 10:06:22,757 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 10:06:22,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:22,760 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 10:06:22,760 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 10:06:22,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:22,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:22,761 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 10:06:22,761 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 10:06:22,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:22,763 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 10:06:22,764 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 10:06:22,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:22,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:22,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:06:22,765 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:06:22,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 10:06:22,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-11-23 10:06:22,767 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 17 [2018-11-23 10:06:22,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:06:22,767 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-23 10:06:22,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 10:06:22,767 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 10:06:22,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 10:06:22,768 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:06:22,768 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:06:22,769 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:06:22,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:06:22,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1436083918, now seen corresponding path program 3 times [2018-11-23 10:06:22,770 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:06:22,770 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 10:06:22,793 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:06:23,016 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 10:06:23,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:06:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:06:23,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:06:23,418 INFO L256 TraceCheckUtils]: 0: Hoare triple {827#true} call ULTIMATE.init(); {827#true} is VALID [2018-11-23 10:06:23,419 INFO L273 TraceCheckUtils]: 1: Hoare triple {827#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {827#true} is VALID [2018-11-23 10:06:23,420 INFO L273 TraceCheckUtils]: 2: Hoare triple {827#true} assume true; {827#true} is VALID [2018-11-23 10:06:23,420 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {827#true} {827#true} #48#return; {827#true} is VALID [2018-11-23 10:06:23,420 INFO L256 TraceCheckUtils]: 4: Hoare triple {827#true} call #t~ret2 := main(); {827#true} is VALID [2018-11-23 10:06:23,421 INFO L273 TraceCheckUtils]: 5: Hoare triple {827#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {847#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:06:23,422 INFO L273 TraceCheckUtils]: 6: Hoare triple {847#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {851#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:23,423 INFO L273 TraceCheckUtils]: 7: Hoare triple {851#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {855#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:23,424 INFO L273 TraceCheckUtils]: 8: Hoare triple {855#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {859#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:23,424 INFO L273 TraceCheckUtils]: 9: Hoare triple {859#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {863#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:23,425 INFO L273 TraceCheckUtils]: 10: Hoare triple {863#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {867#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:23,426 INFO L273 TraceCheckUtils]: 11: Hoare triple {867#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {871#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:06:23,428 INFO L273 TraceCheckUtils]: 12: Hoare triple {871#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {875#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:23,429 INFO L273 TraceCheckUtils]: 13: Hoare triple {875#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {879#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:23,430 INFO L273 TraceCheckUtils]: 14: Hoare triple {879#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {883#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:23,431 INFO L273 TraceCheckUtils]: 15: Hoare triple {883#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {887#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 10:06:23,431 INFO L273 TraceCheckUtils]: 16: Hoare triple {887#(= (_ bv10 32) main_~i~0)} assume !~bvslt32(~i~0, 100000bv32); {828#false} is VALID [2018-11-23 10:06:23,432 INFO L273 TraceCheckUtils]: 17: Hoare triple {828#false} havoc ~x~0;~x~0 := 0bv32; {828#false} is VALID [2018-11-23 10:06:23,432 INFO L273 TraceCheckUtils]: 18: Hoare triple {828#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {828#false} is VALID [2018-11-23 10:06:23,433 INFO L256 TraceCheckUtils]: 19: Hoare triple {828#false} call __VERIFIER_assert((if 42bv32 == #t~mem1 then 1bv32 else 0bv32)); {828#false} is VALID [2018-11-23 10:06:23,434 INFO L273 TraceCheckUtils]: 20: Hoare triple {828#false} ~cond := #in~cond; {828#false} is VALID [2018-11-23 10:06:23,434 INFO L273 TraceCheckUtils]: 21: Hoare triple {828#false} assume 0bv32 == ~cond; {828#false} is VALID [2018-11-23 10:06:23,435 INFO L273 TraceCheckUtils]: 22: Hoare triple {828#false} assume !false; {828#false} is VALID [2018-11-23 10:06:23,436 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:06:23,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:06:23,900 INFO L273 TraceCheckUtils]: 22: Hoare triple {828#false} assume !false; {828#false} is VALID [2018-11-23 10:06:23,900 INFO L273 TraceCheckUtils]: 21: Hoare triple {828#false} assume 0bv32 == ~cond; {828#false} is VALID [2018-11-23 10:06:23,901 INFO L273 TraceCheckUtils]: 20: Hoare triple {828#false} ~cond := #in~cond; {828#false} is VALID [2018-11-23 10:06:23,901 INFO L256 TraceCheckUtils]: 19: Hoare triple {828#false} call __VERIFIER_assert((if 42bv32 == #t~mem1 then 1bv32 else 0bv32)); {828#false} is VALID [2018-11-23 10:06:23,902 INFO L273 TraceCheckUtils]: 18: Hoare triple {828#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {828#false} is VALID [2018-11-23 10:06:23,902 INFO L273 TraceCheckUtils]: 17: Hoare triple {828#false} havoc ~x~0;~x~0 := 0bv32; {828#false} is VALID [2018-11-23 10:06:23,904 INFO L273 TraceCheckUtils]: 16: Hoare triple {927#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {828#false} is VALID [2018-11-23 10:06:23,905 INFO L273 TraceCheckUtils]: 15: Hoare triple {931#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {927#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:06:23,911 INFO L273 TraceCheckUtils]: 14: Hoare triple {935#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {931#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,915 INFO L273 TraceCheckUtils]: 13: Hoare triple {939#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {935#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,930 INFO L273 TraceCheckUtils]: 12: Hoare triple {943#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {939#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,934 INFO L273 TraceCheckUtils]: 11: Hoare triple {947#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {943#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,940 INFO L273 TraceCheckUtils]: 10: Hoare triple {951#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {947#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,945 INFO L273 TraceCheckUtils]: 9: Hoare triple {955#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {951#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,952 INFO L273 TraceCheckUtils]: 8: Hoare triple {959#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {955#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,959 INFO L273 TraceCheckUtils]: 7: Hoare triple {963#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {959#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,964 INFO L273 TraceCheckUtils]: 6: Hoare triple {967#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {963#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,968 INFO L273 TraceCheckUtils]: 5: Hoare triple {827#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {967#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,968 INFO L256 TraceCheckUtils]: 4: Hoare triple {827#true} call #t~ret2 := main(); {827#true} is VALID [2018-11-23 10:06:23,969 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {827#true} {827#true} #48#return; {827#true} is VALID [2018-11-23 10:06:23,969 INFO L273 TraceCheckUtils]: 2: Hoare triple {827#true} assume true; {827#true} is VALID [2018-11-23 10:06:23,970 INFO L273 TraceCheckUtils]: 1: Hoare triple {827#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {827#true} is VALID [2018-11-23 10:06:23,970 INFO L256 TraceCheckUtils]: 0: Hoare triple {827#true} call ULTIMATE.init(); {827#true} is VALID [2018-11-23 10:06:23,971 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:06:23,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:06:23,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 10:06:23,974 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-11-23 10:06:23,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:06:23,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 10:06:24,048 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:24,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 10:06:24,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 10:06:24,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 10:06:24,049 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 24 states. [2018-11-23 10:06:26,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:26,608 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2018-11-23 10:06:26,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 10:06:26,609 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-11-23 10:06:26,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:06:26,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:06:26,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 64 transitions. [2018-11-23 10:06:26,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:06:26,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 64 transitions. [2018-11-23 10:06:26,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 64 transitions. [2018-11-23 10:06:26,735 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:26,736 INFO L225 Difference]: With dead ends: 51 [2018-11-23 10:06:26,736 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 10:06:26,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 10:06:26,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 10:06:26,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 10:06:26,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:06:26,805 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-23 10:06:26,806 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 10:06:26,806 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 10:06:26,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:26,809 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 10:06:26,809 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 10:06:26,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:26,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:26,810 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 10:06:26,810 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 10:06:26,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:26,813 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 10:06:26,813 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 10:06:26,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:26,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:26,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:06:26,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:06:26,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 10:06:26,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-11-23 10:06:26,817 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 23 [2018-11-23 10:06:26,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:06:26,817 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-11-23 10:06:26,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 10:06:26,817 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 10:06:26,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 10:06:26,819 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:06:26,819 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:06:26,819 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:06:26,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:06:26,820 INFO L82 PathProgramCache]: Analyzing trace with hash 841008690, now seen corresponding path program 4 times [2018-11-23 10:06:26,820 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:06:26,821 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 10:06:26,837 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 10:06:26,915 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 10:06:26,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:06:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:06:26,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:06:27,648 INFO L256 TraceCheckUtils]: 0: Hoare triple {1242#true} call ULTIMATE.init(); {1242#true} is VALID [2018-11-23 10:06:27,649 INFO L273 TraceCheckUtils]: 1: Hoare triple {1242#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1242#true} is VALID [2018-11-23 10:06:27,649 INFO L273 TraceCheckUtils]: 2: Hoare triple {1242#true} assume true; {1242#true} is VALID [2018-11-23 10:06:27,649 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1242#true} {1242#true} #48#return; {1242#true} is VALID [2018-11-23 10:06:27,650 INFO L256 TraceCheckUtils]: 4: Hoare triple {1242#true} call #t~ret2 := main(); {1242#true} is VALID [2018-11-23 10:06:27,652 INFO L273 TraceCheckUtils]: 5: Hoare triple {1242#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {1262#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:06:27,653 INFO L273 TraceCheckUtils]: 6: Hoare triple {1262#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1266#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:27,654 INFO L273 TraceCheckUtils]: 7: Hoare triple {1266#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1270#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:27,657 INFO L273 TraceCheckUtils]: 8: Hoare triple {1270#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1274#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:27,657 INFO L273 TraceCheckUtils]: 9: Hoare triple {1274#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1278#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:27,658 INFO L273 TraceCheckUtils]: 10: Hoare triple {1278#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1282#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:27,659 INFO L273 TraceCheckUtils]: 11: Hoare triple {1282#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1286#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:06:27,659 INFO L273 TraceCheckUtils]: 12: Hoare triple {1286#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1290#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:27,660 INFO L273 TraceCheckUtils]: 13: Hoare triple {1290#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1294#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:06:27,661 INFO L273 TraceCheckUtils]: 14: Hoare triple {1294#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1298#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:27,662 INFO L273 TraceCheckUtils]: 15: Hoare triple {1298#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1302#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:27,662 INFO L273 TraceCheckUtils]: 16: Hoare triple {1302#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1306#(= (_ bv11 32) main_~i~0)} is VALID [2018-11-23 10:06:27,663 INFO L273 TraceCheckUtils]: 17: Hoare triple {1306#(= (_ bv11 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1310#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:27,663 INFO L273 TraceCheckUtils]: 18: Hoare triple {1310#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1314#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:27,664 INFO L273 TraceCheckUtils]: 19: Hoare triple {1314#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1318#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:27,666 INFO L273 TraceCheckUtils]: 20: Hoare triple {1318#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1322#(= (_ bv15 32) main_~i~0)} is VALID [2018-11-23 10:06:27,667 INFO L273 TraceCheckUtils]: 21: Hoare triple {1322#(= (_ bv15 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1326#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:27,668 INFO L273 TraceCheckUtils]: 22: Hoare triple {1326#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1330#(= (_ bv17 32) main_~i~0)} is VALID [2018-11-23 10:06:27,669 INFO L273 TraceCheckUtils]: 23: Hoare triple {1330#(= (_ bv17 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1334#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:27,670 INFO L273 TraceCheckUtils]: 24: Hoare triple {1334#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1338#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:27,671 INFO L273 TraceCheckUtils]: 25: Hoare triple {1338#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1342#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-23 10:06:27,673 INFO L273 TraceCheckUtils]: 26: Hoare triple {1342#(= (_ bv20 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1346#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:27,674 INFO L273 TraceCheckUtils]: 27: Hoare triple {1346#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1350#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:27,674 INFO L273 TraceCheckUtils]: 28: Hoare triple {1350#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {1243#false} is VALID [2018-11-23 10:06:27,675 INFO L273 TraceCheckUtils]: 29: Hoare triple {1243#false} havoc ~x~0;~x~0 := 0bv32; {1243#false} is VALID [2018-11-23 10:06:27,675 INFO L273 TraceCheckUtils]: 30: Hoare triple {1243#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1243#false} is VALID [2018-11-23 10:06:27,675 INFO L256 TraceCheckUtils]: 31: Hoare triple {1243#false} call __VERIFIER_assert((if 42bv32 == #t~mem1 then 1bv32 else 0bv32)); {1243#false} is VALID [2018-11-23 10:06:27,676 INFO L273 TraceCheckUtils]: 32: Hoare triple {1243#false} ~cond := #in~cond; {1243#false} is VALID [2018-11-23 10:06:27,676 INFO L273 TraceCheckUtils]: 33: Hoare triple {1243#false} assume 0bv32 == ~cond; {1243#false} is VALID [2018-11-23 10:06:27,676 INFO L273 TraceCheckUtils]: 34: Hoare triple {1243#false} assume !false; {1243#false} is VALID [2018-11-23 10:06:27,679 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:06:27,679 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:06:29,506 INFO L273 TraceCheckUtils]: 34: Hoare triple {1243#false} assume !false; {1243#false} is VALID [2018-11-23 10:06:29,506 INFO L273 TraceCheckUtils]: 33: Hoare triple {1243#false} assume 0bv32 == ~cond; {1243#false} is VALID [2018-11-23 10:06:29,507 INFO L273 TraceCheckUtils]: 32: Hoare triple {1243#false} ~cond := #in~cond; {1243#false} is VALID [2018-11-23 10:06:29,507 INFO L256 TraceCheckUtils]: 31: Hoare triple {1243#false} call __VERIFIER_assert((if 42bv32 == #t~mem1 then 1bv32 else 0bv32)); {1243#false} is VALID [2018-11-23 10:06:29,507 INFO L273 TraceCheckUtils]: 30: Hoare triple {1243#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1243#false} is VALID [2018-11-23 10:06:29,507 INFO L273 TraceCheckUtils]: 29: Hoare triple {1243#false} havoc ~x~0;~x~0 := 0bv32; {1243#false} is VALID [2018-11-23 10:06:29,509 INFO L273 TraceCheckUtils]: 28: Hoare triple {1390#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1243#false} is VALID [2018-11-23 10:06:29,509 INFO L273 TraceCheckUtils]: 27: Hoare triple {1394#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1390#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:06:29,514 INFO L273 TraceCheckUtils]: 26: Hoare triple {1398#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1394#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:29,519 INFO L273 TraceCheckUtils]: 25: Hoare triple {1402#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1398#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:29,526 INFO L273 TraceCheckUtils]: 24: Hoare triple {1406#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1402#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:29,530 INFO L273 TraceCheckUtils]: 23: Hoare triple {1410#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1406#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:29,535 INFO L273 TraceCheckUtils]: 22: Hoare triple {1414#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1410#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:29,540 INFO L273 TraceCheckUtils]: 21: Hoare triple {1418#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1414#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:29,547 INFO L273 TraceCheckUtils]: 20: Hoare triple {1422#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1418#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:29,550 INFO L273 TraceCheckUtils]: 19: Hoare triple {1426#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1422#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:29,558 INFO L273 TraceCheckUtils]: 18: Hoare triple {1430#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1426#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:29,564 INFO L273 TraceCheckUtils]: 17: Hoare triple {1434#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1430#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:29,567 INFO L273 TraceCheckUtils]: 16: Hoare triple {1438#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1434#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:29,575 INFO L273 TraceCheckUtils]: 15: Hoare triple {1442#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1438#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:29,580 INFO L273 TraceCheckUtils]: 14: Hoare triple {1446#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1442#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:29,586 INFO L273 TraceCheckUtils]: 13: Hoare triple {1450#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1446#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:29,591 INFO L273 TraceCheckUtils]: 12: Hoare triple {1454#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1450#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:29,596 INFO L273 TraceCheckUtils]: 11: Hoare triple {1458#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1454#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:29,601 INFO L273 TraceCheckUtils]: 10: Hoare triple {1462#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1458#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:29,606 INFO L273 TraceCheckUtils]: 9: Hoare triple {1466#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1462#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:29,611 INFO L273 TraceCheckUtils]: 8: Hoare triple {1470#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1466#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:29,616 INFO L273 TraceCheckUtils]: 7: Hoare triple {1474#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1470#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:29,621 INFO L273 TraceCheckUtils]: 6: Hoare triple {1478#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1474#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:29,622 INFO L273 TraceCheckUtils]: 5: Hoare triple {1242#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {1478#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:29,622 INFO L256 TraceCheckUtils]: 4: Hoare triple {1242#true} call #t~ret2 := main(); {1242#true} is VALID [2018-11-23 10:06:29,622 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1242#true} {1242#true} #48#return; {1242#true} is VALID [2018-11-23 10:06:29,622 INFO L273 TraceCheckUtils]: 2: Hoare triple {1242#true} assume true; {1242#true} is VALID [2018-11-23 10:06:29,623 INFO L273 TraceCheckUtils]: 1: Hoare triple {1242#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1242#true} is VALID [2018-11-23 10:06:29,623 INFO L256 TraceCheckUtils]: 0: Hoare triple {1242#true} call ULTIMATE.init(); {1242#true} is VALID [2018-11-23 10:06:29,626 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:06:29,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:06:29,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 10:06:29,632 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 35 [2018-11-23 10:06:29,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:06:29,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 10:06:29,812 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:29,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 10:06:29,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 10:06:29,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 10:06:29,814 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 48 states. [2018-11-23 10:06:33,724 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 10:06:34,198 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 10:06:34,856 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 10:06:35,402 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 10:06:35,940 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 10:06:36,501 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 10:06:37,053 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-23 10:06:37,656 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 7 [2018-11-23 10:06:43,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:43,720 INFO L93 Difference]: Finished difference Result 75 states and 100 transitions. [2018-11-23 10:06:43,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 10:06:43,720 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 35 [2018-11-23 10:06:43,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:06:43,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:06:43,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 100 transitions. [2018-11-23 10:06:43,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:06:43,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 100 transitions. [2018-11-23 10:06:43,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 100 transitions. [2018-11-23 10:06:43,971 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:43,973 INFO L225 Difference]: With dead ends: 75 [2018-11-23 10:06:43,973 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 10:06:43,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 10:06:43,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 10:06:44,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-23 10:06:44,105 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:06:44,105 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 64 states. [2018-11-23 10:06:44,105 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-23 10:06:44,106 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-23 10:06:44,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:44,108 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-11-23 10:06:44,108 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-11-23 10:06:44,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:44,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:44,109 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-23 10:06:44,110 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-23 10:06:44,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:44,112 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-11-23 10:06:44,112 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-11-23 10:06:44,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:44,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:44,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:06:44,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:06:44,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 10:06:44,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-11-23 10:06:44,116 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 35 [2018-11-23 10:06:44,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:06:44,117 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-11-23 10:06:44,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 10:06:44,117 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-11-23 10:06:44,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 10:06:44,119 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:06:44,119 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:06:44,119 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:06:44,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:06:44,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1216454706, now seen corresponding path program 5 times [2018-11-23 10:06:44,120 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:06:44,120 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 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 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:06:44,143 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1