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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf -i ../../../trunk/examples/svcomp/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:05:52,543 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:05:52,545 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:05:52,559 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:05:52,559 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:05:52,560 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:05:52,562 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:05:52,571 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:05:52,573 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:05:52,573 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:05:52,574 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:05:52,575 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:05:52,576 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:05:52,577 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:05:52,578 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:05:52,579 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:05:52,580 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:05:52,582 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:05:52,584 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:05:52,585 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:05:52,586 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:05:52,587 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:05:52,590 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:05:52,590 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:05:52,590 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:05:52,591 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:05:52,592 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:05:52,593 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:05:52,594 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:05:52,595 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:05:52,595 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:05:52,596 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:05:52,596 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:05:52,597 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:05:52,598 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:05:52,598 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:05:52,599 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf [2018-11-14 18:05:52,615 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:05:52,615 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:05:52,616 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:05:52,616 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:05:52,616 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:05:52,617 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:05:52,617 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:05:52,617 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:05:52,617 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:05:52,617 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:05:52,619 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:05:52,619 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:05:52,619 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:05:52,619 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:05:52,619 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:05:52,620 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:05:52,621 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:05:52,621 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:05:52,621 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:05:52,621 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:05:52,622 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:05:52,622 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:05:52,622 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:05:52,622 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:05:52,622 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:05:52,623 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:05:52,623 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:05:52,623 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:05:52,623 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:05:52,624 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:05:52,624 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:05:52,624 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:05:52,624 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:05:52,669 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:05:52,687 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:05:52,691 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:05:52,692 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:05:52,693 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:05:52,694 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-14 18:05:52,753 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e646d7bd4/81944fe7defc435aaa79cca29fa6ba4e/FLAGf3164b17e [2018-11-14 18:05:53,246 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:05:53,247 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-14 18:05:53,262 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e646d7bd4/81944fe7defc435aaa79cca29fa6ba4e/FLAGf3164b17e [2018-11-14 18:05:53,284 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e646d7bd4/81944fe7defc435aaa79cca29fa6ba4e [2018-11-14 18:05:53,295 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:05:53,296 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:05:53,297 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:05:53,298 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:05:53,303 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:05:53,305 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:05:53" (1/1) ... [2018-11-14 18:05:53,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65c85c77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:05:53, skipping insertion in model container [2018-11-14 18:05:53,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:05:53" (1/1) ... [2018-11-14 18:05:53,318 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:05:53,355 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:05:53,620 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:05:53,626 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:05:53,668 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:05:53,685 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:05:53,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:05:53 WrapperNode [2018-11-14 18:05:53,686 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:05:53,687 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:05:53,687 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:05:53,687 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:05:53,700 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:05:53" (1/1) ... [2018-11-14 18:05:53,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:05:53" (1/1) ... [2018-11-14 18:05:53,708 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:05:53" (1/1) ... [2018-11-14 18:05:53,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:05:53" (1/1) ... [2018-11-14 18:05:53,720 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:05:53" (1/1) ... [2018-11-14 18:05:53,735 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:05:53" (1/1) ... [2018-11-14 18:05:53,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:05:53" (1/1) ... [2018-11-14 18:05:53,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:05:53,742 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:05:53,742 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:05:53,742 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:05:53,744 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:05:53" (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-14 18:05:53,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:05:53,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:05:53,864 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:05:53,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:05:53,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:05:53,864 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:05:53,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:05:53,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:05:54,825 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:05:54,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:05:54 BoogieIcfgContainer [2018-11-14 18:05:54,826 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:05:54,827 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:05:54,827 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:05:54,831 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:05:54,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:05:53" (1/3) ... [2018-11-14 18:05:54,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea101dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:05:54, skipping insertion in model container [2018-11-14 18:05:54,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:05:53" (2/3) ... [2018-11-14 18:05:54,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea101dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:05:54, skipping insertion in model container [2018-11-14 18:05:54,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:05:54" (3/3) ... [2018-11-14 18:05:54,835 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-14 18:05:54,845 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:05:54,853 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:05:54,871 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:05:54,901 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:05:54,902 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:05:54,902 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:05:54,902 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:05:54,902 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:05:54,903 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:05:54,903 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:05:54,903 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:05:54,903 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:05:54,925 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-11-14 18:05:54,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 18:05:54,933 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:05:54,934 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:05:54,936 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:05:54,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:05:54,941 INFO L82 PathProgramCache]: Analyzing trace with hash -731061561, now seen corresponding path program 1 times [2018-11-14 18:05:54,945 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:05:54,945 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-14 18:05:54,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:05:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:55,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:05:55,360 INFO L256 TraceCheckUtils]: 0: Hoare triple {57#true} call ULTIMATE.init(); {57#true} is VALID [2018-11-14 18:05:55,364 INFO L273 TraceCheckUtils]: 1: Hoare triple {57#true} assume true; {57#true} is VALID [2018-11-14 18:05:55,364 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {57#true} {57#true} #249#return; {57#true} is VALID [2018-11-14 18:05:55,365 INFO L256 TraceCheckUtils]: 3: Hoare triple {57#true} call #t~ret14 := main(); {57#true} is VALID [2018-11-14 18:05:55,365 INFO L273 TraceCheckUtils]: 4: Hoare triple {57#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {57#true} is VALID [2018-11-14 18:05:55,365 INFO L273 TraceCheckUtils]: 5: Hoare triple {57#true} assume true; {57#true} is VALID [2018-11-14 18:05:55,366 INFO L273 TraceCheckUtils]: 6: Hoare triple {57#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {57#true} is VALID [2018-11-14 18:05:55,366 INFO L273 TraceCheckUtils]: 7: Hoare triple {57#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {57#true} is VALID [2018-11-14 18:05:55,368 INFO L273 TraceCheckUtils]: 8: Hoare triple {57#true} assume ~p1~0 != 0bv32;~lk1~0 := 1bv32; {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:55,370 INFO L273 TraceCheckUtils]: 9: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p2~0 != 0bv32;~lk2~0 := 1bv32; {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:55,373 INFO L273 TraceCheckUtils]: 10: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:55,373 INFO L273 TraceCheckUtils]: 11: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:55,375 INFO L273 TraceCheckUtils]: 12: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:55,378 INFO L273 TraceCheckUtils]: 13: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:55,380 INFO L273 TraceCheckUtils]: 14: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:55,382 INFO L273 TraceCheckUtils]: 15: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:55,383 INFO L273 TraceCheckUtils]: 16: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:55,384 INFO L273 TraceCheckUtils]: 17: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:55,384 INFO L273 TraceCheckUtils]: 18: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:55,386 INFO L273 TraceCheckUtils]: 19: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:55,386 INFO L273 TraceCheckUtils]: 20: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p13~0 != 0bv32); {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:55,405 INFO L273 TraceCheckUtils]: 21: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p1~0 != 0bv32; {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:55,406 INFO L273 TraceCheckUtils]: 22: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk1~0 != 1bv32; {58#false} is VALID [2018-11-14 18:05:55,406 INFO L273 TraceCheckUtils]: 23: Hoare triple {58#false} assume !false; {58#false} is VALID [2018-11-14 18:05:55,413 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-14 18:05:55,414 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:05:55,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:05:55,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:05:55,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-14 18:05:55,433 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:05:55,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:05:55,495 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:55,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:05:55,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:05:55,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:05:55,507 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 3 states. [2018-11-14 18:05:56,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:56,670 INFO L93 Difference]: Finished difference Result 107 states and 188 transitions. [2018-11-14 18:05:56,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:05:56,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-14 18:05:56,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:05:56,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:56,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2018-11-14 18:05:56,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:56,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2018-11-14 18:05:56,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 188 transitions. [2018-11-14 18:05:57,289 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:57,308 INFO L225 Difference]: With dead ends: 107 [2018-11-14 18:05:57,309 INFO L226 Difference]: Without dead ends: 92 [2018-11-14 18:05:57,313 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:05:57,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-14 18:05:57,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 63. [2018-11-14 18:05:57,359 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:05:57,360 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 63 states. [2018-11-14 18:05:57,360 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 63 states. [2018-11-14 18:05:57,360 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 63 states. [2018-11-14 18:05:57,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:57,371 INFO L93 Difference]: Finished difference Result 92 states and 166 transitions. [2018-11-14 18:05:57,371 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 166 transitions. [2018-11-14 18:05:57,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:57,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:57,373 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 92 states. [2018-11-14 18:05:57,373 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 92 states. [2018-11-14 18:05:57,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:57,383 INFO L93 Difference]: Finished difference Result 92 states and 166 transitions. [2018-11-14 18:05:57,383 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 166 transitions. [2018-11-14 18:05:57,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:57,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:57,385 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:05:57,386 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:05:57,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-14 18:05:57,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 114 transitions. [2018-11-14 18:05:57,393 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 114 transitions. Word has length 24 [2018-11-14 18:05:57,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:05:57,394 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 114 transitions. [2018-11-14 18:05:57,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:05:57,394 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 114 transitions. [2018-11-14 18:05:57,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 18:05:57,395 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:05:57,395 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:05:57,396 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:05:57,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:05:57,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1752129915, now seen corresponding path program 1 times [2018-11-14 18:05:57,397 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:05:57,397 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-14 18:05:57,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:05:57,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:57,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:05:57,566 INFO L256 TraceCheckUtils]: 0: Hoare triple {503#true} call ULTIMATE.init(); {503#true} is VALID [2018-11-14 18:05:57,567 INFO L273 TraceCheckUtils]: 1: Hoare triple {503#true} assume true; {503#true} is VALID [2018-11-14 18:05:57,567 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {503#true} {503#true} #249#return; {503#true} is VALID [2018-11-14 18:05:57,568 INFO L256 TraceCheckUtils]: 3: Hoare triple {503#true} call #t~ret14 := main(); {503#true} is VALID [2018-11-14 18:05:57,568 INFO L273 TraceCheckUtils]: 4: Hoare triple {503#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {503#true} is VALID [2018-11-14 18:05:57,569 INFO L273 TraceCheckUtils]: 5: Hoare triple {503#true} assume true; {503#true} is VALID [2018-11-14 18:05:57,569 INFO L273 TraceCheckUtils]: 6: Hoare triple {503#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {503#true} is VALID [2018-11-14 18:05:57,570 INFO L273 TraceCheckUtils]: 7: Hoare triple {503#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {503#true} is VALID [2018-11-14 18:05:57,571 INFO L273 TraceCheckUtils]: 8: Hoare triple {503#true} assume !(~p1~0 != 0bv32); {532#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:05:57,571 INFO L273 TraceCheckUtils]: 9: Hoare triple {532#(= (_ bv0 32) main_~p1~0)} assume ~p2~0 != 0bv32;~lk2~0 := 1bv32; {532#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:05:57,572 INFO L273 TraceCheckUtils]: 10: Hoare triple {532#(= (_ bv0 32) main_~p1~0)} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {532#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:05:57,574 INFO L273 TraceCheckUtils]: 11: Hoare triple {532#(= (_ bv0 32) main_~p1~0)} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {532#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:05:57,574 INFO L273 TraceCheckUtils]: 12: Hoare triple {532#(= (_ bv0 32) main_~p1~0)} assume !(~p5~0 != 0bv32); {532#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:05:57,576 INFO L273 TraceCheckUtils]: 13: Hoare triple {532#(= (_ bv0 32) main_~p1~0)} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {532#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:05:57,576 INFO L273 TraceCheckUtils]: 14: Hoare triple {532#(= (_ bv0 32) main_~p1~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {532#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:05:57,578 INFO L273 TraceCheckUtils]: 15: Hoare triple {532#(= (_ bv0 32) main_~p1~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {532#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:05:57,578 INFO L273 TraceCheckUtils]: 16: Hoare triple {532#(= (_ bv0 32) main_~p1~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {532#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:05:57,579 INFO L273 TraceCheckUtils]: 17: Hoare triple {532#(= (_ bv0 32) main_~p1~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {532#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:05:57,581 INFO L273 TraceCheckUtils]: 18: Hoare triple {532#(= (_ bv0 32) main_~p1~0)} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {532#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:05:57,581 INFO L273 TraceCheckUtils]: 19: Hoare triple {532#(= (_ bv0 32) main_~p1~0)} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {532#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:05:57,583 INFO L273 TraceCheckUtils]: 20: Hoare triple {532#(= (_ bv0 32) main_~p1~0)} assume !(~p13~0 != 0bv32); {532#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:05:57,584 INFO L273 TraceCheckUtils]: 21: Hoare triple {532#(= (_ bv0 32) main_~p1~0)} assume ~p1~0 != 0bv32; {504#false} is VALID [2018-11-14 18:05:57,584 INFO L273 TraceCheckUtils]: 22: Hoare triple {504#false} assume ~lk1~0 != 1bv32; {504#false} is VALID [2018-11-14 18:05:57,584 INFO L273 TraceCheckUtils]: 23: Hoare triple {504#false} assume !false; {504#false} is VALID [2018-11-14 18:05:57,587 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-14 18:05:57,587 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:05:57,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:05:57,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:05:57,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-14 18:05:57,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:05:57,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:05:57,624 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:57,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:05:57,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:05:57,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:05:57,625 INFO L87 Difference]: Start difference. First operand 63 states and 114 transitions. Second operand 3 states. [2018-11-14 18:05:57,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:57,999 INFO L93 Difference]: Finished difference Result 150 states and 275 transitions. [2018-11-14 18:05:57,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:05:57,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-14 18:05:58,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:05:58,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:58,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2018-11-14 18:05:58,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:58,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2018-11-14 18:05:58,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 248 transitions. [2018-11-14 18:05:58,474 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 248 edges. 248 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:58,478 INFO L225 Difference]: With dead ends: 150 [2018-11-14 18:05:58,478 INFO L226 Difference]: Without dead ends: 92 [2018-11-14 18:05:58,480 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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-14 18:05:58,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-14 18:05:58,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-11-14 18:05:58,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:05:58,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 90 states. [2018-11-14 18:05:58,560 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 90 states. [2018-11-14 18:05:58,561 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 90 states. [2018-11-14 18:05:58,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:58,567 INFO L93 Difference]: Finished difference Result 92 states and 164 transitions. [2018-11-14 18:05:58,567 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 164 transitions. [2018-11-14 18:05:58,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:58,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:58,569 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 92 states. [2018-11-14 18:05:58,569 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 92 states. [2018-11-14 18:05:58,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:58,575 INFO L93 Difference]: Finished difference Result 92 states and 164 transitions. [2018-11-14 18:05:58,575 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 164 transitions. [2018-11-14 18:05:58,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:58,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:58,577 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:05:58,577 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:05:58,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-14 18:05:58,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 163 transitions. [2018-11-14 18:05:58,582 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 163 transitions. Word has length 24 [2018-11-14 18:05:58,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:05:58,583 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 163 transitions. [2018-11-14 18:05:58,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:05:58,583 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 163 transitions. [2018-11-14 18:05:58,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 18:05:58,584 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:05:58,584 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:05:58,585 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:05:58,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:05:58,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1187859502, now seen corresponding path program 1 times [2018-11-14 18:05:58,586 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:05:58,586 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-14 18:05:58,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:05:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:58,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:58,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:05:58,716 INFO L256 TraceCheckUtils]: 0: Hoare triple {1018#true} call ULTIMATE.init(); {1018#true} is VALID [2018-11-14 18:05:58,716 INFO L273 TraceCheckUtils]: 1: Hoare triple {1018#true} assume true; {1018#true} is VALID [2018-11-14 18:05:58,717 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1018#true} {1018#true} #249#return; {1018#true} is VALID [2018-11-14 18:05:58,717 INFO L256 TraceCheckUtils]: 3: Hoare triple {1018#true} call #t~ret14 := main(); {1018#true} is VALID [2018-11-14 18:05:58,717 INFO L273 TraceCheckUtils]: 4: Hoare triple {1018#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {1018#true} is VALID [2018-11-14 18:05:58,718 INFO L273 TraceCheckUtils]: 5: Hoare triple {1018#true} assume true; {1018#true} is VALID [2018-11-14 18:05:58,718 INFO L273 TraceCheckUtils]: 6: Hoare triple {1018#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {1018#true} is VALID [2018-11-14 18:05:58,719 INFO L273 TraceCheckUtils]: 7: Hoare triple {1018#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {1018#true} is VALID [2018-11-14 18:05:58,722 INFO L273 TraceCheckUtils]: 8: Hoare triple {1018#true} assume ~p1~0 != 0bv32;~lk1~0 := 1bv32; {1047#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:05:58,723 INFO L273 TraceCheckUtils]: 9: Hoare triple {1047#(not (= (_ bv0 32) main_~p1~0))} assume ~p2~0 != 0bv32;~lk2~0 := 1bv32; {1047#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:05:58,736 INFO L273 TraceCheckUtils]: 10: Hoare triple {1047#(not (= (_ bv0 32) main_~p1~0))} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {1047#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:05:58,737 INFO L273 TraceCheckUtils]: 11: Hoare triple {1047#(not (= (_ bv0 32) main_~p1~0))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {1047#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:05:58,741 INFO L273 TraceCheckUtils]: 12: Hoare triple {1047#(not (= (_ bv0 32) main_~p1~0))} assume !(~p5~0 != 0bv32); {1047#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:05:58,741 INFO L273 TraceCheckUtils]: 13: Hoare triple {1047#(not (= (_ bv0 32) main_~p1~0))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {1047#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:05:58,743 INFO L273 TraceCheckUtils]: 14: Hoare triple {1047#(not (= (_ bv0 32) main_~p1~0))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {1047#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:05:58,745 INFO L273 TraceCheckUtils]: 15: Hoare triple {1047#(not (= (_ bv0 32) main_~p1~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {1047#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:05:58,745 INFO L273 TraceCheckUtils]: 16: Hoare triple {1047#(not (= (_ bv0 32) main_~p1~0))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {1047#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:05:58,747 INFO L273 TraceCheckUtils]: 17: Hoare triple {1047#(not (= (_ bv0 32) main_~p1~0))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {1047#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:05:58,747 INFO L273 TraceCheckUtils]: 18: Hoare triple {1047#(not (= (_ bv0 32) main_~p1~0))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {1047#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:05:58,749 INFO L273 TraceCheckUtils]: 19: Hoare triple {1047#(not (= (_ bv0 32) main_~p1~0))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {1047#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:05:58,749 INFO L273 TraceCheckUtils]: 20: Hoare triple {1047#(not (= (_ bv0 32) main_~p1~0))} assume !(~p13~0 != 0bv32); {1047#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:05:58,752 INFO L273 TraceCheckUtils]: 21: Hoare triple {1047#(not (= (_ bv0 32) main_~p1~0))} assume !(~p1~0 != 0bv32); {1019#false} is VALID [2018-11-14 18:05:58,752 INFO L273 TraceCheckUtils]: 22: Hoare triple {1019#false} assume ~p2~0 != 0bv32; {1019#false} is VALID [2018-11-14 18:05:58,752 INFO L273 TraceCheckUtils]: 23: Hoare triple {1019#false} assume ~lk2~0 != 1bv32; {1019#false} is VALID [2018-11-14 18:05:58,753 INFO L273 TraceCheckUtils]: 24: Hoare triple {1019#false} assume !false; {1019#false} is VALID [2018-11-14 18:05:58,754 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-14 18:05:58,754 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:05:58,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:05:58,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:05:58,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 18:05:58,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:05:58,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:05:58,846 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:58,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:05:58,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:05:58,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:05:58,847 INFO L87 Difference]: Start difference. First operand 90 states and 163 transitions. Second operand 3 states. [2018-11-14 18:05:59,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:59,130 INFO L93 Difference]: Finished difference Result 139 states and 247 transitions. [2018-11-14 18:05:59,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:05:59,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 18:05:59,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:05:59,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:59,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 243 transitions. [2018-11-14 18:05:59,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:59,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 243 transitions. [2018-11-14 18:05:59,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 243 transitions. [2018-11-14 18:05:59,459 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:59,463 INFO L225 Difference]: With dead ends: 139 [2018-11-14 18:05:59,463 INFO L226 Difference]: Without dead ends: 96 [2018-11-14 18:05:59,464 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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-14 18:05:59,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-14 18:05:59,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-11-14 18:05:59,491 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:05:59,491 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 94 states. [2018-11-14 18:05:59,492 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 94 states. [2018-11-14 18:05:59,492 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 94 states. [2018-11-14 18:05:59,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:59,497 INFO L93 Difference]: Finished difference Result 96 states and 167 transitions. [2018-11-14 18:05:59,497 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 167 transitions. [2018-11-14 18:05:59,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:59,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:59,498 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 96 states. [2018-11-14 18:05:59,499 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 96 states. [2018-11-14 18:05:59,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:59,509 INFO L93 Difference]: Finished difference Result 96 states and 167 transitions. [2018-11-14 18:05:59,510 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 167 transitions. [2018-11-14 18:05:59,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:59,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:59,511 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:05:59,511 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:05:59,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-14 18:05:59,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 166 transitions. [2018-11-14 18:05:59,519 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 166 transitions. Word has length 25 [2018-11-14 18:05:59,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:05:59,520 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 166 transitions. [2018-11-14 18:05:59,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:05:59,520 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 166 transitions. [2018-11-14 18:05:59,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 18:05:59,522 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:05:59,522 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:05:59,522 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:05:59,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:05:59,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1518759892, now seen corresponding path program 1 times [2018-11-14 18:05:59,523 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:05:59,523 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-14 18:05:59,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:05:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:59,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:59,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:05:59,647 INFO L256 TraceCheckUtils]: 0: Hoare triple {1539#true} call ULTIMATE.init(); {1539#true} is VALID [2018-11-14 18:05:59,648 INFO L273 TraceCheckUtils]: 1: Hoare triple {1539#true} assume true; {1539#true} is VALID [2018-11-14 18:05:59,648 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1539#true} {1539#true} #249#return; {1539#true} is VALID [2018-11-14 18:05:59,649 INFO L256 TraceCheckUtils]: 3: Hoare triple {1539#true} call #t~ret14 := main(); {1539#true} is VALID [2018-11-14 18:05:59,649 INFO L273 TraceCheckUtils]: 4: Hoare triple {1539#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {1539#true} is VALID [2018-11-14 18:05:59,650 INFO L273 TraceCheckUtils]: 5: Hoare triple {1539#true} assume true; {1539#true} is VALID [2018-11-14 18:05:59,650 INFO L273 TraceCheckUtils]: 6: Hoare triple {1539#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {1539#true} is VALID [2018-11-14 18:05:59,651 INFO L273 TraceCheckUtils]: 7: Hoare triple {1539#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {1539#true} is VALID [2018-11-14 18:05:59,651 INFO L273 TraceCheckUtils]: 8: Hoare triple {1539#true} assume !(~p1~0 != 0bv32); {1539#true} is VALID [2018-11-14 18:05:59,653 INFO L273 TraceCheckUtils]: 9: Hoare triple {1539#true} assume ~p2~0 != 0bv32;~lk2~0 := 1bv32; {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:59,658 INFO L273 TraceCheckUtils]: 10: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:59,661 INFO L273 TraceCheckUtils]: 11: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:59,663 INFO L273 TraceCheckUtils]: 12: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:59,663 INFO L273 TraceCheckUtils]: 13: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:59,665 INFO L273 TraceCheckUtils]: 14: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:59,665 INFO L273 TraceCheckUtils]: 15: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:59,667 INFO L273 TraceCheckUtils]: 16: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:59,667 INFO L273 TraceCheckUtils]: 17: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:59,668 INFO L273 TraceCheckUtils]: 18: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:59,669 INFO L273 TraceCheckUtils]: 19: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:59,669 INFO L273 TraceCheckUtils]: 20: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p13~0 != 0bv32); {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:59,670 INFO L273 TraceCheckUtils]: 21: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:59,670 INFO L273 TraceCheckUtils]: 22: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p2~0 != 0bv32; {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:59,671 INFO L273 TraceCheckUtils]: 23: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk2~0 != 1bv32; {1540#false} is VALID [2018-11-14 18:05:59,671 INFO L273 TraceCheckUtils]: 24: Hoare triple {1540#false} assume !false; {1540#false} is VALID [2018-11-14 18:05:59,674 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-14 18:05:59,674 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:05:59,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:05:59,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:05:59,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 18:05:59,679 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:05:59,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:05:59,715 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:59,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:05:59,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:05:59,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:05:59,717 INFO L87 Difference]: Start difference. First operand 94 states and 166 transitions. Second operand 3 states. [2018-11-14 18:05:59,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:59,943 INFO L93 Difference]: Finished difference Result 177 states and 317 transitions. [2018-11-14 18:05:59,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:05:59,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 18:05:59,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:05:59,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:59,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2018-11-14 18:05:59,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:59,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2018-11-14 18:05:59,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 164 transitions. [2018-11-14 18:06:00,147 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:00,151 INFO L225 Difference]: With dead ends: 177 [2018-11-14 18:06:00,151 INFO L226 Difference]: Without dead ends: 175 [2018-11-14 18:06:00,152 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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-14 18:06:00,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-14 18:06:00,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 123. [2018-11-14 18:06:00,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:00,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 175 states. Second operand 123 states. [2018-11-14 18:06:00,183 INFO L74 IsIncluded]: Start isIncluded. First operand 175 states. Second operand 123 states. [2018-11-14 18:06:00,183 INFO L87 Difference]: Start difference. First operand 175 states. Second operand 123 states. [2018-11-14 18:06:00,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:00,190 INFO L93 Difference]: Finished difference Result 175 states and 314 transitions. [2018-11-14 18:06:00,190 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 314 transitions. [2018-11-14 18:06:00,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:00,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:00,192 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 175 states. [2018-11-14 18:06:00,192 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 175 states. [2018-11-14 18:06:00,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:00,200 INFO L93 Difference]: Finished difference Result 175 states and 314 transitions. [2018-11-14 18:06:00,200 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 314 transitions. [2018-11-14 18:06:00,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:00,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:00,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:00,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:00,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-14 18:06:00,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 219 transitions. [2018-11-14 18:06:00,206 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 219 transitions. Word has length 25 [2018-11-14 18:06:00,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:00,207 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 219 transitions. [2018-11-14 18:06:00,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:00,207 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 219 transitions. [2018-11-14 18:06:00,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 18:06:00,208 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:00,208 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:00,208 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:00,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:00,209 INFO L82 PathProgramCache]: Analyzing trace with hash 497691538, now seen corresponding path program 1 times [2018-11-14 18:06:00,209 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:00,209 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-14 18:06:00,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:00,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:00,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:00,334 INFO L256 TraceCheckUtils]: 0: Hoare triple {2286#true} call ULTIMATE.init(); {2286#true} is VALID [2018-11-14 18:06:00,335 INFO L273 TraceCheckUtils]: 1: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-14 18:06:00,335 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2286#true} {2286#true} #249#return; {2286#true} is VALID [2018-11-14 18:06:00,336 INFO L256 TraceCheckUtils]: 3: Hoare triple {2286#true} call #t~ret14 := main(); {2286#true} is VALID [2018-11-14 18:06:00,336 INFO L273 TraceCheckUtils]: 4: Hoare triple {2286#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {2286#true} is VALID [2018-11-14 18:06:00,336 INFO L273 TraceCheckUtils]: 5: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-14 18:06:00,337 INFO L273 TraceCheckUtils]: 6: Hoare triple {2286#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {2286#true} is VALID [2018-11-14 18:06:00,337 INFO L273 TraceCheckUtils]: 7: Hoare triple {2286#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {2286#true} is VALID [2018-11-14 18:06:00,337 INFO L273 TraceCheckUtils]: 8: Hoare triple {2286#true} assume !(~p1~0 != 0bv32); {2286#true} is VALID [2018-11-14 18:06:00,343 INFO L273 TraceCheckUtils]: 9: Hoare triple {2286#true} assume !(~p2~0 != 0bv32); {2318#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:06:00,343 INFO L273 TraceCheckUtils]: 10: Hoare triple {2318#(= (_ bv0 32) main_~p2~0)} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {2318#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:06:00,345 INFO L273 TraceCheckUtils]: 11: Hoare triple {2318#(= (_ bv0 32) main_~p2~0)} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {2318#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:06:00,345 INFO L273 TraceCheckUtils]: 12: Hoare triple {2318#(= (_ bv0 32) main_~p2~0)} assume !(~p5~0 != 0bv32); {2318#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:06:00,347 INFO L273 TraceCheckUtils]: 13: Hoare triple {2318#(= (_ bv0 32) main_~p2~0)} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {2318#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:06:00,350 INFO L273 TraceCheckUtils]: 14: Hoare triple {2318#(= (_ bv0 32) main_~p2~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {2318#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:06:00,350 INFO L273 TraceCheckUtils]: 15: Hoare triple {2318#(= (_ bv0 32) main_~p2~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {2318#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:06:00,352 INFO L273 TraceCheckUtils]: 16: Hoare triple {2318#(= (_ bv0 32) main_~p2~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {2318#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:06:00,352 INFO L273 TraceCheckUtils]: 17: Hoare triple {2318#(= (_ bv0 32) main_~p2~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {2318#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:06:00,354 INFO L273 TraceCheckUtils]: 18: Hoare triple {2318#(= (_ bv0 32) main_~p2~0)} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {2318#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:06:00,354 INFO L273 TraceCheckUtils]: 19: Hoare triple {2318#(= (_ bv0 32) main_~p2~0)} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {2318#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:06:00,356 INFO L273 TraceCheckUtils]: 20: Hoare triple {2318#(= (_ bv0 32) main_~p2~0)} assume !(~p13~0 != 0bv32); {2318#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:06:00,356 INFO L273 TraceCheckUtils]: 21: Hoare triple {2318#(= (_ bv0 32) main_~p2~0)} assume !(~p1~0 != 0bv32); {2318#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:06:00,358 INFO L273 TraceCheckUtils]: 22: Hoare triple {2318#(= (_ bv0 32) main_~p2~0)} assume ~p2~0 != 0bv32; {2287#false} is VALID [2018-11-14 18:06:00,358 INFO L273 TraceCheckUtils]: 23: Hoare triple {2287#false} assume ~lk2~0 != 1bv32; {2287#false} is VALID [2018-11-14 18:06:00,359 INFO L273 TraceCheckUtils]: 24: Hoare triple {2287#false} assume !false; {2287#false} is VALID [2018-11-14 18:06:00,361 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-14 18:06:00,361 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (6)] Exception during sending of exit command (exit): Broken pipe [2018-11-14 18:06:00,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:00,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:00,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 18:06:00,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:00,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:00,401 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:00,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:00,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:00,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:00,402 INFO L87 Difference]: Start difference. First operand 123 states and 219 transitions. Second operand 3 states. [2018-11-14 18:06:00,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:00,744 INFO L93 Difference]: Finished difference Result 291 states and 525 transitions. [2018-11-14 18:06:00,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:00,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 18:06:00,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:00,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:00,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2018-11-14 18:06:00,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:00,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2018-11-14 18:06:00,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 245 transitions. [2018-11-14 18:06:01,316 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 245 edges. 245 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:01,320 INFO L225 Difference]: With dead ends: 291 [2018-11-14 18:06:01,320 INFO L226 Difference]: Without dead ends: 177 [2018-11-14 18:06:01,321 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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-14 18:06:01,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-14 18:06:01,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2018-11-14 18:06:01,350 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:01,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand 175 states. [2018-11-14 18:06:01,350 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 175 states. [2018-11-14 18:06:01,351 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 175 states. [2018-11-14 18:06:01,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:01,356 INFO L93 Difference]: Finished difference Result 177 states and 312 transitions. [2018-11-14 18:06:01,357 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 312 transitions. [2018-11-14 18:06:01,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:01,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:01,358 INFO L74 IsIncluded]: Start isIncluded. First operand 175 states. Second operand 177 states. [2018-11-14 18:06:01,358 INFO L87 Difference]: Start difference. First operand 175 states. Second operand 177 states. [2018-11-14 18:06:01,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:01,365 INFO L93 Difference]: Finished difference Result 177 states and 312 transitions. [2018-11-14 18:06:01,365 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 312 transitions. [2018-11-14 18:06:01,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:01,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:01,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:01,367 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:01,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-11-14 18:06:01,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 311 transitions. [2018-11-14 18:06:01,374 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 311 transitions. Word has length 25 [2018-11-14 18:06:01,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:01,374 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 311 transitions. [2018-11-14 18:06:01,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:01,374 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 311 transitions. [2018-11-14 18:06:01,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 18:06:01,375 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:01,375 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:01,376 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:01,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:01,376 INFO L82 PathProgramCache]: Analyzing trace with hash -162870854, now seen corresponding path program 1 times [2018-11-14 18:06:01,376 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:01,377 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-14 18:06:01,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:01,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:01,495 INFO L256 TraceCheckUtils]: 0: Hoare triple {3207#true} call ULTIMATE.init(); {3207#true} is VALID [2018-11-14 18:06:01,495 INFO L273 TraceCheckUtils]: 1: Hoare triple {3207#true} assume true; {3207#true} is VALID [2018-11-14 18:06:01,496 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3207#true} {3207#true} #249#return; {3207#true} is VALID [2018-11-14 18:06:01,496 INFO L256 TraceCheckUtils]: 3: Hoare triple {3207#true} call #t~ret14 := main(); {3207#true} is VALID [2018-11-14 18:06:01,496 INFO L273 TraceCheckUtils]: 4: Hoare triple {3207#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {3207#true} is VALID [2018-11-14 18:06:01,497 INFO L273 TraceCheckUtils]: 5: Hoare triple {3207#true} assume true; {3207#true} is VALID [2018-11-14 18:06:01,497 INFO L273 TraceCheckUtils]: 6: Hoare triple {3207#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {3207#true} is VALID [2018-11-14 18:06:01,497 INFO L273 TraceCheckUtils]: 7: Hoare triple {3207#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {3207#true} is VALID [2018-11-14 18:06:01,497 INFO L273 TraceCheckUtils]: 8: Hoare triple {3207#true} assume !(~p1~0 != 0bv32); {3207#true} is VALID [2018-11-14 18:06:01,498 INFO L273 TraceCheckUtils]: 9: Hoare triple {3207#true} assume ~p2~0 != 0bv32;~lk2~0 := 1bv32; {3239#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:06:01,499 INFO L273 TraceCheckUtils]: 10: Hoare triple {3239#(not (= (_ bv0 32) main_~p2~0))} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {3239#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:06:01,499 INFO L273 TraceCheckUtils]: 11: Hoare triple {3239#(not (= (_ bv0 32) main_~p2~0))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {3239#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:06:01,501 INFO L273 TraceCheckUtils]: 12: Hoare triple {3239#(not (= (_ bv0 32) main_~p2~0))} assume !(~p5~0 != 0bv32); {3239#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:06:01,501 INFO L273 TraceCheckUtils]: 13: Hoare triple {3239#(not (= (_ bv0 32) main_~p2~0))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {3239#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:06:01,503 INFO L273 TraceCheckUtils]: 14: Hoare triple {3239#(not (= (_ bv0 32) main_~p2~0))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {3239#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:06:01,503 INFO L273 TraceCheckUtils]: 15: Hoare triple {3239#(not (= (_ bv0 32) main_~p2~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {3239#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:06:01,505 INFO L273 TraceCheckUtils]: 16: Hoare triple {3239#(not (= (_ bv0 32) main_~p2~0))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {3239#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:06:01,505 INFO L273 TraceCheckUtils]: 17: Hoare triple {3239#(not (= (_ bv0 32) main_~p2~0))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {3239#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:06:01,507 INFO L273 TraceCheckUtils]: 18: Hoare triple {3239#(not (= (_ bv0 32) main_~p2~0))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {3239#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:06:01,509 INFO L273 TraceCheckUtils]: 19: Hoare triple {3239#(not (= (_ bv0 32) main_~p2~0))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {3239#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:06:01,509 INFO L273 TraceCheckUtils]: 20: Hoare triple {3239#(not (= (_ bv0 32) main_~p2~0))} assume !(~p13~0 != 0bv32); {3239#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:06:01,510 INFO L273 TraceCheckUtils]: 21: Hoare triple {3239#(not (= (_ bv0 32) main_~p2~0))} assume !(~p1~0 != 0bv32); {3239#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:06:01,510 INFO L273 TraceCheckUtils]: 22: Hoare triple {3239#(not (= (_ bv0 32) main_~p2~0))} assume !(~p2~0 != 0bv32); {3208#false} is VALID [2018-11-14 18:06:01,510 INFO L273 TraceCheckUtils]: 23: Hoare triple {3208#false} assume ~p3~0 != 0bv32; {3208#false} is VALID [2018-11-14 18:06:01,510 INFO L273 TraceCheckUtils]: 24: Hoare triple {3208#false} assume ~lk3~0 != 1bv32; {3208#false} is VALID [2018-11-14 18:06:01,511 INFO L273 TraceCheckUtils]: 25: Hoare triple {3208#false} assume !false; {3208#false} is VALID [2018-11-14 18:06:01,512 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-14 18:06:01,512 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:01,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:01,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:01,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-14 18:06:01,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:01,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:01,551 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:01,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:01,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:01,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:01,553 INFO L87 Difference]: Start difference. First operand 175 states and 311 transitions. Second operand 3 states. [2018-11-14 18:06:01,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:01,798 INFO L93 Difference]: Finished difference Result 262 states and 464 transitions. [2018-11-14 18:06:01,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:01,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-14 18:06:01,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:01,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:01,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 240 transitions. [2018-11-14 18:06:01,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:01,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 240 transitions. [2018-11-14 18:06:01,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 240 transitions. [2018-11-14 18:06:02,567 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 240 edges. 240 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:02,571 INFO L225 Difference]: With dead ends: 262 [2018-11-14 18:06:02,572 INFO L226 Difference]: Without dead ends: 179 [2018-11-14 18:06:02,572 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 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-14 18:06:02,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-14 18:06:02,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2018-11-14 18:06:02,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:02,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand 177 states. [2018-11-14 18:06:02,610 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand 177 states. [2018-11-14 18:06:02,610 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 177 states. [2018-11-14 18:06:02,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:02,617 INFO L93 Difference]: Finished difference Result 179 states and 312 transitions. [2018-11-14 18:06:02,617 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 312 transitions. [2018-11-14 18:06:02,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:02,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:02,618 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 179 states. [2018-11-14 18:06:02,618 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 179 states. [2018-11-14 18:06:02,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:02,625 INFO L93 Difference]: Finished difference Result 179 states and 312 transitions. [2018-11-14 18:06:02,625 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 312 transitions. [2018-11-14 18:06:02,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:02,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:02,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:02,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:02,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-14 18:06:02,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 311 transitions. [2018-11-14 18:06:02,633 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 311 transitions. Word has length 26 [2018-11-14 18:06:02,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:02,633 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 311 transitions. [2018-11-14 18:06:02,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:02,634 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 311 transitions. [2018-11-14 18:06:02,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 18:06:02,634 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:02,635 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:02,637 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:02,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:02,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1751218756, now seen corresponding path program 1 times [2018-11-14 18:06:02,637 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:02,637 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-14 18:06:02,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:02,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:02,798 INFO L256 TraceCheckUtils]: 0: Hoare triple {4108#true} call ULTIMATE.init(); {4108#true} is VALID [2018-11-14 18:06:02,799 INFO L273 TraceCheckUtils]: 1: Hoare triple {4108#true} assume true; {4108#true} is VALID [2018-11-14 18:06:02,799 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4108#true} {4108#true} #249#return; {4108#true} is VALID [2018-11-14 18:06:02,799 INFO L256 TraceCheckUtils]: 3: Hoare triple {4108#true} call #t~ret14 := main(); {4108#true} is VALID [2018-11-14 18:06:02,799 INFO L273 TraceCheckUtils]: 4: Hoare triple {4108#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {4108#true} is VALID [2018-11-14 18:06:02,799 INFO L273 TraceCheckUtils]: 5: Hoare triple {4108#true} assume true; {4108#true} is VALID [2018-11-14 18:06:02,800 INFO L273 TraceCheckUtils]: 6: Hoare triple {4108#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {4108#true} is VALID [2018-11-14 18:06:02,800 INFO L273 TraceCheckUtils]: 7: Hoare triple {4108#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {4108#true} is VALID [2018-11-14 18:06:02,800 INFO L273 TraceCheckUtils]: 8: Hoare triple {4108#true} assume !(~p1~0 != 0bv32); {4108#true} is VALID [2018-11-14 18:06:02,800 INFO L273 TraceCheckUtils]: 9: Hoare triple {4108#true} assume !(~p2~0 != 0bv32); {4108#true} is VALID [2018-11-14 18:06:02,801 INFO L273 TraceCheckUtils]: 10: Hoare triple {4108#true} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:02,801 INFO L273 TraceCheckUtils]: 11: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:02,802 INFO L273 TraceCheckUtils]: 12: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:02,802 INFO L273 TraceCheckUtils]: 13: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:02,802 INFO L273 TraceCheckUtils]: 14: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:02,803 INFO L273 TraceCheckUtils]: 15: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:02,803 INFO L273 TraceCheckUtils]: 16: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:02,823 INFO L273 TraceCheckUtils]: 17: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:02,832 INFO L273 TraceCheckUtils]: 18: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:02,844 INFO L273 TraceCheckUtils]: 19: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:02,844 INFO L273 TraceCheckUtils]: 20: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p13~0 != 0bv32); {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:02,845 INFO L273 TraceCheckUtils]: 21: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:02,849 INFO L273 TraceCheckUtils]: 22: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:02,849 INFO L273 TraceCheckUtils]: 23: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p3~0 != 0bv32; {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:02,850 INFO L273 TraceCheckUtils]: 24: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk3~0 != 1bv32; {4109#false} is VALID [2018-11-14 18:06:02,850 INFO L273 TraceCheckUtils]: 25: Hoare triple {4109#false} assume !false; {4109#false} is VALID [2018-11-14 18:06:02,851 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-14 18:06:02,851 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:02,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:02,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:02,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-14 18:06:02,853 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:02,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:02,880 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:02,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:02,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:02,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:02,881 INFO L87 Difference]: Start difference. First operand 177 states and 311 transitions. Second operand 3 states. [2018-11-14 18:06:03,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:03,309 INFO L93 Difference]: Finished difference Result 333 states and 593 transitions. [2018-11-14 18:06:03,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:03,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-14 18:06:03,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:03,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:03,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2018-11-14 18:06:03,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:03,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2018-11-14 18:06:03,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 160 transitions. [2018-11-14 18:06:03,806 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:03,815 INFO L225 Difference]: With dead ends: 333 [2018-11-14 18:06:03,815 INFO L226 Difference]: Without dead ends: 331 [2018-11-14 18:06:03,816 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 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-14 18:06:03,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-11-14 18:06:03,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 237. [2018-11-14 18:06:03,896 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:03,896 INFO L82 GeneralOperation]: Start isEquivalent. First operand 331 states. Second operand 237 states. [2018-11-14 18:06:03,896 INFO L74 IsIncluded]: Start isIncluded. First operand 331 states. Second operand 237 states. [2018-11-14 18:06:03,896 INFO L87 Difference]: Start difference. First operand 331 states. Second operand 237 states. [2018-11-14 18:06:03,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:03,905 INFO L93 Difference]: Finished difference Result 331 states and 588 transitions. [2018-11-14 18:06:03,906 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 588 transitions. [2018-11-14 18:06:03,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:03,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:03,907 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand 331 states. [2018-11-14 18:06:03,907 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 331 states. [2018-11-14 18:06:03,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:03,917 INFO L93 Difference]: Finished difference Result 331 states and 588 transitions. [2018-11-14 18:06:03,917 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 588 transitions. [2018-11-14 18:06:03,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:03,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:03,919 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:03,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:03,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-11-14 18:06:03,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 415 transitions. [2018-11-14 18:06:03,925 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 415 transitions. Word has length 26 [2018-11-14 18:06:03,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:03,926 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 415 transitions. [2018-11-14 18:06:03,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:03,926 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 415 transitions. [2018-11-14 18:06:03,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 18:06:03,927 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:03,927 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:03,927 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:03,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:03,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1522680186, now seen corresponding path program 1 times [2018-11-14 18:06:03,928 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:03,928 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 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 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:03,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:04,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:04,328 INFO L256 TraceCheckUtils]: 0: Hoare triple {5446#true} call ULTIMATE.init(); {5446#true} is VALID [2018-11-14 18:06:04,329 INFO L273 TraceCheckUtils]: 1: Hoare triple {5446#true} assume true; {5446#true} is VALID [2018-11-14 18:06:04,329 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5446#true} {5446#true} #249#return; {5446#true} is VALID [2018-11-14 18:06:04,329 INFO L256 TraceCheckUtils]: 3: Hoare triple {5446#true} call #t~ret14 := main(); {5446#true} is VALID [2018-11-14 18:06:04,329 INFO L273 TraceCheckUtils]: 4: Hoare triple {5446#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {5446#true} is VALID [2018-11-14 18:06:04,329 INFO L273 TraceCheckUtils]: 5: Hoare triple {5446#true} assume true; {5446#true} is VALID [2018-11-14 18:06:04,330 INFO L273 TraceCheckUtils]: 6: Hoare triple {5446#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {5446#true} is VALID [2018-11-14 18:06:04,330 INFO L273 TraceCheckUtils]: 7: Hoare triple {5446#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {5446#true} is VALID [2018-11-14 18:06:04,330 INFO L273 TraceCheckUtils]: 8: Hoare triple {5446#true} assume !(~p1~0 != 0bv32); {5446#true} is VALID [2018-11-14 18:06:04,330 INFO L273 TraceCheckUtils]: 9: Hoare triple {5446#true} assume !(~p2~0 != 0bv32); {5446#true} is VALID [2018-11-14 18:06:04,331 INFO L273 TraceCheckUtils]: 10: Hoare triple {5446#true} assume !(~p3~0 != 0bv32); {5481#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:06:04,331 INFO L273 TraceCheckUtils]: 11: Hoare triple {5481#(= (_ bv0 32) main_~p3~0)} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {5481#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:06:04,332 INFO L273 TraceCheckUtils]: 12: Hoare triple {5481#(= (_ bv0 32) main_~p3~0)} assume !(~p5~0 != 0bv32); {5481#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:06:04,332 INFO L273 TraceCheckUtils]: 13: Hoare triple {5481#(= (_ bv0 32) main_~p3~0)} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {5481#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:06:04,332 INFO L273 TraceCheckUtils]: 14: Hoare triple {5481#(= (_ bv0 32) main_~p3~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {5481#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:06:04,334 INFO L273 TraceCheckUtils]: 15: Hoare triple {5481#(= (_ bv0 32) main_~p3~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {5481#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:06:04,334 INFO L273 TraceCheckUtils]: 16: Hoare triple {5481#(= (_ bv0 32) main_~p3~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {5481#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:06:04,338 INFO L273 TraceCheckUtils]: 17: Hoare triple {5481#(= (_ bv0 32) main_~p3~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {5481#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:06:04,339 INFO L273 TraceCheckUtils]: 18: Hoare triple {5481#(= (_ bv0 32) main_~p3~0)} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {5481#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:06:04,339 INFO L273 TraceCheckUtils]: 19: Hoare triple {5481#(= (_ bv0 32) main_~p3~0)} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {5481#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:06:04,339 INFO L273 TraceCheckUtils]: 20: Hoare triple {5481#(= (_ bv0 32) main_~p3~0)} assume !(~p13~0 != 0bv32); {5481#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:06:04,340 INFO L273 TraceCheckUtils]: 21: Hoare triple {5481#(= (_ bv0 32) main_~p3~0)} assume !(~p1~0 != 0bv32); {5481#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:06:04,340 INFO L273 TraceCheckUtils]: 22: Hoare triple {5481#(= (_ bv0 32) main_~p3~0)} assume !(~p2~0 != 0bv32); {5481#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:06:04,340 INFO L273 TraceCheckUtils]: 23: Hoare triple {5481#(= (_ bv0 32) main_~p3~0)} assume ~p3~0 != 0bv32; {5447#false} is VALID [2018-11-14 18:06:04,341 INFO L273 TraceCheckUtils]: 24: Hoare triple {5447#false} assume ~lk3~0 != 1bv32; {5447#false} is VALID [2018-11-14 18:06:04,341 INFO L273 TraceCheckUtils]: 25: Hoare triple {5447#false} assume !false; {5447#false} is VALID [2018-11-14 18:06:04,341 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-14 18:06:04,342 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:04,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:04,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:04,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-14 18:06:04,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:04,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:04,369 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:04,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:04,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:04,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:04,370 INFO L87 Difference]: Start difference. First operand 237 states and 415 transitions. Second operand 3 states. [2018-11-14 18:06:04,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:04,952 INFO L93 Difference]: Finished difference Result 565 states and 997 transitions. [2018-11-14 18:06:04,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:04,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-14 18:06:04,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:04,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:04,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 242 transitions. [2018-11-14 18:06:04,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:04,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 242 transitions. [2018-11-14 18:06:04,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 242 transitions. [2018-11-14 18:06:05,779 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 242 edges. 242 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:05,789 INFO L225 Difference]: With dead ends: 565 [2018-11-14 18:06:05,789 INFO L226 Difference]: Without dead ends: 339 [2018-11-14 18:06:05,790 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 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-14 18:06:05,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-11-14 18:06:05,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 337. [2018-11-14 18:06:05,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:05,876 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states. Second operand 337 states. [2018-11-14 18:06:05,876 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand 337 states. [2018-11-14 18:06:05,876 INFO L87 Difference]: Start difference. First operand 339 states. Second operand 337 states. [2018-11-14 18:06:05,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:05,886 INFO L93 Difference]: Finished difference Result 339 states and 588 transitions. [2018-11-14 18:06:05,886 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 588 transitions. [2018-11-14 18:06:05,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:05,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:05,887 INFO L74 IsIncluded]: Start isIncluded. First operand 337 states. Second operand 339 states. [2018-11-14 18:06:05,887 INFO L87 Difference]: Start difference. First operand 337 states. Second operand 339 states. [2018-11-14 18:06:05,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:05,898 INFO L93 Difference]: Finished difference Result 339 states and 588 transitions. [2018-11-14 18:06:05,898 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 588 transitions. [2018-11-14 18:06:05,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:05,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:05,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:05,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:05,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-11-14 18:06:05,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 587 transitions. [2018-11-14 18:06:05,909 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 587 transitions. Word has length 26 [2018-11-14 18:06:05,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:05,909 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 587 transitions. [2018-11-14 18:06:05,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:05,909 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 587 transitions. [2018-11-14 18:06:05,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 18:06:05,910 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:05,911 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:05,911 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:05,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:05,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1547006503, now seen corresponding path program 1 times [2018-11-14 18:06:05,911 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:05,912 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 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 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:05,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:05,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:05,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:06,566 INFO L256 TraceCheckUtils]: 0: Hoare triple {7140#true} call ULTIMATE.init(); {7140#true} is VALID [2018-11-14 18:06:06,566 INFO L273 TraceCheckUtils]: 1: Hoare triple {7140#true} assume true; {7140#true} is VALID [2018-11-14 18:06:06,567 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7140#true} {7140#true} #249#return; {7140#true} is VALID [2018-11-14 18:06:06,567 INFO L256 TraceCheckUtils]: 3: Hoare triple {7140#true} call #t~ret14 := main(); {7140#true} is VALID [2018-11-14 18:06:06,567 INFO L273 TraceCheckUtils]: 4: Hoare triple {7140#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {7140#true} is VALID [2018-11-14 18:06:06,567 INFO L273 TraceCheckUtils]: 5: Hoare triple {7140#true} assume true; {7140#true} is VALID [2018-11-14 18:06:06,568 INFO L273 TraceCheckUtils]: 6: Hoare triple {7140#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {7140#true} is VALID [2018-11-14 18:06:06,568 INFO L273 TraceCheckUtils]: 7: Hoare triple {7140#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {7140#true} is VALID [2018-11-14 18:06:06,568 INFO L273 TraceCheckUtils]: 8: Hoare triple {7140#true} assume !(~p1~0 != 0bv32); {7140#true} is VALID [2018-11-14 18:06:06,568 INFO L273 TraceCheckUtils]: 9: Hoare triple {7140#true} assume !(~p2~0 != 0bv32); {7140#true} is VALID [2018-11-14 18:06:06,573 INFO L273 TraceCheckUtils]: 10: Hoare triple {7140#true} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {7175#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:06:06,575 INFO L273 TraceCheckUtils]: 11: Hoare triple {7175#(not (= (_ bv0 32) main_~p3~0))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {7175#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:06:06,577 INFO L273 TraceCheckUtils]: 12: Hoare triple {7175#(not (= (_ bv0 32) main_~p3~0))} assume !(~p5~0 != 0bv32); {7175#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:06:06,577 INFO L273 TraceCheckUtils]: 13: Hoare triple {7175#(not (= (_ bv0 32) main_~p3~0))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {7175#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:06:06,579 INFO L273 TraceCheckUtils]: 14: Hoare triple {7175#(not (= (_ bv0 32) main_~p3~0))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {7175#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:06:06,579 INFO L273 TraceCheckUtils]: 15: Hoare triple {7175#(not (= (_ bv0 32) main_~p3~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {7175#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:06:06,581 INFO L273 TraceCheckUtils]: 16: Hoare triple {7175#(not (= (_ bv0 32) main_~p3~0))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {7175#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:06:06,581 INFO L273 TraceCheckUtils]: 17: Hoare triple {7175#(not (= (_ bv0 32) main_~p3~0))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {7175#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:06:06,588 INFO L273 TraceCheckUtils]: 18: Hoare triple {7175#(not (= (_ bv0 32) main_~p3~0))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {7175#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:06:06,588 INFO L273 TraceCheckUtils]: 19: Hoare triple {7175#(not (= (_ bv0 32) main_~p3~0))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {7175#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:06:06,590 INFO L273 TraceCheckUtils]: 20: Hoare triple {7175#(not (= (_ bv0 32) main_~p3~0))} assume !(~p13~0 != 0bv32); {7175#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:06:06,593 INFO L273 TraceCheckUtils]: 21: Hoare triple {7175#(not (= (_ bv0 32) main_~p3~0))} assume !(~p1~0 != 0bv32); {7175#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:06:06,593 INFO L273 TraceCheckUtils]: 22: Hoare triple {7175#(not (= (_ bv0 32) main_~p3~0))} assume !(~p2~0 != 0bv32); {7175#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:06:06,594 INFO L273 TraceCheckUtils]: 23: Hoare triple {7175#(not (= (_ bv0 32) main_~p3~0))} assume !(~p3~0 != 0bv32); {7141#false} is VALID [2018-11-14 18:06:06,594 INFO L273 TraceCheckUtils]: 24: Hoare triple {7141#false} assume ~p4~0 != 0bv32; {7141#false} is VALID [2018-11-14 18:06:06,594 INFO L273 TraceCheckUtils]: 25: Hoare triple {7141#false} assume ~lk4~0 != 1bv32; {7141#false} is VALID [2018-11-14 18:06:06,594 INFO L273 TraceCheckUtils]: 26: Hoare triple {7141#false} assume !false; {7141#false} is VALID [2018-11-14 18:06:06,595 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-14 18:06:06,595 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:06,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:06,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:06,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 18:06:06,597 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:06,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:06,624 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:06,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:06,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:06,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:06,625 INFO L87 Difference]: Start difference. First operand 337 states and 587 transitions. Second operand 3 states. [2018-11-14 18:06:06,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:06,938 INFO L93 Difference]: Finished difference Result 505 states and 877 transitions. [2018-11-14 18:06:06,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:06,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 18:06:06,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:06,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:06,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 237 transitions. [2018-11-14 18:06:06,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:06,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 237 transitions. [2018-11-14 18:06:06,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 237 transitions. [2018-11-14 18:06:07,608 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 237 edges. 237 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:07,615 INFO L225 Difference]: With dead ends: 505 [2018-11-14 18:06:07,615 INFO L226 Difference]: Without dead ends: 343 [2018-11-14 18:06:07,616 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:07,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-11-14 18:06:07,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2018-11-14 18:06:07,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:07,802 INFO L82 GeneralOperation]: Start isEquivalent. First operand 343 states. Second operand 341 states. [2018-11-14 18:06:07,802 INFO L74 IsIncluded]: Start isIncluded. First operand 343 states. Second operand 341 states. [2018-11-14 18:06:07,803 INFO L87 Difference]: Start difference. First operand 343 states. Second operand 341 states. [2018-11-14 18:06:07,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:07,816 INFO L93 Difference]: Finished difference Result 343 states and 588 transitions. [2018-11-14 18:06:07,817 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 588 transitions. [2018-11-14 18:06:07,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:07,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:07,818 INFO L74 IsIncluded]: Start isIncluded. First operand 341 states. Second operand 343 states. [2018-11-14 18:06:07,818 INFO L87 Difference]: Start difference. First operand 341 states. Second operand 343 states. [2018-11-14 18:06:07,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:07,828 INFO L93 Difference]: Finished difference Result 343 states and 588 transitions. [2018-11-14 18:06:07,828 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 588 transitions. [2018-11-14 18:06:07,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:07,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:07,829 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:07,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:07,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-11-14 18:06:07,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 587 transitions. [2018-11-14 18:06:07,839 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 587 transitions. Word has length 27 [2018-11-14 18:06:07,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:07,840 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 587 transitions. [2018-11-14 18:06:07,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:07,840 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 587 transitions. [2018-11-14 18:06:07,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 18:06:07,841 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:07,842 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:07,845 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:07,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:07,845 INFO L82 PathProgramCache]: Analyzing trace with hash -41341399, now seen corresponding path program 1 times [2018-11-14 18:06:07,846 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:07,846 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 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 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:07,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:07,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:08,224 INFO L256 TraceCheckUtils]: 0: Hoare triple {8789#true} call ULTIMATE.init(); {8789#true} is VALID [2018-11-14 18:06:08,225 INFO L273 TraceCheckUtils]: 1: Hoare triple {8789#true} assume true; {8789#true} is VALID [2018-11-14 18:06:08,225 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {8789#true} {8789#true} #249#return; {8789#true} is VALID [2018-11-14 18:06:08,225 INFO L256 TraceCheckUtils]: 3: Hoare triple {8789#true} call #t~ret14 := main(); {8789#true} is VALID [2018-11-14 18:06:08,225 INFO L273 TraceCheckUtils]: 4: Hoare triple {8789#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {8789#true} is VALID [2018-11-14 18:06:08,226 INFO L273 TraceCheckUtils]: 5: Hoare triple {8789#true} assume true; {8789#true} is VALID [2018-11-14 18:06:08,226 INFO L273 TraceCheckUtils]: 6: Hoare triple {8789#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {8789#true} is VALID [2018-11-14 18:06:08,226 INFO L273 TraceCheckUtils]: 7: Hoare triple {8789#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {8789#true} is VALID [2018-11-14 18:06:08,226 INFO L273 TraceCheckUtils]: 8: Hoare triple {8789#true} assume !(~p1~0 != 0bv32); {8789#true} is VALID [2018-11-14 18:06:08,226 INFO L273 TraceCheckUtils]: 9: Hoare triple {8789#true} assume !(~p2~0 != 0bv32); {8789#true} is VALID [2018-11-14 18:06:08,227 INFO L273 TraceCheckUtils]: 10: Hoare triple {8789#true} assume !(~p3~0 != 0bv32); {8789#true} is VALID [2018-11-14 18:06:08,227 INFO L273 TraceCheckUtils]: 11: Hoare triple {8789#true} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:08,227 INFO L273 TraceCheckUtils]: 12: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:08,228 INFO L273 TraceCheckUtils]: 13: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:08,228 INFO L273 TraceCheckUtils]: 14: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:08,228 INFO L273 TraceCheckUtils]: 15: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:08,229 INFO L273 TraceCheckUtils]: 16: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:08,229 INFO L273 TraceCheckUtils]: 17: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:08,229 INFO L273 TraceCheckUtils]: 18: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:08,230 INFO L273 TraceCheckUtils]: 19: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:08,231 INFO L273 TraceCheckUtils]: 20: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p13~0 != 0bv32); {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:08,231 INFO L273 TraceCheckUtils]: 21: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:08,232 INFO L273 TraceCheckUtils]: 22: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:08,236 INFO L273 TraceCheckUtils]: 23: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p3~0 != 0bv32); {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:08,236 INFO L273 TraceCheckUtils]: 24: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p4~0 != 0bv32; {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:08,238 INFO L273 TraceCheckUtils]: 25: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk4~0 != 1bv32; {8790#false} is VALID [2018-11-14 18:06:08,238 INFO L273 TraceCheckUtils]: 26: Hoare triple {8790#false} assume !false; {8790#false} is VALID [2018-11-14 18:06:08,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:06:08,239 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:08,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:08,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:08,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 18:06:08,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:08,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:08,296 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:08,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:08,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:08,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:08,297 INFO L87 Difference]: Start difference. First operand 341 states and 587 transitions. Second operand 3 states. [2018-11-14 18:06:09,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:09,276 INFO L93 Difference]: Finished difference Result 637 states and 1113 transitions. [2018-11-14 18:06:09,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:09,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 18:06:09,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:09,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:09,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2018-11-14 18:06:09,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:09,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2018-11-14 18:06:09,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 156 transitions. [2018-11-14 18:06:09,889 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:09,912 INFO L225 Difference]: With dead ends: 637 [2018-11-14 18:06:09,912 INFO L226 Difference]: Without dead ends: 635 [2018-11-14 18:06:09,913 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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-14 18:06:09,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2018-11-14 18:06:10,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 465. [2018-11-14 18:06:10,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:10,020 INFO L82 GeneralOperation]: Start isEquivalent. First operand 635 states. Second operand 465 states. [2018-11-14 18:06:10,020 INFO L74 IsIncluded]: Start isIncluded. First operand 635 states. Second operand 465 states. [2018-11-14 18:06:10,020 INFO L87 Difference]: Start difference. First operand 635 states. Second operand 465 states. [2018-11-14 18:06:10,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:10,046 INFO L93 Difference]: Finished difference Result 635 states and 1104 transitions. [2018-11-14 18:06:10,046 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 1104 transitions. [2018-11-14 18:06:10,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:10,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:10,048 INFO L74 IsIncluded]: Start isIncluded. First operand 465 states. Second operand 635 states. [2018-11-14 18:06:10,049 INFO L87 Difference]: Start difference. First operand 465 states. Second operand 635 states. [2018-11-14 18:06:10,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:10,075 INFO L93 Difference]: Finished difference Result 635 states and 1104 transitions. [2018-11-14 18:06:10,075 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 1104 transitions. [2018-11-14 18:06:10,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:10,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:10,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:10,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:10,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-11-14 18:06:10,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 791 transitions. [2018-11-14 18:06:10,095 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 791 transitions. Word has length 27 [2018-11-14 18:06:10,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:10,095 INFO L480 AbstractCegarLoop]: Abstraction has 465 states and 791 transitions. [2018-11-14 18:06:10,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:10,095 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 791 transitions. [2018-11-14 18:06:10,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 18:06:10,096 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:10,096 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:10,097 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:10,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:10,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1062409753, now seen corresponding path program 1 times [2018-11-14 18:06:10,097 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:10,097 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 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 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:10,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:10,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:10,686 INFO L256 TraceCheckUtils]: 0: Hoare triple {11282#true} call ULTIMATE.init(); {11282#true} is VALID [2018-11-14 18:06:10,687 INFO L273 TraceCheckUtils]: 1: Hoare triple {11282#true} assume true; {11282#true} is VALID [2018-11-14 18:06:10,687 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {11282#true} {11282#true} #249#return; {11282#true} is VALID [2018-11-14 18:06:10,688 INFO L256 TraceCheckUtils]: 3: Hoare triple {11282#true} call #t~ret14 := main(); {11282#true} is VALID [2018-11-14 18:06:10,688 INFO L273 TraceCheckUtils]: 4: Hoare triple {11282#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {11282#true} is VALID [2018-11-14 18:06:10,688 INFO L273 TraceCheckUtils]: 5: Hoare triple {11282#true} assume true; {11282#true} is VALID [2018-11-14 18:06:10,689 INFO L273 TraceCheckUtils]: 6: Hoare triple {11282#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {11282#true} is VALID [2018-11-14 18:06:10,689 INFO L273 TraceCheckUtils]: 7: Hoare triple {11282#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {11282#true} is VALID [2018-11-14 18:06:10,689 INFO L273 TraceCheckUtils]: 8: Hoare triple {11282#true} assume !(~p1~0 != 0bv32); {11282#true} is VALID [2018-11-14 18:06:10,689 INFO L273 TraceCheckUtils]: 9: Hoare triple {11282#true} assume !(~p2~0 != 0bv32); {11282#true} is VALID [2018-11-14 18:06:10,689 INFO L273 TraceCheckUtils]: 10: Hoare triple {11282#true} assume !(~p3~0 != 0bv32); {11282#true} is VALID [2018-11-14 18:06:10,698 INFO L273 TraceCheckUtils]: 11: Hoare triple {11282#true} assume !(~p4~0 != 0bv32); {11320#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:06:10,713 INFO L273 TraceCheckUtils]: 12: Hoare triple {11320#(= (_ bv0 32) main_~p4~0)} assume !(~p5~0 != 0bv32); {11320#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:06:10,722 INFO L273 TraceCheckUtils]: 13: Hoare triple {11320#(= (_ bv0 32) main_~p4~0)} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {11320#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:06:10,736 INFO L273 TraceCheckUtils]: 14: Hoare triple {11320#(= (_ bv0 32) main_~p4~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {11320#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:06:10,744 INFO L273 TraceCheckUtils]: 15: Hoare triple {11320#(= (_ bv0 32) main_~p4~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {11320#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:06:10,746 INFO L273 TraceCheckUtils]: 16: Hoare triple {11320#(= (_ bv0 32) main_~p4~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {11320#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:06:10,746 INFO L273 TraceCheckUtils]: 17: Hoare triple {11320#(= (_ bv0 32) main_~p4~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {11320#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:06:10,748 INFO L273 TraceCheckUtils]: 18: Hoare triple {11320#(= (_ bv0 32) main_~p4~0)} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {11320#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:06:10,748 INFO L273 TraceCheckUtils]: 19: Hoare triple {11320#(= (_ bv0 32) main_~p4~0)} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {11320#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:06:10,750 INFO L273 TraceCheckUtils]: 20: Hoare triple {11320#(= (_ bv0 32) main_~p4~0)} assume !(~p13~0 != 0bv32); {11320#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:06:10,750 INFO L273 TraceCheckUtils]: 21: Hoare triple {11320#(= (_ bv0 32) main_~p4~0)} assume !(~p1~0 != 0bv32); {11320#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:06:10,752 INFO L273 TraceCheckUtils]: 22: Hoare triple {11320#(= (_ bv0 32) main_~p4~0)} assume !(~p2~0 != 0bv32); {11320#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:06:10,752 INFO L273 TraceCheckUtils]: 23: Hoare triple {11320#(= (_ bv0 32) main_~p4~0)} assume !(~p3~0 != 0bv32); {11320#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:06:10,754 INFO L273 TraceCheckUtils]: 24: Hoare triple {11320#(= (_ bv0 32) main_~p4~0)} assume ~p4~0 != 0bv32; {11283#false} is VALID [2018-11-14 18:06:10,754 INFO L273 TraceCheckUtils]: 25: Hoare triple {11283#false} assume ~lk4~0 != 1bv32; {11283#false} is VALID [2018-11-14 18:06:10,754 INFO L273 TraceCheckUtils]: 26: Hoare triple {11283#false} assume !false; {11283#false} is VALID [2018-11-14 18:06:10,755 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-14 18:06:10,755 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:10,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:10,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:10,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 18:06:10,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:10,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:10,790 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:10,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:10,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:10,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:10,792 INFO L87 Difference]: Start difference. First operand 465 states and 791 transitions. Second operand 3 states. [2018-11-14 18:06:11,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:11,195 INFO L93 Difference]: Finished difference Result 1109 states and 1897 transitions. [2018-11-14 18:06:11,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:11,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 18:06:11,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:11,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:11,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 239 transitions. [2018-11-14 18:06:11,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:11,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 239 transitions. [2018-11-14 18:06:11,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 239 transitions. [2018-11-14 18:06:11,830 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 239 edges. 239 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:11,851 INFO L225 Difference]: With dead ends: 1109 [2018-11-14 18:06:11,851 INFO L226 Difference]: Without dead ends: 659 [2018-11-14 18:06:11,852 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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-14 18:06:11,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-11-14 18:06:12,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 657. [2018-11-14 18:06:12,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:12,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 659 states. Second operand 657 states. [2018-11-14 18:06:12,402 INFO L74 IsIncluded]: Start isIncluded. First operand 659 states. Second operand 657 states. [2018-11-14 18:06:12,402 INFO L87 Difference]: Start difference. First operand 659 states. Second operand 657 states. [2018-11-14 18:06:12,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:12,422 INFO L93 Difference]: Finished difference Result 659 states and 1112 transitions. [2018-11-14 18:06:12,422 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 1112 transitions. [2018-11-14 18:06:12,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:12,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:12,424 INFO L74 IsIncluded]: Start isIncluded. First operand 657 states. Second operand 659 states. [2018-11-14 18:06:12,424 INFO L87 Difference]: Start difference. First operand 657 states. Second operand 659 states. [2018-11-14 18:06:12,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:12,450 INFO L93 Difference]: Finished difference Result 659 states and 1112 transitions. [2018-11-14 18:06:12,450 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 1112 transitions. [2018-11-14 18:06:12,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:12,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:12,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:12,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:12,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2018-11-14 18:06:12,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1111 transitions. [2018-11-14 18:06:12,478 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1111 transitions. Word has length 27 [2018-11-14 18:06:12,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:12,478 INFO L480 AbstractCegarLoop]: Abstraction has 657 states and 1111 transitions. [2018-11-14 18:06:12,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:12,478 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1111 transitions. [2018-11-14 18:06:12,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 18:06:12,479 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:12,480 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:12,480 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:12,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:12,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1281369937, now seen corresponding path program 1 times [2018-11-14 18:06:12,481 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:12,481 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 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 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:12,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:12,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:12,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:12,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:12,631 INFO L256 TraceCheckUtils]: 0: Hoare triple {14503#true} call ULTIMATE.init(); {14503#true} is VALID [2018-11-14 18:06:12,631 INFO L273 TraceCheckUtils]: 1: Hoare triple {14503#true} assume true; {14503#true} is VALID [2018-11-14 18:06:12,631 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {14503#true} {14503#true} #249#return; {14503#true} is VALID [2018-11-14 18:06:12,632 INFO L256 TraceCheckUtils]: 3: Hoare triple {14503#true} call #t~ret14 := main(); {14503#true} is VALID [2018-11-14 18:06:12,632 INFO L273 TraceCheckUtils]: 4: Hoare triple {14503#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {14503#true} is VALID [2018-11-14 18:06:12,632 INFO L273 TraceCheckUtils]: 5: Hoare triple {14503#true} assume true; {14503#true} is VALID [2018-11-14 18:06:12,632 INFO L273 TraceCheckUtils]: 6: Hoare triple {14503#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {14503#true} is VALID [2018-11-14 18:06:12,632 INFO L273 TraceCheckUtils]: 7: Hoare triple {14503#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {14503#true} is VALID [2018-11-14 18:06:12,633 INFO L273 TraceCheckUtils]: 8: Hoare triple {14503#true} assume !(~p1~0 != 0bv32); {14503#true} is VALID [2018-11-14 18:06:12,633 INFO L273 TraceCheckUtils]: 9: Hoare triple {14503#true} assume !(~p2~0 != 0bv32); {14503#true} is VALID [2018-11-14 18:06:12,633 INFO L273 TraceCheckUtils]: 10: Hoare triple {14503#true} assume !(~p3~0 != 0bv32); {14503#true} is VALID [2018-11-14 18:06:12,635 INFO L273 TraceCheckUtils]: 11: Hoare triple {14503#true} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {14541#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:06:12,635 INFO L273 TraceCheckUtils]: 12: Hoare triple {14541#(not (= (_ bv0 32) main_~p4~0))} assume !(~p5~0 != 0bv32); {14541#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:06:12,636 INFO L273 TraceCheckUtils]: 13: Hoare triple {14541#(not (= (_ bv0 32) main_~p4~0))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {14541#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:06:12,636 INFO L273 TraceCheckUtils]: 14: Hoare triple {14541#(not (= (_ bv0 32) main_~p4~0))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {14541#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:06:12,636 INFO L273 TraceCheckUtils]: 15: Hoare triple {14541#(not (= (_ bv0 32) main_~p4~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {14541#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:06:12,637 INFO L273 TraceCheckUtils]: 16: Hoare triple {14541#(not (= (_ bv0 32) main_~p4~0))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {14541#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:06:12,637 INFO L273 TraceCheckUtils]: 17: Hoare triple {14541#(not (= (_ bv0 32) main_~p4~0))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {14541#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:06:12,638 INFO L273 TraceCheckUtils]: 18: Hoare triple {14541#(not (= (_ bv0 32) main_~p4~0))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {14541#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:06:12,638 INFO L273 TraceCheckUtils]: 19: Hoare triple {14541#(not (= (_ bv0 32) main_~p4~0))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {14541#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:06:12,639 INFO L273 TraceCheckUtils]: 20: Hoare triple {14541#(not (= (_ bv0 32) main_~p4~0))} assume !(~p13~0 != 0bv32); {14541#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:06:12,639 INFO L273 TraceCheckUtils]: 21: Hoare triple {14541#(not (= (_ bv0 32) main_~p4~0))} assume !(~p1~0 != 0bv32); {14541#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:06:12,640 INFO L273 TraceCheckUtils]: 22: Hoare triple {14541#(not (= (_ bv0 32) main_~p4~0))} assume !(~p2~0 != 0bv32); {14541#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:06:12,641 INFO L273 TraceCheckUtils]: 23: Hoare triple {14541#(not (= (_ bv0 32) main_~p4~0))} assume !(~p3~0 != 0bv32); {14541#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:06:12,641 INFO L273 TraceCheckUtils]: 24: Hoare triple {14541#(not (= (_ bv0 32) main_~p4~0))} assume !(~p4~0 != 0bv32); {14504#false} is VALID [2018-11-14 18:06:12,642 INFO L273 TraceCheckUtils]: 25: Hoare triple {14504#false} assume ~p5~0 != 0bv32; {14504#false} is VALID [2018-11-14 18:06:12,642 INFO L273 TraceCheckUtils]: 26: Hoare triple {14504#false} assume ~lk5~0 != 1bv32; {14504#false} is VALID [2018-11-14 18:06:12,643 INFO L273 TraceCheckUtils]: 27: Hoare triple {14504#false} assume !false; {14504#false} is VALID [2018-11-14 18:06:12,644 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-14 18:06:12,645 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:12,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:12,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:12,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-14 18:06:12,647 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:12,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:12,679 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:12,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:12,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:12,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:12,680 INFO L87 Difference]: Start difference. First operand 657 states and 1111 transitions. Second operand 3 states. [2018-11-14 18:06:13,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:13,075 INFO L93 Difference]: Finished difference Result 985 states and 1661 transitions. [2018-11-14 18:06:13,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:13,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-14 18:06:13,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:13,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:13,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 234 transitions. [2018-11-14 18:06:13,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:13,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 234 transitions. [2018-11-14 18:06:13,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 234 transitions. [2018-11-14 18:06:13,330 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:13,357 INFO L225 Difference]: With dead ends: 985 [2018-11-14 18:06:13,357 INFO L226 Difference]: Without dead ends: 667 [2018-11-14 18:06:13,358 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-14 18:06:13,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-11-14 18:06:13,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 665. [2018-11-14 18:06:13,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:13,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 667 states. Second operand 665 states. [2018-11-14 18:06:13,595 INFO L74 IsIncluded]: Start isIncluded. First operand 667 states. Second operand 665 states. [2018-11-14 18:06:13,595 INFO L87 Difference]: Start difference. First operand 667 states. Second operand 665 states. [2018-11-14 18:06:13,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:13,614 INFO L93 Difference]: Finished difference Result 667 states and 1112 transitions. [2018-11-14 18:06:13,614 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1112 transitions. [2018-11-14 18:06:13,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:13,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:13,615 INFO L74 IsIncluded]: Start isIncluded. First operand 665 states. Second operand 667 states. [2018-11-14 18:06:13,615 INFO L87 Difference]: Start difference. First operand 665 states. Second operand 667 states. [2018-11-14 18:06:13,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:13,638 INFO L93 Difference]: Finished difference Result 667 states and 1112 transitions. [2018-11-14 18:06:13,638 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1112 transitions. [2018-11-14 18:06:13,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:13,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:13,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:13,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:13,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2018-11-14 18:06:13,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 1111 transitions. [2018-11-14 18:06:13,657 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 1111 transitions. Word has length 28 [2018-11-14 18:06:13,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:13,658 INFO L480 AbstractCegarLoop]: Abstraction has 665 states and 1111 transitions. [2018-11-14 18:06:13,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:13,658 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 1111 transitions. [2018-11-14 18:06:13,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 18:06:13,658 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:13,659 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:13,659 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:13,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:13,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1425249457, now seen corresponding path program 1 times [2018-11-14 18:06:13,659 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:13,659 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 14 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 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:13,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:13,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:13,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:13,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:13,750 INFO L256 TraceCheckUtils]: 0: Hoare triple {17627#true} call ULTIMATE.init(); {17627#true} is VALID [2018-11-14 18:06:13,750 INFO L273 TraceCheckUtils]: 1: Hoare triple {17627#true} assume true; {17627#true} is VALID [2018-11-14 18:06:13,751 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {17627#true} {17627#true} #249#return; {17627#true} is VALID [2018-11-14 18:06:13,751 INFO L256 TraceCheckUtils]: 3: Hoare triple {17627#true} call #t~ret14 := main(); {17627#true} is VALID [2018-11-14 18:06:13,751 INFO L273 TraceCheckUtils]: 4: Hoare triple {17627#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {17627#true} is VALID [2018-11-14 18:06:13,751 INFO L273 TraceCheckUtils]: 5: Hoare triple {17627#true} assume true; {17627#true} is VALID [2018-11-14 18:06:13,751 INFO L273 TraceCheckUtils]: 6: Hoare triple {17627#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {17627#true} is VALID [2018-11-14 18:06:13,752 INFO L273 TraceCheckUtils]: 7: Hoare triple {17627#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {17627#true} is VALID [2018-11-14 18:06:13,752 INFO L273 TraceCheckUtils]: 8: Hoare triple {17627#true} assume !(~p1~0 != 0bv32); {17627#true} is VALID [2018-11-14 18:06:13,752 INFO L273 TraceCheckUtils]: 9: Hoare triple {17627#true} assume !(~p2~0 != 0bv32); {17627#true} is VALID [2018-11-14 18:06:13,752 INFO L273 TraceCheckUtils]: 10: Hoare triple {17627#true} assume !(~p3~0 != 0bv32); {17627#true} is VALID [2018-11-14 18:06:13,752 INFO L273 TraceCheckUtils]: 11: Hoare triple {17627#true} assume !(~p4~0 != 0bv32); {17627#true} is VALID [2018-11-14 18:06:13,753 INFO L273 TraceCheckUtils]: 12: Hoare triple {17627#true} assume !(~p5~0 != 0bv32); {17668#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:06:13,753 INFO L273 TraceCheckUtils]: 13: Hoare triple {17668#(= (_ bv0 32) main_~p5~0)} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {17668#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:06:13,755 INFO L273 TraceCheckUtils]: 14: Hoare triple {17668#(= (_ bv0 32) main_~p5~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {17668#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:06:13,762 INFO L273 TraceCheckUtils]: 15: Hoare triple {17668#(= (_ bv0 32) main_~p5~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {17668#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:06:13,763 INFO L273 TraceCheckUtils]: 16: Hoare triple {17668#(= (_ bv0 32) main_~p5~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {17668#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:06:13,763 INFO L273 TraceCheckUtils]: 17: Hoare triple {17668#(= (_ bv0 32) main_~p5~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {17668#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:06:13,765 INFO L273 TraceCheckUtils]: 18: Hoare triple {17668#(= (_ bv0 32) main_~p5~0)} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {17668#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:06:13,765 INFO L273 TraceCheckUtils]: 19: Hoare triple {17668#(= (_ bv0 32) main_~p5~0)} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {17668#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:06:13,767 INFO L273 TraceCheckUtils]: 20: Hoare triple {17668#(= (_ bv0 32) main_~p5~0)} assume !(~p13~0 != 0bv32); {17668#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:06:13,767 INFO L273 TraceCheckUtils]: 21: Hoare triple {17668#(= (_ bv0 32) main_~p5~0)} assume !(~p1~0 != 0bv32); {17668#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:06:13,770 INFO L273 TraceCheckUtils]: 22: Hoare triple {17668#(= (_ bv0 32) main_~p5~0)} assume !(~p2~0 != 0bv32); {17668#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:06:13,770 INFO L273 TraceCheckUtils]: 23: Hoare triple {17668#(= (_ bv0 32) main_~p5~0)} assume !(~p3~0 != 0bv32); {17668#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:06:13,771 INFO L273 TraceCheckUtils]: 24: Hoare triple {17668#(= (_ bv0 32) main_~p5~0)} assume !(~p4~0 != 0bv32); {17668#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:06:13,773 INFO L273 TraceCheckUtils]: 25: Hoare triple {17668#(= (_ bv0 32) main_~p5~0)} assume ~p5~0 != 0bv32; {17628#false} is VALID [2018-11-14 18:06:13,773 INFO L273 TraceCheckUtils]: 26: Hoare triple {17628#false} assume ~lk5~0 != 1bv32; {17628#false} is VALID [2018-11-14 18:06:13,773 INFO L273 TraceCheckUtils]: 27: Hoare triple {17628#false} assume !false; {17628#false} is VALID [2018-11-14 18:06:13,774 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-14 18:06:13,774 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:13,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:13,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:13,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-14 18:06:13,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:13,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:13,801 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:13,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:13,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:13,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:13,802 INFO L87 Difference]: Start difference. First operand 665 states and 1111 transitions. Second operand 3 states. [2018-11-14 18:06:14,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:14,868 INFO L93 Difference]: Finished difference Result 1933 states and 3225 transitions. [2018-11-14 18:06:14,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:14,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-14 18:06:14,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:14,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:14,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 237 transitions. [2018-11-14 18:06:14,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:14,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 237 transitions. [2018-11-14 18:06:14,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 237 transitions. [2018-11-14 18:06:15,105 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 237 edges. 237 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:15,173 INFO L225 Difference]: With dead ends: 1933 [2018-11-14 18:06:15,173 INFO L226 Difference]: Without dead ends: 1291 [2018-11-14 18:06:15,174 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-14 18:06:15,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2018-11-14 18:06:15,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1289. [2018-11-14 18:06:15,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:15,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1291 states. Second operand 1289 states. [2018-11-14 18:06:15,741 INFO L74 IsIncluded]: Start isIncluded. First operand 1291 states. Second operand 1289 states. [2018-11-14 18:06:15,741 INFO L87 Difference]: Start difference. First operand 1291 states. Second operand 1289 states. [2018-11-14 18:06:15,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:15,795 INFO L93 Difference]: Finished difference Result 1291 states and 2120 transitions. [2018-11-14 18:06:15,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 2120 transitions. [2018-11-14 18:06:15,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:15,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:15,797 INFO L74 IsIncluded]: Start isIncluded. First operand 1289 states. Second operand 1291 states. [2018-11-14 18:06:15,797 INFO L87 Difference]: Start difference. First operand 1289 states. Second operand 1291 states. [2018-11-14 18:06:15,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:15,856 INFO L93 Difference]: Finished difference Result 1291 states and 2120 transitions. [2018-11-14 18:06:15,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 2120 transitions. [2018-11-14 18:06:15,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:15,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:15,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:15,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:15,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1289 states. [2018-11-14 18:06:15,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 2119 transitions. [2018-11-14 18:06:15,908 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 2119 transitions. Word has length 28 [2018-11-14 18:06:15,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:15,908 INFO L480 AbstractCegarLoop]: Abstraction has 1289 states and 2119 transitions. [2018-11-14 18:06:15,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:15,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 2119 transitions. [2018-11-14 18:06:15,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 18:06:15,909 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:15,909 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:15,909 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:15,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:15,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1848649485, now seen corresponding path program 1 times [2018-11-14 18:06:15,910 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:15,910 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 15 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 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:15,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:15,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:16,066 INFO L256 TraceCheckUtils]: 0: Hoare triple {23611#true} call ULTIMATE.init(); {23611#true} is VALID [2018-11-14 18:06:16,066 INFO L273 TraceCheckUtils]: 1: Hoare triple {23611#true} assume true; {23611#true} is VALID [2018-11-14 18:06:16,067 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {23611#true} {23611#true} #249#return; {23611#true} is VALID [2018-11-14 18:06:16,067 INFO L256 TraceCheckUtils]: 3: Hoare triple {23611#true} call #t~ret14 := main(); {23611#true} is VALID [2018-11-14 18:06:16,067 INFO L273 TraceCheckUtils]: 4: Hoare triple {23611#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {23611#true} is VALID [2018-11-14 18:06:16,067 INFO L273 TraceCheckUtils]: 5: Hoare triple {23611#true} assume true; {23611#true} is VALID [2018-11-14 18:06:16,068 INFO L273 TraceCheckUtils]: 6: Hoare triple {23611#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {23611#true} is VALID [2018-11-14 18:06:16,068 INFO L273 TraceCheckUtils]: 7: Hoare triple {23611#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {23611#true} is VALID [2018-11-14 18:06:16,068 INFO L273 TraceCheckUtils]: 8: Hoare triple {23611#true} assume !(~p1~0 != 0bv32); {23611#true} is VALID [2018-11-14 18:06:16,068 INFO L273 TraceCheckUtils]: 9: Hoare triple {23611#true} assume !(~p2~0 != 0bv32); {23611#true} is VALID [2018-11-14 18:06:16,068 INFO L273 TraceCheckUtils]: 10: Hoare triple {23611#true} assume !(~p3~0 != 0bv32); {23611#true} is VALID [2018-11-14 18:06:16,068 INFO L273 TraceCheckUtils]: 11: Hoare triple {23611#true} assume !(~p4~0 != 0bv32); {23611#true} is VALID [2018-11-14 18:06:16,069 INFO L273 TraceCheckUtils]: 12: Hoare triple {23611#true} assume ~p5~0 != 0bv32;~lk5~0 := 1bv32; {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:16,069 INFO L273 TraceCheckUtils]: 13: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:16,069 INFO L273 TraceCheckUtils]: 14: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:16,070 INFO L273 TraceCheckUtils]: 15: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:16,070 INFO L273 TraceCheckUtils]: 16: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:16,070 INFO L273 TraceCheckUtils]: 17: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:16,071 INFO L273 TraceCheckUtils]: 18: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:16,071 INFO L273 TraceCheckUtils]: 19: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:16,071 INFO L273 TraceCheckUtils]: 20: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p13~0 != 0bv32); {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:16,072 INFO L273 TraceCheckUtils]: 21: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:16,072 INFO L273 TraceCheckUtils]: 22: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:16,072 INFO L273 TraceCheckUtils]: 23: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p3~0 != 0bv32); {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:16,073 INFO L273 TraceCheckUtils]: 24: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p4~0 != 0bv32); {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:16,073 INFO L273 TraceCheckUtils]: 25: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p5~0 != 0bv32; {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:16,074 INFO L273 TraceCheckUtils]: 26: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk5~0 != 1bv32; {23612#false} is VALID [2018-11-14 18:06:16,074 INFO L273 TraceCheckUtils]: 27: Hoare triple {23612#false} assume !false; {23612#false} is VALID [2018-11-14 18:06:16,076 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-14 18:06:16,076 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:16,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:16,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:16,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-14 18:06:16,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:16,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:16,106 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:16,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:16,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:16,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:16,107 INFO L87 Difference]: Start difference. First operand 1289 states and 2119 transitions. Second operand 3 states. [2018-11-14 18:06:16,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:16,726 INFO L93 Difference]: Finished difference Result 1597 states and 2681 transitions. [2018-11-14 18:06:16,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:16,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-14 18:06:16,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:16,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:16,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2018-11-14 18:06:16,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:16,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2018-11-14 18:06:16,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 149 transitions. [2018-11-14 18:06:16,886 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:16,984 INFO L225 Difference]: With dead ends: 1597 [2018-11-14 18:06:16,985 INFO L226 Difference]: Without dead ends: 1595 [2018-11-14 18:06:16,985 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-14 18:06:16,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2018-11-14 18:06:17,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1289. [2018-11-14 18:06:17,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:17,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1595 states. Second operand 1289 states. [2018-11-14 18:06:17,916 INFO L74 IsIncluded]: Start isIncluded. First operand 1595 states. Second operand 1289 states. [2018-11-14 18:06:17,916 INFO L87 Difference]: Start difference. First operand 1595 states. Second operand 1289 states. [2018-11-14 18:06:17,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:17,999 INFO L93 Difference]: Finished difference Result 1595 states and 2664 transitions. [2018-11-14 18:06:18,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 2664 transitions. [2018-11-14 18:06:18,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:18,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:18,001 INFO L74 IsIncluded]: Start isIncluded. First operand 1289 states. Second operand 1595 states. [2018-11-14 18:06:18,002 INFO L87 Difference]: Start difference. First operand 1289 states. Second operand 1595 states. [2018-11-14 18:06:18,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:18,095 INFO L93 Difference]: Finished difference Result 1595 states and 2664 transitions. [2018-11-14 18:06:18,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 2664 transitions. [2018-11-14 18:06:18,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:18,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:18,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:18,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:18,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1289 states. [2018-11-14 18:06:18,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 2103 transitions. [2018-11-14 18:06:18,152 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 2103 transitions. Word has length 28 [2018-11-14 18:06:18,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:18,153 INFO L480 AbstractCegarLoop]: Abstraction has 1289 states and 2103 transitions. [2018-11-14 18:06:18,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:18,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 2103 transitions. [2018-11-14 18:06:18,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 18:06:18,154 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:18,154 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:18,154 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:18,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:18,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1233273980, now seen corresponding path program 1 times [2018-11-14 18:06:18,155 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:18,155 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 16 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 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:18,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:18,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:18,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:18,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:18,462 INFO L256 TraceCheckUtils]: 0: Hoare triple {29867#true} call ULTIMATE.init(); {29867#true} is VALID [2018-11-14 18:06:18,462 INFO L273 TraceCheckUtils]: 1: Hoare triple {29867#true} assume true; {29867#true} is VALID [2018-11-14 18:06:18,462 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {29867#true} {29867#true} #249#return; {29867#true} is VALID [2018-11-14 18:06:18,463 INFO L256 TraceCheckUtils]: 3: Hoare triple {29867#true} call #t~ret14 := main(); {29867#true} is VALID [2018-11-14 18:06:18,463 INFO L273 TraceCheckUtils]: 4: Hoare triple {29867#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {29867#true} is VALID [2018-11-14 18:06:18,463 INFO L273 TraceCheckUtils]: 5: Hoare triple {29867#true} assume true; {29867#true} is VALID [2018-11-14 18:06:18,463 INFO L273 TraceCheckUtils]: 6: Hoare triple {29867#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {29867#true} is VALID [2018-11-14 18:06:18,465 INFO L273 TraceCheckUtils]: 7: Hoare triple {29867#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {29867#true} is VALID [2018-11-14 18:06:18,465 INFO L273 TraceCheckUtils]: 8: Hoare triple {29867#true} assume !(~p1~0 != 0bv32); {29867#true} is VALID [2018-11-14 18:06:18,465 INFO L273 TraceCheckUtils]: 9: Hoare triple {29867#true} assume !(~p2~0 != 0bv32); {29867#true} is VALID [2018-11-14 18:06:18,465 INFO L273 TraceCheckUtils]: 10: Hoare triple {29867#true} assume !(~p3~0 != 0bv32); {29867#true} is VALID [2018-11-14 18:06:18,466 INFO L273 TraceCheckUtils]: 11: Hoare triple {29867#true} assume !(~p4~0 != 0bv32); {29867#true} is VALID [2018-11-14 18:06:18,466 INFO L273 TraceCheckUtils]: 12: Hoare triple {29867#true} assume !(~p5~0 != 0bv32); {29867#true} is VALID [2018-11-14 18:06:18,469 INFO L273 TraceCheckUtils]: 13: Hoare triple {29867#true} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:18,470 INFO L273 TraceCheckUtils]: 14: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:18,470 INFO L273 TraceCheckUtils]: 15: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:18,471 INFO L273 TraceCheckUtils]: 16: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:18,471 INFO L273 TraceCheckUtils]: 17: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:18,475 INFO L273 TraceCheckUtils]: 18: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:18,475 INFO L273 TraceCheckUtils]: 19: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:18,475 INFO L273 TraceCheckUtils]: 20: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p13~0 != 0bv32); {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:18,476 INFO L273 TraceCheckUtils]: 21: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:18,476 INFO L273 TraceCheckUtils]: 22: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:18,476 INFO L273 TraceCheckUtils]: 23: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p3~0 != 0bv32); {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:18,477 INFO L273 TraceCheckUtils]: 24: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p4~0 != 0bv32); {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:18,477 INFO L273 TraceCheckUtils]: 25: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:18,477 INFO L273 TraceCheckUtils]: 26: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32; {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:18,478 INFO L273 TraceCheckUtils]: 27: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk6~0 != 1bv32; {29868#false} is VALID [2018-11-14 18:06:18,478 INFO L273 TraceCheckUtils]: 28: Hoare triple {29868#false} assume !false; {29868#false} is VALID [2018-11-14 18:06:18,479 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-14 18:06:18,479 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:18,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:18,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:18,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-14 18:06:18,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:18,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:18,508 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:18,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:18,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:18,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:18,509 INFO L87 Difference]: Start difference. First operand 1289 states and 2103 transitions. Second operand 3 states. [2018-11-14 18:06:19,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:19,507 INFO L93 Difference]: Finished difference Result 2365 states and 3929 transitions. [2018-11-14 18:06:19,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:19,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-14 18:06:19,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:19,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:19,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2018-11-14 18:06:19,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:19,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2018-11-14 18:06:19,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 148 transitions. [2018-11-14 18:06:19,672 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:19,859 INFO L225 Difference]: With dead ends: 2365 [2018-11-14 18:06:19,860 INFO L226 Difference]: Without dead ends: 2363 [2018-11-14 18:06:19,860 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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-14 18:06:19,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2363 states. [2018-11-14 18:06:20,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2363 to 1817. [2018-11-14 18:06:20,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:20,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2363 states. Second operand 1817 states. [2018-11-14 18:06:20,352 INFO L74 IsIncluded]: Start isIncluded. First operand 2363 states. Second operand 1817 states. [2018-11-14 18:06:20,352 INFO L87 Difference]: Start difference. First operand 2363 states. Second operand 1817 states. [2018-11-14 18:06:20,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:20,509 INFO L93 Difference]: Finished difference Result 2363 states and 3896 transitions. [2018-11-14 18:06:20,509 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3896 transitions. [2018-11-14 18:06:20,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:20,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:20,512 INFO L74 IsIncluded]: Start isIncluded. First operand 1817 states. Second operand 2363 states. [2018-11-14 18:06:20,512 INFO L87 Difference]: Start difference. First operand 1817 states. Second operand 2363 states. [2018-11-14 18:06:20,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:20,678 INFO L93 Difference]: Finished difference Result 2363 states and 3896 transitions. [2018-11-14 18:06:20,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3896 transitions. [2018-11-14 18:06:20,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:20,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:20,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:20,681 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:20,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1817 states. [2018-11-14 18:06:20,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 2903 transitions. [2018-11-14 18:06:20,782 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 2903 transitions. Word has length 29 [2018-11-14 18:06:20,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:20,782 INFO L480 AbstractCegarLoop]: Abstraction has 1817 states and 2903 transitions. [2018-11-14 18:06:20,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:20,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2903 transitions. [2018-11-14 18:06:20,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 18:06:20,784 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:20,784 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:20,785 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:20,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:20,785 INFO L82 PathProgramCache]: Analyzing trace with hash 212205626, now seen corresponding path program 1 times [2018-11-14 18:06:20,785 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:20,785 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 17 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 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:20,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:20,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:20,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:20,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:20,963 INFO L256 TraceCheckUtils]: 0: Hoare triple {38974#true} call ULTIMATE.init(); {38974#true} is VALID [2018-11-14 18:06:20,963 INFO L273 TraceCheckUtils]: 1: Hoare triple {38974#true} assume true; {38974#true} is VALID [2018-11-14 18:06:20,963 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {38974#true} {38974#true} #249#return; {38974#true} is VALID [2018-11-14 18:06:20,964 INFO L256 TraceCheckUtils]: 3: Hoare triple {38974#true} call #t~ret14 := main(); {38974#true} is VALID [2018-11-14 18:06:20,964 INFO L273 TraceCheckUtils]: 4: Hoare triple {38974#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {38974#true} is VALID [2018-11-14 18:06:20,964 INFO L273 TraceCheckUtils]: 5: Hoare triple {38974#true} assume true; {38974#true} is VALID [2018-11-14 18:06:20,964 INFO L273 TraceCheckUtils]: 6: Hoare triple {38974#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {38974#true} is VALID [2018-11-14 18:06:20,964 INFO L273 TraceCheckUtils]: 7: Hoare triple {38974#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {38974#true} is VALID [2018-11-14 18:06:20,965 INFO L273 TraceCheckUtils]: 8: Hoare triple {38974#true} assume !(~p1~0 != 0bv32); {38974#true} is VALID [2018-11-14 18:06:20,965 INFO L273 TraceCheckUtils]: 9: Hoare triple {38974#true} assume !(~p2~0 != 0bv32); {38974#true} is VALID [2018-11-14 18:06:20,965 INFO L273 TraceCheckUtils]: 10: Hoare triple {38974#true} assume !(~p3~0 != 0bv32); {38974#true} is VALID [2018-11-14 18:06:20,965 INFO L273 TraceCheckUtils]: 11: Hoare triple {38974#true} assume !(~p4~0 != 0bv32); {38974#true} is VALID [2018-11-14 18:06:20,965 INFO L273 TraceCheckUtils]: 12: Hoare triple {38974#true} assume !(~p5~0 != 0bv32); {38974#true} is VALID [2018-11-14 18:06:20,966 INFO L273 TraceCheckUtils]: 13: Hoare triple {38974#true} assume !(~p6~0 != 0bv32); {39018#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:06:20,966 INFO L273 TraceCheckUtils]: 14: Hoare triple {39018#(= (_ bv0 32) main_~p6~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {39018#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:06:20,966 INFO L273 TraceCheckUtils]: 15: Hoare triple {39018#(= (_ bv0 32) main_~p6~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {39018#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:06:20,967 INFO L273 TraceCheckUtils]: 16: Hoare triple {39018#(= (_ bv0 32) main_~p6~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {39018#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:06:20,967 INFO L273 TraceCheckUtils]: 17: Hoare triple {39018#(= (_ bv0 32) main_~p6~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {39018#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:06:20,967 INFO L273 TraceCheckUtils]: 18: Hoare triple {39018#(= (_ bv0 32) main_~p6~0)} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {39018#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:06:20,967 INFO L273 TraceCheckUtils]: 19: Hoare triple {39018#(= (_ bv0 32) main_~p6~0)} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {39018#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:06:20,968 INFO L273 TraceCheckUtils]: 20: Hoare triple {39018#(= (_ bv0 32) main_~p6~0)} assume !(~p13~0 != 0bv32); {39018#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:06:20,968 INFO L273 TraceCheckUtils]: 21: Hoare triple {39018#(= (_ bv0 32) main_~p6~0)} assume !(~p1~0 != 0bv32); {39018#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:06:20,968 INFO L273 TraceCheckUtils]: 22: Hoare triple {39018#(= (_ bv0 32) main_~p6~0)} assume !(~p2~0 != 0bv32); {39018#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:06:20,969 INFO L273 TraceCheckUtils]: 23: Hoare triple {39018#(= (_ bv0 32) main_~p6~0)} assume !(~p3~0 != 0bv32); {39018#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:06:20,969 INFO L273 TraceCheckUtils]: 24: Hoare triple {39018#(= (_ bv0 32) main_~p6~0)} assume !(~p4~0 != 0bv32); {39018#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:06:20,970 INFO L273 TraceCheckUtils]: 25: Hoare triple {39018#(= (_ bv0 32) main_~p6~0)} assume !(~p5~0 != 0bv32); {39018#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:06:20,970 INFO L273 TraceCheckUtils]: 26: Hoare triple {39018#(= (_ bv0 32) main_~p6~0)} assume ~p6~0 != 0bv32; {38975#false} is VALID [2018-11-14 18:06:20,971 INFO L273 TraceCheckUtils]: 27: Hoare triple {38975#false} assume ~lk6~0 != 1bv32; {38975#false} is VALID [2018-11-14 18:06:20,971 INFO L273 TraceCheckUtils]: 28: Hoare triple {38975#false} assume !false; {38975#false} is VALID [2018-11-14 18:06:20,973 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-14 18:06:20,973 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:20,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:20,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:20,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-14 18:06:20,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:20,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:21,005 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:21,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:21,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:21,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:21,007 INFO L87 Difference]: Start difference. First operand 1817 states and 2903 transitions. Second operand 3 states. [2018-11-14 18:06:22,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:22,586 INFO L93 Difference]: Finished difference Result 4317 states and 6937 transitions. [2018-11-14 18:06:22,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:22,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-14 18:06:22,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:22,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:22,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 233 transitions. [2018-11-14 18:06:22,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:22,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 233 transitions. [2018-11-14 18:06:22,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 233 transitions. [2018-11-14 18:06:22,841 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 233 edges. 233 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:23,085 INFO L225 Difference]: With dead ends: 4317 [2018-11-14 18:06:23,086 INFO L226 Difference]: Without dead ends: 2523 [2018-11-14 18:06:23,089 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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-14 18:06:23,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2523 states. [2018-11-14 18:06:23,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2523 to 2521. [2018-11-14 18:06:23,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:23,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2523 states. Second operand 2521 states. [2018-11-14 18:06:23,903 INFO L74 IsIncluded]: Start isIncluded. First operand 2523 states. Second operand 2521 states. [2018-11-14 18:06:23,903 INFO L87 Difference]: Start difference. First operand 2523 states. Second operand 2521 states. [2018-11-14 18:06:24,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:24,103 INFO L93 Difference]: Finished difference Result 2523 states and 4008 transitions. [2018-11-14 18:06:24,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 4008 transitions. [2018-11-14 18:06:24,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:24,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:24,105 INFO L74 IsIncluded]: Start isIncluded. First operand 2521 states. Second operand 2523 states. [2018-11-14 18:06:24,106 INFO L87 Difference]: Start difference. First operand 2521 states. Second operand 2523 states. [2018-11-14 18:06:24,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:24,279 INFO L93 Difference]: Finished difference Result 2523 states and 4008 transitions. [2018-11-14 18:06:24,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 4008 transitions. [2018-11-14 18:06:24,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:24,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:24,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:24,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:24,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2521 states. [2018-11-14 18:06:24,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2521 states to 2521 states and 4007 transitions. [2018-11-14 18:06:24,525 INFO L78 Accepts]: Start accepts. Automaton has 2521 states and 4007 transitions. Word has length 29 [2018-11-14 18:06:24,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:24,526 INFO L480 AbstractCegarLoop]: Abstraction has 2521 states and 4007 transitions. [2018-11-14 18:06:24,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:24,526 INFO L276 IsEmpty]: Start isEmpty. Operand 2521 states and 4007 transitions. [2018-11-14 18:06:24,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 18:06:24,527 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:24,527 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:24,528 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:24,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:24,528 INFO L82 PathProgramCache]: Analyzing trace with hash -422998170, now seen corresponding path program 1 times [2018-11-14 18:06:24,528 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:24,528 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 18 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 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:24,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:24,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:24,643 INFO L256 TraceCheckUtils]: 0: Hoare triple {51121#true} call ULTIMATE.init(); {51121#true} is VALID [2018-11-14 18:06:24,644 INFO L273 TraceCheckUtils]: 1: Hoare triple {51121#true} assume true; {51121#true} is VALID [2018-11-14 18:06:24,644 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {51121#true} {51121#true} #249#return; {51121#true} is VALID [2018-11-14 18:06:24,644 INFO L256 TraceCheckUtils]: 3: Hoare triple {51121#true} call #t~ret14 := main(); {51121#true} is VALID [2018-11-14 18:06:24,644 INFO L273 TraceCheckUtils]: 4: Hoare triple {51121#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {51121#true} is VALID [2018-11-14 18:06:24,645 INFO L273 TraceCheckUtils]: 5: Hoare triple {51121#true} assume true; {51121#true} is VALID [2018-11-14 18:06:24,645 INFO L273 TraceCheckUtils]: 6: Hoare triple {51121#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {51121#true} is VALID [2018-11-14 18:06:24,645 INFO L273 TraceCheckUtils]: 7: Hoare triple {51121#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {51121#true} is VALID [2018-11-14 18:06:24,645 INFO L273 TraceCheckUtils]: 8: Hoare triple {51121#true} assume !(~p1~0 != 0bv32); {51121#true} is VALID [2018-11-14 18:06:24,645 INFO L273 TraceCheckUtils]: 9: Hoare triple {51121#true} assume !(~p2~0 != 0bv32); {51121#true} is VALID [2018-11-14 18:06:24,645 INFO L273 TraceCheckUtils]: 10: Hoare triple {51121#true} assume !(~p3~0 != 0bv32); {51121#true} is VALID [2018-11-14 18:06:24,645 INFO L273 TraceCheckUtils]: 11: Hoare triple {51121#true} assume !(~p4~0 != 0bv32); {51121#true} is VALID [2018-11-14 18:06:24,646 INFO L273 TraceCheckUtils]: 12: Hoare triple {51121#true} assume !(~p5~0 != 0bv32); {51121#true} is VALID [2018-11-14 18:06:24,646 INFO L273 TraceCheckUtils]: 13: Hoare triple {51121#true} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {51165#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:06:24,646 INFO L273 TraceCheckUtils]: 14: Hoare triple {51165#(not (= (_ bv0 32) main_~p6~0))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {51165#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:06:24,647 INFO L273 TraceCheckUtils]: 15: Hoare triple {51165#(not (= (_ bv0 32) main_~p6~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {51165#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:06:24,647 INFO L273 TraceCheckUtils]: 16: Hoare triple {51165#(not (= (_ bv0 32) main_~p6~0))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {51165#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:06:24,647 INFO L273 TraceCheckUtils]: 17: Hoare triple {51165#(not (= (_ bv0 32) main_~p6~0))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {51165#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:06:24,648 INFO L273 TraceCheckUtils]: 18: Hoare triple {51165#(not (= (_ bv0 32) main_~p6~0))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {51165#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:06:24,648 INFO L273 TraceCheckUtils]: 19: Hoare triple {51165#(not (= (_ bv0 32) main_~p6~0))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {51165#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:06:24,648 INFO L273 TraceCheckUtils]: 20: Hoare triple {51165#(not (= (_ bv0 32) main_~p6~0))} assume !(~p13~0 != 0bv32); {51165#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:06:24,649 INFO L273 TraceCheckUtils]: 21: Hoare triple {51165#(not (= (_ bv0 32) main_~p6~0))} assume !(~p1~0 != 0bv32); {51165#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:06:24,649 INFO L273 TraceCheckUtils]: 22: Hoare triple {51165#(not (= (_ bv0 32) main_~p6~0))} assume !(~p2~0 != 0bv32); {51165#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:06:24,650 INFO L273 TraceCheckUtils]: 23: Hoare triple {51165#(not (= (_ bv0 32) main_~p6~0))} assume !(~p3~0 != 0bv32); {51165#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:06:24,650 INFO L273 TraceCheckUtils]: 24: Hoare triple {51165#(not (= (_ bv0 32) main_~p6~0))} assume !(~p4~0 != 0bv32); {51165#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:06:24,651 INFO L273 TraceCheckUtils]: 25: Hoare triple {51165#(not (= (_ bv0 32) main_~p6~0))} assume !(~p5~0 != 0bv32); {51165#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:06:24,652 INFO L273 TraceCheckUtils]: 26: Hoare triple {51165#(not (= (_ bv0 32) main_~p6~0))} assume !(~p6~0 != 0bv32); {51122#false} is VALID [2018-11-14 18:06:24,652 INFO L273 TraceCheckUtils]: 27: Hoare triple {51122#false} assume ~p7~0 != 0bv32; {51122#false} is VALID [2018-11-14 18:06:24,652 INFO L273 TraceCheckUtils]: 28: Hoare triple {51122#false} assume ~lk7~0 != 1bv32; {51122#false} is VALID [2018-11-14 18:06:24,652 INFO L273 TraceCheckUtils]: 29: Hoare triple {51122#false} assume !false; {51122#false} is VALID [2018-11-14 18:06:24,654 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-14 18:06:24,654 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:24,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:24,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:24,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-14 18:06:24,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:24,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:24,685 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:24,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:24,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:24,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:24,686 INFO L87 Difference]: Start difference. First operand 2521 states and 4007 transitions. Second operand 3 states. [2018-11-14 18:06:25,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:25,866 INFO L93 Difference]: Finished difference Result 3805 states and 6041 transitions. [2018-11-14 18:06:25,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:25,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-14 18:06:25,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:25,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:25,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 228 transitions. [2018-11-14 18:06:25,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:25,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 228 transitions. [2018-11-14 18:06:25,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 228 transitions. [2018-11-14 18:06:26,102 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:26,335 INFO L225 Difference]: With dead ends: 3805 [2018-11-14 18:06:26,335 INFO L226 Difference]: Without dead ends: 2571 [2018-11-14 18:06:26,337 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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-14 18:06:26,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2018-11-14 18:06:27,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2569. [2018-11-14 18:06:27,347 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:27,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2571 states. Second operand 2569 states. [2018-11-14 18:06:27,348 INFO L74 IsIncluded]: Start isIncluded. First operand 2571 states. Second operand 2569 states. [2018-11-14 18:06:27,348 INFO L87 Difference]: Start difference. First operand 2571 states. Second operand 2569 states. [2018-11-14 18:06:27,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:27,583 INFO L93 Difference]: Finished difference Result 2571 states and 4040 transitions. [2018-11-14 18:06:27,583 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 4040 transitions. [2018-11-14 18:06:27,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:27,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:27,586 INFO L74 IsIncluded]: Start isIncluded. First operand 2569 states. Second operand 2571 states. [2018-11-14 18:06:27,586 INFO L87 Difference]: Start difference. First operand 2569 states. Second operand 2571 states. [2018-11-14 18:06:27,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:27,819 INFO L93 Difference]: Finished difference Result 2571 states and 4040 transitions. [2018-11-14 18:06:27,819 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 4040 transitions. [2018-11-14 18:06:27,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:27,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:27,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:27,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:27,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2569 states. [2018-11-14 18:06:28,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 4039 transitions. [2018-11-14 18:06:28,072 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 4039 transitions. Word has length 30 [2018-11-14 18:06:28,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:28,072 INFO L480 AbstractCegarLoop]: Abstraction has 2569 states and 4039 transitions. [2018-11-14 18:06:28,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:28,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 4039 transitions. [2018-11-14 18:06:28,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 18:06:28,074 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:28,074 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:28,074 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:28,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:28,075 INFO L82 PathProgramCache]: Analyzing trace with hash -2011346072, now seen corresponding path program 1 times [2018-11-14 18:06:28,075 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:28,075 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 19 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 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:28,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:28,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:28,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:28,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:28,184 INFO L256 TraceCheckUtils]: 0: Hoare triple {62903#true} call ULTIMATE.init(); {62903#true} is VALID [2018-11-14 18:06:28,184 INFO L273 TraceCheckUtils]: 1: Hoare triple {62903#true} assume true; {62903#true} is VALID [2018-11-14 18:06:28,184 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {62903#true} {62903#true} #249#return; {62903#true} is VALID [2018-11-14 18:06:28,184 INFO L256 TraceCheckUtils]: 3: Hoare triple {62903#true} call #t~ret14 := main(); {62903#true} is VALID [2018-11-14 18:06:28,185 INFO L273 TraceCheckUtils]: 4: Hoare triple {62903#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {62903#true} is VALID [2018-11-14 18:06:28,185 INFO L273 TraceCheckUtils]: 5: Hoare triple {62903#true} assume true; {62903#true} is VALID [2018-11-14 18:06:28,185 INFO L273 TraceCheckUtils]: 6: Hoare triple {62903#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {62903#true} is VALID [2018-11-14 18:06:28,185 INFO L273 TraceCheckUtils]: 7: Hoare triple {62903#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {62903#true} is VALID [2018-11-14 18:06:28,185 INFO L273 TraceCheckUtils]: 8: Hoare triple {62903#true} assume !(~p1~0 != 0bv32); {62903#true} is VALID [2018-11-14 18:06:28,186 INFO L273 TraceCheckUtils]: 9: Hoare triple {62903#true} assume !(~p2~0 != 0bv32); {62903#true} is VALID [2018-11-14 18:06:28,186 INFO L273 TraceCheckUtils]: 10: Hoare triple {62903#true} assume !(~p3~0 != 0bv32); {62903#true} is VALID [2018-11-14 18:06:28,186 INFO L273 TraceCheckUtils]: 11: Hoare triple {62903#true} assume !(~p4~0 != 0bv32); {62903#true} is VALID [2018-11-14 18:06:28,186 INFO L273 TraceCheckUtils]: 12: Hoare triple {62903#true} assume !(~p5~0 != 0bv32); {62903#true} is VALID [2018-11-14 18:06:28,186 INFO L273 TraceCheckUtils]: 13: Hoare triple {62903#true} assume !(~p6~0 != 0bv32); {62903#true} is VALID [2018-11-14 18:06:28,187 INFO L273 TraceCheckUtils]: 14: Hoare triple {62903#true} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:28,187 INFO L273 TraceCheckUtils]: 15: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:28,187 INFO L273 TraceCheckUtils]: 16: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:28,188 INFO L273 TraceCheckUtils]: 17: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:28,188 INFO L273 TraceCheckUtils]: 18: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:28,188 INFO L273 TraceCheckUtils]: 19: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:28,189 INFO L273 TraceCheckUtils]: 20: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p13~0 != 0bv32); {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:28,189 INFO L273 TraceCheckUtils]: 21: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:28,189 INFO L273 TraceCheckUtils]: 22: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:28,190 INFO L273 TraceCheckUtils]: 23: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p3~0 != 0bv32); {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:28,190 INFO L273 TraceCheckUtils]: 24: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p4~0 != 0bv32); {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:28,190 INFO L273 TraceCheckUtils]: 25: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:28,191 INFO L273 TraceCheckUtils]: 26: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p6~0 != 0bv32); {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:28,191 INFO L273 TraceCheckUtils]: 27: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32; {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:28,192 INFO L273 TraceCheckUtils]: 28: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk7~0 != 1bv32; {62904#false} is VALID [2018-11-14 18:06:28,192 INFO L273 TraceCheckUtils]: 29: Hoare triple {62904#false} assume !false; {62904#false} is VALID [2018-11-14 18:06:28,194 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-14 18:06:28,194 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:28,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:28,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:28,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-14 18:06:28,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:28,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:28,227 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:28,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:28,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:28,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:28,228 INFO L87 Difference]: Start difference. First operand 2569 states and 4039 transitions. Second operand 3 states. [2018-11-14 18:06:30,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:30,651 INFO L93 Difference]: Finished difference Result 4621 states and 7401 transitions. [2018-11-14 18:06:30,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:30,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-14 18:06:30,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:30,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:30,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2018-11-14 18:06:30,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:30,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2018-11-14 18:06:30,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 144 transitions. [2018-11-14 18:06:30,829 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:31,716 INFO L225 Difference]: With dead ends: 4621 [2018-11-14 18:06:31,716 INFO L226 Difference]: Without dead ends: 4619 [2018-11-14 18:06:31,718 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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-14 18:06:31,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4619 states. [2018-11-14 18:06:32,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4619 to 3657. [2018-11-14 18:06:32,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:32,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4619 states. Second operand 3657 states. [2018-11-14 18:06:32,319 INFO L74 IsIncluded]: Start isIncluded. First operand 4619 states. Second operand 3657 states. [2018-11-14 18:06:32,319 INFO L87 Difference]: Start difference. First operand 4619 states. Second operand 3657 states. [2018-11-14 18:06:33,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:33,103 INFO L93 Difference]: Finished difference Result 4619 states and 7336 transitions. [2018-11-14 18:06:33,103 INFO L276 IsEmpty]: Start isEmpty. Operand 4619 states and 7336 transitions. [2018-11-14 18:06:33,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:33,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:33,109 INFO L74 IsIncluded]: Start isIncluded. First operand 3657 states. Second operand 4619 states. [2018-11-14 18:06:33,109 INFO L87 Difference]: Start difference. First operand 3657 states. Second operand 4619 states. [2018-11-14 18:06:33,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:33,889 INFO L93 Difference]: Finished difference Result 4619 states and 7336 transitions. [2018-11-14 18:06:33,889 INFO L276 IsEmpty]: Start isEmpty. Operand 4619 states and 7336 transitions. [2018-11-14 18:06:33,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:33,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:33,895 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:33,895 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:33,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3657 states. [2018-11-14 18:06:34,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3657 states to 3657 states and 5607 transitions. [2018-11-14 18:06:34,443 INFO L78 Accepts]: Start accepts. Automaton has 3657 states and 5607 transitions. Word has length 30 [2018-11-14 18:06:34,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:34,444 INFO L480 AbstractCegarLoop]: Abstraction has 3657 states and 5607 transitions. [2018-11-14 18:06:34,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:34,444 INFO L276 IsEmpty]: Start isEmpty. Operand 3657 states and 5607 transitions. [2018-11-14 18:06:34,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 18:06:34,447 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:34,447 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:34,447 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:34,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:34,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1262552870, now seen corresponding path program 1 times [2018-11-14 18:06:34,448 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:34,448 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 20 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 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:34,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:34,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:34,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:34,550 INFO L256 TraceCheckUtils]: 0: Hoare triple {80717#true} call ULTIMATE.init(); {80717#true} is VALID [2018-11-14 18:06:34,550 INFO L273 TraceCheckUtils]: 1: Hoare triple {80717#true} assume true; {80717#true} is VALID [2018-11-14 18:06:34,551 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {80717#true} {80717#true} #249#return; {80717#true} is VALID [2018-11-14 18:06:34,551 INFO L256 TraceCheckUtils]: 3: Hoare triple {80717#true} call #t~ret14 := main(); {80717#true} is VALID [2018-11-14 18:06:34,551 INFO L273 TraceCheckUtils]: 4: Hoare triple {80717#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {80717#true} is VALID [2018-11-14 18:06:34,551 INFO L273 TraceCheckUtils]: 5: Hoare triple {80717#true} assume true; {80717#true} is VALID [2018-11-14 18:06:34,551 INFO L273 TraceCheckUtils]: 6: Hoare triple {80717#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {80717#true} is VALID [2018-11-14 18:06:34,551 INFO L273 TraceCheckUtils]: 7: Hoare triple {80717#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {80717#true} is VALID [2018-11-14 18:06:34,551 INFO L273 TraceCheckUtils]: 8: Hoare triple {80717#true} assume !(~p1~0 != 0bv32); {80717#true} is VALID [2018-11-14 18:06:34,551 INFO L273 TraceCheckUtils]: 9: Hoare triple {80717#true} assume !(~p2~0 != 0bv32); {80717#true} is VALID [2018-11-14 18:06:34,552 INFO L273 TraceCheckUtils]: 10: Hoare triple {80717#true} assume !(~p3~0 != 0bv32); {80717#true} is VALID [2018-11-14 18:06:34,552 INFO L273 TraceCheckUtils]: 11: Hoare triple {80717#true} assume !(~p4~0 != 0bv32); {80717#true} is VALID [2018-11-14 18:06:34,552 INFO L273 TraceCheckUtils]: 12: Hoare triple {80717#true} assume !(~p5~0 != 0bv32); {80717#true} is VALID [2018-11-14 18:06:34,552 INFO L273 TraceCheckUtils]: 13: Hoare triple {80717#true} assume !(~p6~0 != 0bv32); {80717#true} is VALID [2018-11-14 18:06:34,552 INFO L273 TraceCheckUtils]: 14: Hoare triple {80717#true} assume !(~p7~0 != 0bv32); {80764#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:06:34,553 INFO L273 TraceCheckUtils]: 15: Hoare triple {80764#(= (_ bv0 32) main_~p7~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {80764#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:06:34,553 INFO L273 TraceCheckUtils]: 16: Hoare triple {80764#(= (_ bv0 32) main_~p7~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {80764#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:06:34,553 INFO L273 TraceCheckUtils]: 17: Hoare triple {80764#(= (_ bv0 32) main_~p7~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {80764#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:06:34,554 INFO L273 TraceCheckUtils]: 18: Hoare triple {80764#(= (_ bv0 32) main_~p7~0)} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {80764#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:06:34,554 INFO L273 TraceCheckUtils]: 19: Hoare triple {80764#(= (_ bv0 32) main_~p7~0)} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {80764#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:06:34,554 INFO L273 TraceCheckUtils]: 20: Hoare triple {80764#(= (_ bv0 32) main_~p7~0)} assume !(~p13~0 != 0bv32); {80764#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:06:34,555 INFO L273 TraceCheckUtils]: 21: Hoare triple {80764#(= (_ bv0 32) main_~p7~0)} assume !(~p1~0 != 0bv32); {80764#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:06:34,555 INFO L273 TraceCheckUtils]: 22: Hoare triple {80764#(= (_ bv0 32) main_~p7~0)} assume !(~p2~0 != 0bv32); {80764#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:06:34,555 INFO L273 TraceCheckUtils]: 23: Hoare triple {80764#(= (_ bv0 32) main_~p7~0)} assume !(~p3~0 != 0bv32); {80764#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:06:34,556 INFO L273 TraceCheckUtils]: 24: Hoare triple {80764#(= (_ bv0 32) main_~p7~0)} assume !(~p4~0 != 0bv32); {80764#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:06:34,556 INFO L273 TraceCheckUtils]: 25: Hoare triple {80764#(= (_ bv0 32) main_~p7~0)} assume !(~p5~0 != 0bv32); {80764#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:06:34,557 INFO L273 TraceCheckUtils]: 26: Hoare triple {80764#(= (_ bv0 32) main_~p7~0)} assume !(~p6~0 != 0bv32); {80764#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:06:34,558 INFO L273 TraceCheckUtils]: 27: Hoare triple {80764#(= (_ bv0 32) main_~p7~0)} assume ~p7~0 != 0bv32; {80718#false} is VALID [2018-11-14 18:06:34,558 INFO L273 TraceCheckUtils]: 28: Hoare triple {80718#false} assume ~lk7~0 != 1bv32; {80718#false} is VALID [2018-11-14 18:06:34,558 INFO L273 TraceCheckUtils]: 29: Hoare triple {80718#false} assume !false; {80718#false} is VALID [2018-11-14 18:06:34,560 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-14 18:06:34,560 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:34,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:34,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:34,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-14 18:06:34,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:34,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:34,605 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:34,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:34,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:34,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:34,606 INFO L87 Difference]: Start difference. First operand 3657 states and 5607 transitions. Second operand 3 states. [2018-11-14 18:06:38,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:38,687 INFO L93 Difference]: Finished difference Result 8589 states and 13225 transitions. [2018-11-14 18:06:38,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:38,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-14 18:06:38,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:38,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:38,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2018-11-14 18:06:38,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:38,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2018-11-14 18:06:38,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 230 transitions. [2018-11-14 18:06:38,928 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 230 edges. 230 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:40,076 INFO L225 Difference]: With dead ends: 8589 [2018-11-14 18:06:40,076 INFO L226 Difference]: Without dead ends: 5003 [2018-11-14 18:06:40,083 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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-14 18:06:40,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5003 states. [2018-11-14 18:06:41,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5003 to 5001. [2018-11-14 18:06:41,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:41,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5003 states. Second operand 5001 states. [2018-11-14 18:06:41,687 INFO L74 IsIncluded]: Start isIncluded. First operand 5003 states. Second operand 5001 states. [2018-11-14 18:06:41,687 INFO L87 Difference]: Start difference. First operand 5003 states. Second operand 5001 states. [2018-11-14 18:06:42,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:42,603 INFO L93 Difference]: Finished difference Result 5003 states and 7624 transitions. [2018-11-14 18:06:42,603 INFO L276 IsEmpty]: Start isEmpty. Operand 5003 states and 7624 transitions. [2018-11-14 18:06:42,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:42,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:42,609 INFO L74 IsIncluded]: Start isIncluded. First operand 5001 states. Second operand 5003 states. [2018-11-14 18:06:42,609 INFO L87 Difference]: Start difference. First operand 5001 states. Second operand 5003 states. [2018-11-14 18:06:43,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:43,565 INFO L93 Difference]: Finished difference Result 5003 states and 7624 transitions. [2018-11-14 18:06:43,565 INFO L276 IsEmpty]: Start isEmpty. Operand 5003 states and 7624 transitions. [2018-11-14 18:06:43,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:43,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:43,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:43,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:43,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5001 states. [2018-11-14 18:06:44,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5001 states to 5001 states and 7623 transitions. [2018-11-14 18:06:44,605 INFO L78 Accepts]: Start accepts. Automaton has 5001 states and 7623 transitions. Word has length 30 [2018-11-14 18:06:44,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:44,605 INFO L480 AbstractCegarLoop]: Abstraction has 5001 states and 7623 transitions. [2018-11-14 18:06:44,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:44,606 INFO L276 IsEmpty]: Start isEmpty. Operand 5001 states and 7623 transitions. [2018-11-14 18:06:44,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 18:06:44,609 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:44,609 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:44,609 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:44,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:44,609 INFO L82 PathProgramCache]: Analyzing trace with hash 2072995663, now seen corresponding path program 1 times [2018-11-14 18:06:44,609 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:44,609 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 21 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 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:44,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:44,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:44,707 INFO L256 TraceCheckUtils]: 0: Hoare triple {104739#true} call ULTIMATE.init(); {104739#true} is VALID [2018-11-14 18:06:44,707 INFO L273 TraceCheckUtils]: 1: Hoare triple {104739#true} assume true; {104739#true} is VALID [2018-11-14 18:06:44,708 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {104739#true} {104739#true} #249#return; {104739#true} is VALID [2018-11-14 18:06:44,708 INFO L256 TraceCheckUtils]: 3: Hoare triple {104739#true} call #t~ret14 := main(); {104739#true} is VALID [2018-11-14 18:06:44,708 INFO L273 TraceCheckUtils]: 4: Hoare triple {104739#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {104739#true} is VALID [2018-11-14 18:06:44,708 INFO L273 TraceCheckUtils]: 5: Hoare triple {104739#true} assume true; {104739#true} is VALID [2018-11-14 18:06:44,708 INFO L273 TraceCheckUtils]: 6: Hoare triple {104739#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {104739#true} is VALID [2018-11-14 18:06:44,709 INFO L273 TraceCheckUtils]: 7: Hoare triple {104739#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {104739#true} is VALID [2018-11-14 18:06:44,709 INFO L273 TraceCheckUtils]: 8: Hoare triple {104739#true} assume !(~p1~0 != 0bv32); {104739#true} is VALID [2018-11-14 18:06:44,709 INFO L273 TraceCheckUtils]: 9: Hoare triple {104739#true} assume !(~p2~0 != 0bv32); {104739#true} is VALID [2018-11-14 18:06:44,709 INFO L273 TraceCheckUtils]: 10: Hoare triple {104739#true} assume !(~p3~0 != 0bv32); {104739#true} is VALID [2018-11-14 18:06:44,709 INFO L273 TraceCheckUtils]: 11: Hoare triple {104739#true} assume !(~p4~0 != 0bv32); {104739#true} is VALID [2018-11-14 18:06:44,709 INFO L273 TraceCheckUtils]: 12: Hoare triple {104739#true} assume !(~p5~0 != 0bv32); {104739#true} is VALID [2018-11-14 18:06:44,709 INFO L273 TraceCheckUtils]: 13: Hoare triple {104739#true} assume !(~p6~0 != 0bv32); {104739#true} is VALID [2018-11-14 18:06:44,710 INFO L273 TraceCheckUtils]: 14: Hoare triple {104739#true} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {104786#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:06:44,710 INFO L273 TraceCheckUtils]: 15: Hoare triple {104786#(not (= (_ bv0 32) main_~p7~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {104786#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:06:44,710 INFO L273 TraceCheckUtils]: 16: Hoare triple {104786#(not (= (_ bv0 32) main_~p7~0))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {104786#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:06:44,711 INFO L273 TraceCheckUtils]: 17: Hoare triple {104786#(not (= (_ bv0 32) main_~p7~0))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {104786#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:06:44,711 INFO L273 TraceCheckUtils]: 18: Hoare triple {104786#(not (= (_ bv0 32) main_~p7~0))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {104786#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:06:44,711 INFO L273 TraceCheckUtils]: 19: Hoare triple {104786#(not (= (_ bv0 32) main_~p7~0))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {104786#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:06:44,712 INFO L273 TraceCheckUtils]: 20: Hoare triple {104786#(not (= (_ bv0 32) main_~p7~0))} assume !(~p13~0 != 0bv32); {104786#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:06:44,712 INFO L273 TraceCheckUtils]: 21: Hoare triple {104786#(not (= (_ bv0 32) main_~p7~0))} assume !(~p1~0 != 0bv32); {104786#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:06:44,712 INFO L273 TraceCheckUtils]: 22: Hoare triple {104786#(not (= (_ bv0 32) main_~p7~0))} assume !(~p2~0 != 0bv32); {104786#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:06:44,713 INFO L273 TraceCheckUtils]: 23: Hoare triple {104786#(not (= (_ bv0 32) main_~p7~0))} assume !(~p3~0 != 0bv32); {104786#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:06:44,713 INFO L273 TraceCheckUtils]: 24: Hoare triple {104786#(not (= (_ bv0 32) main_~p7~0))} assume !(~p4~0 != 0bv32); {104786#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:06:44,713 INFO L273 TraceCheckUtils]: 25: Hoare triple {104786#(not (= (_ bv0 32) main_~p7~0))} assume !(~p5~0 != 0bv32); {104786#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:06:44,714 INFO L273 TraceCheckUtils]: 26: Hoare triple {104786#(not (= (_ bv0 32) main_~p7~0))} assume !(~p6~0 != 0bv32); {104786#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:06:44,714 INFO L273 TraceCheckUtils]: 27: Hoare triple {104786#(not (= (_ bv0 32) main_~p7~0))} assume !(~p7~0 != 0bv32); {104740#false} is VALID [2018-11-14 18:06:44,714 INFO L273 TraceCheckUtils]: 28: Hoare triple {104740#false} assume ~p8~0 != 0bv32; {104740#false} is VALID [2018-11-14 18:06:44,715 INFO L273 TraceCheckUtils]: 29: Hoare triple {104740#false} assume ~lk8~0 != 1bv32; {104740#false} is VALID [2018-11-14 18:06:44,715 INFO L273 TraceCheckUtils]: 30: Hoare triple {104740#false} assume !false; {104740#false} is VALID [2018-11-14 18:06:44,716 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-14 18:06:44,716 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:44,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:44,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:44,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-14 18:06:44,719 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:44,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:44,748 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:44,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:44,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:44,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:44,749 INFO L87 Difference]: Start difference. First operand 5001 states and 7623 transitions. Second operand 3 states. [2018-11-14 18:06:48,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:48,603 INFO L93 Difference]: Finished difference Result 7501 states and 11401 transitions. [2018-11-14 18:06:48,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:48,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-14 18:06:48,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:48,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:48,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2018-11-14 18:06:48,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:48,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2018-11-14 18:06:48,606 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 225 transitions. [2018-11-14 18:06:48,839 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:49,703 INFO L225 Difference]: With dead ends: 7501 [2018-11-14 18:06:49,703 INFO L226 Difference]: Without dead ends: 5067 [2018-11-14 18:06:49,707 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 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-14 18:06:49,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5067 states. [2018-11-14 18:06:50,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5067 to 5065. [2018-11-14 18:06:50,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:50,815 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5067 states. Second operand 5065 states. [2018-11-14 18:06:50,815 INFO L74 IsIncluded]: Start isIncluded. First operand 5067 states. Second operand 5065 states. [2018-11-14 18:06:50,815 INFO L87 Difference]: Start difference. First operand 5067 states. Second operand 5065 states. [2018-11-14 18:06:51,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:51,756 INFO L93 Difference]: Finished difference Result 5067 states and 7624 transitions. [2018-11-14 18:06:51,756 INFO L276 IsEmpty]: Start isEmpty. Operand 5067 states and 7624 transitions. [2018-11-14 18:06:51,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:51,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:51,762 INFO L74 IsIncluded]: Start isIncluded. First operand 5065 states. Second operand 5067 states. [2018-11-14 18:06:51,763 INFO L87 Difference]: Start difference. First operand 5065 states. Second operand 5067 states. [2018-11-14 18:06:52,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:52,713 INFO L93 Difference]: Finished difference Result 5067 states and 7624 transitions. [2018-11-14 18:06:52,713 INFO L276 IsEmpty]: Start isEmpty. Operand 5067 states and 7624 transitions. [2018-11-14 18:06:52,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:52,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:52,717 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:52,717 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:52,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5065 states. [2018-11-14 18:06:53,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5065 states to 5065 states and 7623 transitions. [2018-11-14 18:06:53,778 INFO L78 Accepts]: Start accepts. Automaton has 5065 states and 7623 transitions. Word has length 31 [2018-11-14 18:06:53,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:53,779 INFO L480 AbstractCegarLoop]: Abstraction has 5065 states and 7623 transitions. [2018-11-14 18:06:53,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:53,779 INFO L276 IsEmpty]: Start isEmpty. Operand 5065 states and 7623 transitions. [2018-11-14 18:06:53,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 18:06:53,781 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:53,781 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:53,781 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:53,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:53,781 INFO L82 PathProgramCache]: Analyzing trace with hash 484647761, now seen corresponding path program 1 times [2018-11-14 18:06:53,782 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:53,782 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 22 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 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:53,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:53,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:53,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:53,883 INFO L256 TraceCheckUtils]: 0: Hoare triple {127868#true} call ULTIMATE.init(); {127868#true} is VALID [2018-11-14 18:06:53,883 INFO L273 TraceCheckUtils]: 1: Hoare triple {127868#true} assume true; {127868#true} is VALID [2018-11-14 18:06:53,884 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {127868#true} {127868#true} #249#return; {127868#true} is VALID [2018-11-14 18:06:53,884 INFO L256 TraceCheckUtils]: 3: Hoare triple {127868#true} call #t~ret14 := main(); {127868#true} is VALID [2018-11-14 18:06:53,884 INFO L273 TraceCheckUtils]: 4: Hoare triple {127868#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {127868#true} is VALID [2018-11-14 18:06:53,884 INFO L273 TraceCheckUtils]: 5: Hoare triple {127868#true} assume true; {127868#true} is VALID [2018-11-14 18:06:53,884 INFO L273 TraceCheckUtils]: 6: Hoare triple {127868#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {127868#true} is VALID [2018-11-14 18:06:53,884 INFO L273 TraceCheckUtils]: 7: Hoare triple {127868#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {127868#true} is VALID [2018-11-14 18:06:53,885 INFO L273 TraceCheckUtils]: 8: Hoare triple {127868#true} assume !(~p1~0 != 0bv32); {127868#true} is VALID [2018-11-14 18:06:53,885 INFO L273 TraceCheckUtils]: 9: Hoare triple {127868#true} assume !(~p2~0 != 0bv32); {127868#true} is VALID [2018-11-14 18:06:53,885 INFO L273 TraceCheckUtils]: 10: Hoare triple {127868#true} assume !(~p3~0 != 0bv32); {127868#true} is VALID [2018-11-14 18:06:53,885 INFO L273 TraceCheckUtils]: 11: Hoare triple {127868#true} assume !(~p4~0 != 0bv32); {127868#true} is VALID [2018-11-14 18:06:53,885 INFO L273 TraceCheckUtils]: 12: Hoare triple {127868#true} assume !(~p5~0 != 0bv32); {127868#true} is VALID [2018-11-14 18:06:53,885 INFO L273 TraceCheckUtils]: 13: Hoare triple {127868#true} assume !(~p6~0 != 0bv32); {127868#true} is VALID [2018-11-14 18:06:53,885 INFO L273 TraceCheckUtils]: 14: Hoare triple {127868#true} assume !(~p7~0 != 0bv32); {127868#true} is VALID [2018-11-14 18:06:53,890 INFO L273 TraceCheckUtils]: 15: Hoare triple {127868#true} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:53,890 INFO L273 TraceCheckUtils]: 16: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:53,891 INFO L273 TraceCheckUtils]: 17: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:53,891 INFO L273 TraceCheckUtils]: 18: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:53,891 INFO L273 TraceCheckUtils]: 19: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:53,892 INFO L273 TraceCheckUtils]: 20: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p13~0 != 0bv32); {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:53,892 INFO L273 TraceCheckUtils]: 21: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:53,892 INFO L273 TraceCheckUtils]: 22: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:53,892 INFO L273 TraceCheckUtils]: 23: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p3~0 != 0bv32); {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:53,893 INFO L273 TraceCheckUtils]: 24: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p4~0 != 0bv32); {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:53,893 INFO L273 TraceCheckUtils]: 25: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:53,893 INFO L273 TraceCheckUtils]: 26: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p6~0 != 0bv32); {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:53,894 INFO L273 TraceCheckUtils]: 27: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p7~0 != 0bv32); {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:53,894 INFO L273 TraceCheckUtils]: 28: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32; {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:53,895 INFO L273 TraceCheckUtils]: 29: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk8~0 != 1bv32; {127869#false} is VALID [2018-11-14 18:06:53,895 INFO L273 TraceCheckUtils]: 30: Hoare triple {127869#false} assume !false; {127869#false} is VALID [2018-11-14 18:06:53,896 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-14 18:06:53,897 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:53,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:53,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:53,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-14 18:06:53,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:53,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:53,929 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:53,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:53,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:53,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:53,930 INFO L87 Difference]: Start difference. First operand 5065 states and 7623 transitions. Second operand 3 states. [2018-11-14 18:07:00,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:07:00,544 INFO L93 Difference]: Finished difference Result 8973 states and 13769 transitions. [2018-11-14 18:07:00,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:07:00,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-14 18:07:00,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:07:00,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:07:00,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2018-11-14 18:07:00,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:07:00,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2018-11-14 18:07:00,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 140 transitions. [2018-11-14 18:07:00,708 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:07:04,018 INFO L225 Difference]: With dead ends: 8973 [2018-11-14 18:07:04,019 INFO L226 Difference]: Without dead ends: 8971 [2018-11-14 18:07:04,020 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 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-14 18:07:04,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8971 states. [2018-11-14 18:07:05,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8971 to 7305. [2018-11-14 18:07:05,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:07:05,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8971 states. Second operand 7305 states. [2018-11-14 18:07:05,402 INFO L74 IsIncluded]: Start isIncluded. First operand 8971 states. Second operand 7305 states. [2018-11-14 18:07:05,402 INFO L87 Difference]: Start difference. First operand 8971 states. Second operand 7305 states. [2018-11-14 18:07:08,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:07:08,385 INFO L93 Difference]: Finished difference Result 8971 states and 13640 transitions. [2018-11-14 18:07:08,385 INFO L276 IsEmpty]: Start isEmpty. Operand 8971 states and 13640 transitions. [2018-11-14 18:07:08,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:07:08,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:07:08,393 INFO L74 IsIncluded]: Start isIncluded. First operand 7305 states. Second operand 8971 states. [2018-11-14 18:07:08,393 INFO L87 Difference]: Start difference. First operand 7305 states. Second operand 8971 states. [2018-11-14 18:07:11,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:07:11,427 INFO L93 Difference]: Finished difference Result 8971 states and 13640 transitions. [2018-11-14 18:07:11,427 INFO L276 IsEmpty]: Start isEmpty. Operand 8971 states and 13640 transitions. [2018-11-14 18:07:11,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:07:11,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:07:11,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:07:11,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:07:11,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7305 states. [2018-11-14 18:07:13,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7305 states to 7305 states and 10695 transitions. [2018-11-14 18:07:13,712 INFO L78 Accepts]: Start accepts. Automaton has 7305 states and 10695 transitions. Word has length 31 [2018-11-14 18:07:13,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:07:13,712 INFO L480 AbstractCegarLoop]: Abstraction has 7305 states and 10695 transitions. [2018-11-14 18:07:13,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:07:13,712 INFO L276 IsEmpty]: Start isEmpty. Operand 7305 states and 10695 transitions. [2018-11-14 18:07:13,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 18:07:13,715 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:07:13,716 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:07:13,716 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:07:13,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:07:13,716 INFO L82 PathProgramCache]: Analyzing trace with hash -536420593, now seen corresponding path program 1 times [2018-11-14 18:07:13,716 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:07:13,716 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 23 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 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:07:13,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:07:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:07:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:07:13,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:07:13,874 INFO L256 TraceCheckUtils]: 0: Hoare triple {162581#true} call ULTIMATE.init(); {162581#true} is VALID [2018-11-14 18:07:13,874 INFO L273 TraceCheckUtils]: 1: Hoare triple {162581#true} assume true; {162581#true} is VALID [2018-11-14 18:07:13,874 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {162581#true} {162581#true} #249#return; {162581#true} is VALID [2018-11-14 18:07:13,874 INFO L256 TraceCheckUtils]: 3: Hoare triple {162581#true} call #t~ret14 := main(); {162581#true} is VALID [2018-11-14 18:07:13,874 INFO L273 TraceCheckUtils]: 4: Hoare triple {162581#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {162581#true} is VALID [2018-11-14 18:07:13,875 INFO L273 TraceCheckUtils]: 5: Hoare triple {162581#true} assume true; {162581#true} is VALID [2018-11-14 18:07:13,875 INFO L273 TraceCheckUtils]: 6: Hoare triple {162581#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {162581#true} is VALID [2018-11-14 18:07:13,875 INFO L273 TraceCheckUtils]: 7: Hoare triple {162581#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {162581#true} is VALID [2018-11-14 18:07:13,875 INFO L273 TraceCheckUtils]: 8: Hoare triple {162581#true} assume !(~p1~0 != 0bv32); {162581#true} is VALID [2018-11-14 18:07:13,875 INFO L273 TraceCheckUtils]: 9: Hoare triple {162581#true} assume !(~p2~0 != 0bv32); {162581#true} is VALID [2018-11-14 18:07:13,875 INFO L273 TraceCheckUtils]: 10: Hoare triple {162581#true} assume !(~p3~0 != 0bv32); {162581#true} is VALID [2018-11-14 18:07:13,875 INFO L273 TraceCheckUtils]: 11: Hoare triple {162581#true} assume !(~p4~0 != 0bv32); {162581#true} is VALID [2018-11-14 18:07:13,875 INFO L273 TraceCheckUtils]: 12: Hoare triple {162581#true} assume !(~p5~0 != 0bv32); {162581#true} is VALID [2018-11-14 18:07:13,876 INFO L273 TraceCheckUtils]: 13: Hoare triple {162581#true} assume !(~p6~0 != 0bv32); {162581#true} is VALID [2018-11-14 18:07:13,876 INFO L273 TraceCheckUtils]: 14: Hoare triple {162581#true} assume !(~p7~0 != 0bv32); {162581#true} is VALID [2018-11-14 18:07:13,876 INFO L273 TraceCheckUtils]: 15: Hoare triple {162581#true} assume !(~p8~0 != 0bv32); {162631#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 18:07:13,880 INFO L273 TraceCheckUtils]: 16: Hoare triple {162631#(= (_ bv0 32) main_~p8~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {162631#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 18:07:13,882 INFO L273 TraceCheckUtils]: 17: Hoare triple {162631#(= (_ bv0 32) main_~p8~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {162631#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 18:07:13,882 INFO L273 TraceCheckUtils]: 18: Hoare triple {162631#(= (_ bv0 32) main_~p8~0)} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {162631#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 18:07:13,884 INFO L273 TraceCheckUtils]: 19: Hoare triple {162631#(= (_ bv0 32) main_~p8~0)} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {162631#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 18:07:13,884 INFO L273 TraceCheckUtils]: 20: Hoare triple {162631#(= (_ bv0 32) main_~p8~0)} assume !(~p13~0 != 0bv32); {162631#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 18:07:13,887 INFO L273 TraceCheckUtils]: 21: Hoare triple {162631#(= (_ bv0 32) main_~p8~0)} assume !(~p1~0 != 0bv32); {162631#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 18:07:13,887 INFO L273 TraceCheckUtils]: 22: Hoare triple {162631#(= (_ bv0 32) main_~p8~0)} assume !(~p2~0 != 0bv32); {162631#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 18:07:13,889 INFO L273 TraceCheckUtils]: 23: Hoare triple {162631#(= (_ bv0 32) main_~p8~0)} assume !(~p3~0 != 0bv32); {162631#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 18:07:13,889 INFO L273 TraceCheckUtils]: 24: Hoare triple {162631#(= (_ bv0 32) main_~p8~0)} assume !(~p4~0 != 0bv32); {162631#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 18:07:13,891 INFO L273 TraceCheckUtils]: 25: Hoare triple {162631#(= (_ bv0 32) main_~p8~0)} assume !(~p5~0 != 0bv32); {162631#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 18:07:13,891 INFO L273 TraceCheckUtils]: 26: Hoare triple {162631#(= (_ bv0 32) main_~p8~0)} assume !(~p6~0 != 0bv32); {162631#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 18:07:13,893 INFO L273 TraceCheckUtils]: 27: Hoare triple {162631#(= (_ bv0 32) main_~p8~0)} assume !(~p7~0 != 0bv32); {162631#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 18:07:13,893 INFO L273 TraceCheckUtils]: 28: Hoare triple {162631#(= (_ bv0 32) main_~p8~0)} assume ~p8~0 != 0bv32; {162582#false} is VALID [2018-11-14 18:07:13,893 INFO L273 TraceCheckUtils]: 29: Hoare triple {162582#false} assume ~lk8~0 != 1bv32; {162582#false} is VALID [2018-11-14 18:07:13,893 INFO L273 TraceCheckUtils]: 30: Hoare triple {162582#false} assume !false; {162582#false} is VALID [2018-11-14 18:07:13,894 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-14 18:07:13,894 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:07:13,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:07:13,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:07:13,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-14 18:07:13,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:07:13,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:07:13,941 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:07:13,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:07:13,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:07:13,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:07:13,942 INFO L87 Difference]: Start difference. First operand 7305 states and 10695 transitions. Second operand 3 states.