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_12_true-unreach-call_true-valid-memsafety_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:05:36,049 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:05:36,052 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:05:36,065 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:05:36,065 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:05:36,067 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:05:36,068 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:05:36,071 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:05:36,073 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:05:36,076 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:05:36,078 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:05:36,078 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:05:36,079 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:05:36,080 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:05:36,081 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:05:36,082 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:05:36,083 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:05:36,085 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:05:36,087 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:05:36,089 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:05:36,090 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:05:36,091 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:05:36,093 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:05:36,094 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:05:36,094 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:05:36,095 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:05:36,096 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:05:36,097 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:05:36,098 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:05:36,099 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:05:36,099 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:05:36,100 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:05:36,100 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:05:36,100 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:05:36,102 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:05:36,103 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:05:36,103 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:36,127 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:05:36,127 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:05:36,128 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:05:36,128 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:05:36,129 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:05:36,129 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:05:36,129 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:05:36,129 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:05:36,129 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:05:36,130 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:05:36,130 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:05:36,130 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:05:36,130 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:05:36,130 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:05:36,130 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:05:36,131 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:05:36,131 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:05:36,131 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:05:36,131 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:05:36,131 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:05:36,132 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:05:36,132 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:05:36,132 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:05:36,132 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:05:36,132 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:05:36,133 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:05:36,133 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:05:36,133 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:05:36,133 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:05:36,133 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:05:36,134 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:05:36,134 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:05:36,134 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:05:36,181 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:05:36,198 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:05:36,203 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:05:36,204 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:05:36,204 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:05:36,205 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-14 18:05:36,266 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/649fd456a/cef7422021ee46d7894687e1c43e45a6/FLAG9b9645957 [2018-11-14 18:05:36,745 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:05:36,746 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-14 18:05:36,753 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/649fd456a/cef7422021ee46d7894687e1c43e45a6/FLAG9b9645957 [2018-11-14 18:05:36,766 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/649fd456a/cef7422021ee46d7894687e1c43e45a6 [2018-11-14 18:05:36,775 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:05:36,777 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:05:36,778 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:05:36,778 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:05:36,782 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:05:36,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:05:36" (1/1) ... [2018-11-14 18:05:36,792 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9ab44d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:05:36, skipping insertion in model container [2018-11-14 18:05:36,793 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:05:36" (1/1) ... [2018-11-14 18:05:36,803 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:05:36,829 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:05:37,083 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:05:37,094 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:05:37,132 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:05:37,148 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:05:37,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:05:37 WrapperNode [2018-11-14 18:05:37,149 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:05:37,150 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:05:37,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:05:37,151 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:05:37,169 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:37" (1/1) ... [2018-11-14 18:05:37,170 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:37" (1/1) ... [2018-11-14 18:05:37,180 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:37" (1/1) ... [2018-11-14 18:05:37,180 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:37" (1/1) ... [2018-11-14 18:05:37,192 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:37" (1/1) ... [2018-11-14 18:05:37,203 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:37" (1/1) ... [2018-11-14 18:05:37,205 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:37" (1/1) ... [2018-11-14 18:05:37,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:05:37,209 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:05:37,209 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:05:37,210 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:05:37,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:05:37" (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:37,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:05:37,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:05:37,341 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:05:37,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:05:37,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:05:37,342 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:05:37,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:05:37,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:05:38,373 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:05:38,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:05:38 BoogieIcfgContainer [2018-11-14 18:05:38,376 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:05:38,377 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:05:38,377 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:05:38,381 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:05:38,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:05:36" (1/3) ... [2018-11-14 18:05:38,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b0538d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:05:38, skipping insertion in model container [2018-11-14 18:05:38,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:05:37" (2/3) ... [2018-11-14 18:05:38,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b0538d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:05:38, skipping insertion in model container [2018-11-14 18:05:38,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:05:38" (3/3) ... [2018-11-14 18:05:38,386 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-14 18:05:38,394 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:05:38,401 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:05:38,415 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:05:38,444 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:05:38,445 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:05:38,445 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:05:38,446 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:05:38,446 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:05:38,447 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:05:38,447 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:05:38,447 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:05:38,448 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:05:38,468 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-11-14 18:05:38,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 18:05:38,475 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:05:38,476 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] [2018-11-14 18:05:38,478 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:05:38,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:05:38,484 INFO L82 PathProgramCache]: Analyzing trace with hash 322166107, now seen corresponding path program 1 times [2018-11-14 18:05:38,489 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:05:38,489 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:38,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:05:38,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:38,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:05:38,753 INFO L256 TraceCheckUtils]: 0: Hoare triple {54#true} call ULTIMATE.init(); {54#true} is VALID [2018-11-14 18:05:38,757 INFO L273 TraceCheckUtils]: 1: Hoare triple {54#true} assume true; {54#true} is VALID [2018-11-14 18:05:38,758 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {54#true} {54#true} #232#return; {54#true} is VALID [2018-11-14 18:05:38,759 INFO L256 TraceCheckUtils]: 3: Hoare triple {54#true} call #t~ret13 := main(); {54#true} is VALID [2018-11-14 18:05:38,759 INFO L273 TraceCheckUtils]: 4: Hoare triple {54#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;havoc ~cond~0; {54#true} is VALID [2018-11-14 18:05:38,760 INFO L273 TraceCheckUtils]: 5: Hoare triple {54#true} assume true; {54#true} is VALID [2018-11-14 18:05:38,760 INFO L273 TraceCheckUtils]: 6: Hoare triple {54#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {54#true} is VALID [2018-11-14 18:05:38,760 INFO L273 TraceCheckUtils]: 7: Hoare triple {54#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; {54#true} is VALID [2018-11-14 18:05:38,774 INFO L273 TraceCheckUtils]: 8: Hoare triple {54#true} assume ~p1~0 != 0bv32;~lk1~0 := 1bv32; {83#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:38,786 INFO L273 TraceCheckUtils]: 9: Hoare triple {83#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p2~0 != 0bv32;~lk2~0 := 1bv32; {83#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:38,800 INFO L273 TraceCheckUtils]: 10: Hoare triple {83#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {83#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:38,809 INFO L273 TraceCheckUtils]: 11: Hoare triple {83#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {83#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:38,824 INFO L273 TraceCheckUtils]: 12: Hoare triple {83#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {83#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:38,833 INFO L273 TraceCheckUtils]: 13: Hoare triple {83#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {83#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:38,846 INFO L273 TraceCheckUtils]: 14: Hoare triple {83#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {83#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:38,859 INFO L273 TraceCheckUtils]: 15: Hoare triple {83#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {83#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:38,872 INFO L273 TraceCheckUtils]: 16: Hoare triple {83#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {83#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:38,886 INFO L273 TraceCheckUtils]: 17: Hoare triple {83#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {83#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:38,895 INFO L273 TraceCheckUtils]: 18: Hoare triple {83#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {83#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:38,908 INFO L273 TraceCheckUtils]: 19: Hoare triple {83#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {83#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:38,921 INFO L273 TraceCheckUtils]: 20: Hoare triple {83#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p1~0 != 0bv32; {83#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:38,934 INFO L273 TraceCheckUtils]: 21: Hoare triple {83#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk1~0 != 1bv32; {55#false} is VALID [2018-11-14 18:05:38,934 INFO L273 TraceCheckUtils]: 22: Hoare triple {55#false} assume !false; {55#false} is VALID [2018-11-14 18:05:38,942 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:38,943 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:05:38,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:05:38,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:05:38,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-14 18:05:38,969 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:05:38,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:05:39,091 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:39,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:05:39,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:05:39,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:05:39,101 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 3 states. [2018-11-14 18:05:40,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:40,099 INFO L93 Difference]: Finished difference Result 101 states and 176 transitions. [2018-11-14 18:05:40,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:05:40,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-14 18:05:40,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:05:40,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:40,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2018-11-14 18:05:40,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:40,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2018-11-14 18:05:40,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 176 transitions. [2018-11-14 18:05:40,637 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:40,654 INFO L225 Difference]: With dead ends: 101 [2018-11-14 18:05:40,654 INFO L226 Difference]: Without dead ends: 86 [2018-11-14 18:05:40,658 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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:40,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-14 18:05:40,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 59. [2018-11-14 18:05:40,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:05:40,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 59 states. [2018-11-14 18:05:40,710 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 59 states. [2018-11-14 18:05:40,710 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 59 states. [2018-11-14 18:05:40,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:40,721 INFO L93 Difference]: Finished difference Result 86 states and 154 transitions. [2018-11-14 18:05:40,721 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 154 transitions. [2018-11-14 18:05:40,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:40,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:40,723 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 86 states. [2018-11-14 18:05:40,723 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 86 states. [2018-11-14 18:05:40,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:40,732 INFO L93 Difference]: Finished difference Result 86 states and 154 transitions. [2018-11-14 18:05:40,732 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 154 transitions. [2018-11-14 18:05:40,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:40,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:40,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:05:40,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:05:40,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-14 18:05:40,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 106 transitions. [2018-11-14 18:05:40,741 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 106 transitions. Word has length 23 [2018-11-14 18:05:40,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:05:40,742 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 106 transitions. [2018-11-14 18:05:40,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:05:40,742 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 106 transitions. [2018-11-14 18:05:40,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 18:05:40,744 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:05:40,744 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] [2018-11-14 18:05:40,744 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:05:40,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:05:40,745 INFO L82 PathProgramCache]: Analyzing trace with hash -957697571, now seen corresponding path program 1 times [2018-11-14 18:05:40,745 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:05:40,745 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:40,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:05:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:40,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:05:40,910 INFO L256 TraceCheckUtils]: 0: Hoare triple {475#true} call ULTIMATE.init(); {475#true} is VALID [2018-11-14 18:05:40,911 INFO L273 TraceCheckUtils]: 1: Hoare triple {475#true} assume true; {475#true} is VALID [2018-11-14 18:05:40,911 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {475#true} {475#true} #232#return; {475#true} is VALID [2018-11-14 18:05:40,911 INFO L256 TraceCheckUtils]: 3: Hoare triple {475#true} call #t~ret13 := main(); {475#true} is VALID [2018-11-14 18:05:40,912 INFO L273 TraceCheckUtils]: 4: Hoare triple {475#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;havoc ~cond~0; {475#true} is VALID [2018-11-14 18:05:40,912 INFO L273 TraceCheckUtils]: 5: Hoare triple {475#true} assume true; {475#true} is VALID [2018-11-14 18:05:40,912 INFO L273 TraceCheckUtils]: 6: Hoare triple {475#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {475#true} is VALID [2018-11-14 18:05:40,913 INFO L273 TraceCheckUtils]: 7: Hoare triple {475#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; {475#true} is VALID [2018-11-14 18:05:40,915 INFO L273 TraceCheckUtils]: 8: Hoare triple {475#true} assume !(~p1~0 != 0bv32); {504#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:05:40,915 INFO L273 TraceCheckUtils]: 9: Hoare triple {504#(= (_ bv0 32) main_~p1~0)} assume ~p2~0 != 0bv32;~lk2~0 := 1bv32; {504#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:05:40,920 INFO L273 TraceCheckUtils]: 10: Hoare triple {504#(= (_ bv0 32) main_~p1~0)} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {504#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:05:40,920 INFO L273 TraceCheckUtils]: 11: Hoare triple {504#(= (_ bv0 32) main_~p1~0)} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {504#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:05:40,922 INFO L273 TraceCheckUtils]: 12: Hoare triple {504#(= (_ bv0 32) main_~p1~0)} assume !(~p5~0 != 0bv32); {504#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:05:40,927 INFO L273 TraceCheckUtils]: 13: Hoare triple {504#(= (_ bv0 32) main_~p1~0)} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {504#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:05:40,927 INFO L273 TraceCheckUtils]: 14: Hoare triple {504#(= (_ bv0 32) main_~p1~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {504#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:05:40,928 INFO L273 TraceCheckUtils]: 15: Hoare triple {504#(= (_ bv0 32) main_~p1~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {504#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:05:40,935 INFO L273 TraceCheckUtils]: 16: Hoare triple {504#(= (_ bv0 32) main_~p1~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {504#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:05:40,936 INFO L273 TraceCheckUtils]: 17: Hoare triple {504#(= (_ bv0 32) main_~p1~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {504#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:05:40,937 INFO L273 TraceCheckUtils]: 18: Hoare triple {504#(= (_ bv0 32) main_~p1~0)} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {504#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:05:40,938 INFO L273 TraceCheckUtils]: 19: Hoare triple {504#(= (_ bv0 32) main_~p1~0)} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {504#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:05:40,938 INFO L273 TraceCheckUtils]: 20: Hoare triple {504#(= (_ bv0 32) main_~p1~0)} assume ~p1~0 != 0bv32; {476#false} is VALID [2018-11-14 18:05:40,939 INFO L273 TraceCheckUtils]: 21: Hoare triple {476#false} assume ~lk1~0 != 1bv32; {476#false} is VALID [2018-11-14 18:05:40,939 INFO L273 TraceCheckUtils]: 22: Hoare triple {476#false} assume !false; {476#false} is VALID [2018-11-14 18:05:40,942 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:40,942 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:05:40,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:05:40,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:05:40,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-14 18:05:40,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:05:40,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:05:41,015 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:41,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:05:41,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:05:41,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:05:41,016 INFO L87 Difference]: Start difference. First operand 59 states and 106 transitions. Second operand 3 states. [2018-11-14 18:05:41,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:41,395 INFO L93 Difference]: Finished difference Result 140 states and 255 transitions. [2018-11-14 18:05:41,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:05:41,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-14 18:05:41,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:05:41,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:41,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2018-11-14 18:05:41,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:41,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2018-11-14 18:05:41,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 230 transitions. [2018-11-14 18:05:41,862 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:05:41,867 INFO L225 Difference]: With dead ends: 140 [2018-11-14 18:05:41,868 INFO L226 Difference]: Without dead ends: 86 [2018-11-14 18:05:41,869 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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:41,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-14 18:05:41,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-11-14 18:05:41,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:05:41,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 84 states. [2018-11-14 18:05:41,923 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 84 states. [2018-11-14 18:05:41,923 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 84 states. [2018-11-14 18:05:41,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:41,928 INFO L93 Difference]: Finished difference Result 86 states and 152 transitions. [2018-11-14 18:05:41,929 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 152 transitions. [2018-11-14 18:05:41,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:41,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:41,930 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 86 states. [2018-11-14 18:05:41,930 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 86 states. [2018-11-14 18:05:41,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:41,936 INFO L93 Difference]: Finished difference Result 86 states and 152 transitions. [2018-11-14 18:05:41,937 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 152 transitions. [2018-11-14 18:05:41,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:41,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:41,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:05:41,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:05:41,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-14 18:05:41,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 151 transitions. [2018-11-14 18:05:41,943 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 151 transitions. Word has length 23 [2018-11-14 18:05:41,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:05:41,945 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 151 transitions. [2018-11-14 18:05:41,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:05:41,945 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 151 transitions. [2018-11-14 18:05:41,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 18:05:41,946 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:05:41,946 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:41,947 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:05:41,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:05:41,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1397427458, now seen corresponding path program 1 times [2018-11-14 18:05:41,948 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:05:41,948 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:41,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:05:42,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:42,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:42,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:05:42,130 INFO L256 TraceCheckUtils]: 0: Hoare triple {959#true} call ULTIMATE.init(); {959#true} is VALID [2018-11-14 18:05:42,131 INFO L273 TraceCheckUtils]: 1: Hoare triple {959#true} assume true; {959#true} is VALID [2018-11-14 18:05:42,131 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {959#true} {959#true} #232#return; {959#true} is VALID [2018-11-14 18:05:42,131 INFO L256 TraceCheckUtils]: 3: Hoare triple {959#true} call #t~ret13 := main(); {959#true} is VALID [2018-11-14 18:05:42,131 INFO L273 TraceCheckUtils]: 4: Hoare triple {959#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;havoc ~cond~0; {959#true} is VALID [2018-11-14 18:05:42,132 INFO L273 TraceCheckUtils]: 5: Hoare triple {959#true} assume true; {959#true} is VALID [2018-11-14 18:05:42,132 INFO L273 TraceCheckUtils]: 6: Hoare triple {959#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {959#true} is VALID [2018-11-14 18:05:42,132 INFO L273 TraceCheckUtils]: 7: Hoare triple {959#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; {959#true} is VALID [2018-11-14 18:05:42,136 INFO L273 TraceCheckUtils]: 8: Hoare triple {959#true} assume ~p1~0 != 0bv32;~lk1~0 := 1bv32; {988#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:05:42,137 INFO L273 TraceCheckUtils]: 9: Hoare triple {988#(not (= (_ bv0 32) main_~p1~0))} assume ~p2~0 != 0bv32;~lk2~0 := 1bv32; {988#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:05:42,138 INFO L273 TraceCheckUtils]: 10: Hoare triple {988#(not (= (_ bv0 32) main_~p1~0))} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {988#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:05:42,138 INFO L273 TraceCheckUtils]: 11: Hoare triple {988#(not (= (_ bv0 32) main_~p1~0))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {988#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:05:42,141 INFO L273 TraceCheckUtils]: 12: Hoare triple {988#(not (= (_ bv0 32) main_~p1~0))} assume !(~p5~0 != 0bv32); {988#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:05:42,141 INFO L273 TraceCheckUtils]: 13: Hoare triple {988#(not (= (_ bv0 32) main_~p1~0))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {988#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:05:42,142 INFO L273 TraceCheckUtils]: 14: Hoare triple {988#(not (= (_ bv0 32) main_~p1~0))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {988#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:05:42,143 INFO L273 TraceCheckUtils]: 15: Hoare triple {988#(not (= (_ bv0 32) main_~p1~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {988#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:05:42,145 INFO L273 TraceCheckUtils]: 16: Hoare triple {988#(not (= (_ bv0 32) main_~p1~0))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {988#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:05:42,154 INFO L273 TraceCheckUtils]: 17: Hoare triple {988#(not (= (_ bv0 32) main_~p1~0))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {988#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:05:42,155 INFO L273 TraceCheckUtils]: 18: Hoare triple {988#(not (= (_ bv0 32) main_~p1~0))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {988#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:05:42,155 INFO L273 TraceCheckUtils]: 19: Hoare triple {988#(not (= (_ bv0 32) main_~p1~0))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {988#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:05:42,156 INFO L273 TraceCheckUtils]: 20: Hoare triple {988#(not (= (_ bv0 32) main_~p1~0))} assume !(~p1~0 != 0bv32); {960#false} is VALID [2018-11-14 18:05:42,156 INFO L273 TraceCheckUtils]: 21: Hoare triple {960#false} assume ~p2~0 != 0bv32; {960#false} is VALID [2018-11-14 18:05:42,156 INFO L273 TraceCheckUtils]: 22: Hoare triple {960#false} assume ~lk2~0 != 1bv32; {960#false} is VALID [2018-11-14 18:05:42,157 INFO L273 TraceCheckUtils]: 23: Hoare triple {960#false} assume !false; {960#false} is VALID [2018-11-14 18:05:42,158 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:42,159 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:05:42,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:05:42,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:05:42,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-14 18:05:42,161 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:05:42,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:05:42,190 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:42,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:05:42,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:05:42,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:05:42,191 INFO L87 Difference]: Start difference. First operand 84 states and 151 transitions. Second operand 3 states. [2018-11-14 18:05:42,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:42,511 INFO L93 Difference]: Finished difference Result 130 states and 229 transitions. [2018-11-14 18:05:42,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:05:42,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-14 18:05:42,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:05:42,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:42,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2018-11-14 18:05:42,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:42,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2018-11-14 18:05:42,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 225 transitions. [2018-11-14 18:05:42,823 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:05:42,826 INFO L225 Difference]: With dead ends: 130 [2018-11-14 18:05:42,826 INFO L226 Difference]: Without dead ends: 90 [2018-11-14 18:05:42,827 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:42,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-14 18:05:42,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-11-14 18:05:42,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:05:42,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 88 states. [2018-11-14 18:05:42,859 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 88 states. [2018-11-14 18:05:42,859 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 88 states. [2018-11-14 18:05:42,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:42,871 INFO L93 Difference]: Finished difference Result 90 states and 155 transitions. [2018-11-14 18:05:42,871 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 155 transitions. [2018-11-14 18:05:42,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:42,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:42,872 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 90 states. [2018-11-14 18:05:42,873 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 90 states. [2018-11-14 18:05:42,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:42,877 INFO L93 Difference]: Finished difference Result 90 states and 155 transitions. [2018-11-14 18:05:42,878 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 155 transitions. [2018-11-14 18:05:42,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:42,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:42,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:05:42,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:05:42,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-14 18:05:42,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 154 transitions. [2018-11-14 18:05:42,884 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 154 transitions. Word has length 24 [2018-11-14 18:05:42,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:05:42,885 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 154 transitions. [2018-11-14 18:05:42,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:05:42,885 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 154 transitions. [2018-11-14 18:05:42,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 18:05:42,886 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:05:42,886 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:42,886 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:05:42,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:05:42,887 INFO L82 PathProgramCache]: Analyzing trace with hash 376359104, now seen corresponding path program 1 times [2018-11-14 18:05:42,887 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:05:42,888 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:42,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:05:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:42,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:42,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:05:43,065 INFO L256 TraceCheckUtils]: 0: Hoare triple {1450#true} call ULTIMATE.init(); {1450#true} is VALID [2018-11-14 18:05:43,066 INFO L273 TraceCheckUtils]: 1: Hoare triple {1450#true} assume true; {1450#true} is VALID [2018-11-14 18:05:43,066 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1450#true} {1450#true} #232#return; {1450#true} is VALID [2018-11-14 18:05:43,067 INFO L256 TraceCheckUtils]: 3: Hoare triple {1450#true} call #t~ret13 := main(); {1450#true} is VALID [2018-11-14 18:05:43,067 INFO L273 TraceCheckUtils]: 4: Hoare triple {1450#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;havoc ~cond~0; {1450#true} is VALID [2018-11-14 18:05:43,067 INFO L273 TraceCheckUtils]: 5: Hoare triple {1450#true} assume true; {1450#true} is VALID [2018-11-14 18:05:43,068 INFO L273 TraceCheckUtils]: 6: Hoare triple {1450#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {1450#true} is VALID [2018-11-14 18:05:43,068 INFO L273 TraceCheckUtils]: 7: Hoare triple {1450#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; {1450#true} is VALID [2018-11-14 18:05:43,068 INFO L273 TraceCheckUtils]: 8: Hoare triple {1450#true} assume !(~p1~0 != 0bv32); {1450#true} is VALID [2018-11-14 18:05:43,070 INFO L273 TraceCheckUtils]: 9: Hoare triple {1450#true} assume ~p2~0 != 0bv32;~lk2~0 := 1bv32; {1482#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:43,070 INFO L273 TraceCheckUtils]: 10: Hoare triple {1482#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {1482#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:43,071 INFO L273 TraceCheckUtils]: 11: Hoare triple {1482#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {1482#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:43,071 INFO L273 TraceCheckUtils]: 12: Hoare triple {1482#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {1482#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:43,072 INFO L273 TraceCheckUtils]: 13: Hoare triple {1482#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {1482#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:43,072 INFO L273 TraceCheckUtils]: 14: Hoare triple {1482#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {1482#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:43,073 INFO L273 TraceCheckUtils]: 15: Hoare triple {1482#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {1482#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:43,073 INFO L273 TraceCheckUtils]: 16: Hoare triple {1482#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {1482#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:43,075 INFO L273 TraceCheckUtils]: 17: Hoare triple {1482#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {1482#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:43,075 INFO L273 TraceCheckUtils]: 18: Hoare triple {1482#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {1482#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:43,077 INFO L273 TraceCheckUtils]: 19: Hoare triple {1482#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {1482#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:43,077 INFO L273 TraceCheckUtils]: 20: Hoare triple {1482#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {1482#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:43,078 INFO L273 TraceCheckUtils]: 21: Hoare triple {1482#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p2~0 != 0bv32; {1482#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:43,079 INFO L273 TraceCheckUtils]: 22: Hoare triple {1482#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk2~0 != 1bv32; {1451#false} is VALID [2018-11-14 18:05:43,079 INFO L273 TraceCheckUtils]: 23: Hoare triple {1451#false} assume !false; {1451#false} is VALID [2018-11-14 18:05:43,082 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:43,082 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:05:43,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:05:43,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:05:43,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-14 18:05:43,086 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:05:43,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:05:43,113 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:43,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:05:43,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:05:43,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:05:43,114 INFO L87 Difference]: Start difference. First operand 88 states and 154 transitions. Second operand 3 states. [2018-11-14 18:05:43,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:43,359 INFO L93 Difference]: Finished difference Result 165 states and 293 transitions. [2018-11-14 18:05:43,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:05:43,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-14 18:05:43,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:05:43,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:43,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2018-11-14 18:05:43,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:43,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2018-11-14 18:05:43,365 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 152 transitions. [2018-11-14 18:05:43,553 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:43,558 INFO L225 Difference]: With dead ends: 165 [2018-11-14 18:05:43,558 INFO L226 Difference]: Without dead ends: 163 [2018-11-14 18:05:43,559 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:43,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-11-14 18:05:43,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 115. [2018-11-14 18:05:43,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:05:43,593 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand 115 states. [2018-11-14 18:05:43,594 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand 115 states. [2018-11-14 18:05:43,594 INFO L87 Difference]: Start difference. First operand 163 states. Second operand 115 states. [2018-11-14 18:05:43,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:43,601 INFO L93 Difference]: Finished difference Result 163 states and 290 transitions. [2018-11-14 18:05:43,601 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 290 transitions. [2018-11-14 18:05:43,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:43,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:43,602 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 163 states. [2018-11-14 18:05:43,603 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 163 states. [2018-11-14 18:05:43,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:43,610 INFO L93 Difference]: Finished difference Result 163 states and 290 transitions. [2018-11-14 18:05:43,610 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 290 transitions. [2018-11-14 18:05:43,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:43,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:43,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:05:43,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:05:43,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-14 18:05:43,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 203 transitions. [2018-11-14 18:05:43,617 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 203 transitions. Word has length 24 [2018-11-14 18:05:43,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:05:43,617 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 203 transitions. [2018-11-14 18:05:43,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:05:43,617 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 203 transitions. [2018-11-14 18:05:43,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 18:05:43,618 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:05:43,618 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:43,619 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:05:43,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:05:43,619 INFO L82 PathProgramCache]: Analyzing trace with hash -903504574, now seen corresponding path program 1 times [2018-11-14 18:05:43,619 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:05:43,620 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:05:43,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:05:43,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:43,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:43,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:05:43,746 INFO L256 TraceCheckUtils]: 0: Hoare triple {2150#true} call ULTIMATE.init(); {2150#true} is VALID [2018-11-14 18:05:43,747 INFO L273 TraceCheckUtils]: 1: Hoare triple {2150#true} assume true; {2150#true} is VALID [2018-11-14 18:05:43,747 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2150#true} {2150#true} #232#return; {2150#true} is VALID [2018-11-14 18:05:43,747 INFO L256 TraceCheckUtils]: 3: Hoare triple {2150#true} call #t~ret13 := main(); {2150#true} is VALID [2018-11-14 18:05:43,748 INFO L273 TraceCheckUtils]: 4: Hoare triple {2150#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;havoc ~cond~0; {2150#true} is VALID [2018-11-14 18:05:43,748 INFO L273 TraceCheckUtils]: 5: Hoare triple {2150#true} assume true; {2150#true} is VALID [2018-11-14 18:05:43,748 INFO L273 TraceCheckUtils]: 6: Hoare triple {2150#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {2150#true} is VALID [2018-11-14 18:05:43,749 INFO L273 TraceCheckUtils]: 7: Hoare triple {2150#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; {2150#true} is VALID [2018-11-14 18:05:43,749 INFO L273 TraceCheckUtils]: 8: Hoare triple {2150#true} assume !(~p1~0 != 0bv32); {2150#true} is VALID [2018-11-14 18:05:43,750 INFO L273 TraceCheckUtils]: 9: Hoare triple {2150#true} assume !(~p2~0 != 0bv32); {2182#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:05:43,752 INFO L273 TraceCheckUtils]: 10: Hoare triple {2182#(= (_ bv0 32) main_~p2~0)} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {2182#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:05:43,752 INFO L273 TraceCheckUtils]: 11: Hoare triple {2182#(= (_ bv0 32) main_~p2~0)} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {2182#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:05:43,757 INFO L273 TraceCheckUtils]: 12: Hoare triple {2182#(= (_ bv0 32) main_~p2~0)} assume !(~p5~0 != 0bv32); {2182#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:05:43,758 INFO L273 TraceCheckUtils]: 13: Hoare triple {2182#(= (_ bv0 32) main_~p2~0)} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {2182#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:05:43,759 INFO L273 TraceCheckUtils]: 14: Hoare triple {2182#(= (_ bv0 32) main_~p2~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {2182#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:05:43,762 INFO L273 TraceCheckUtils]: 15: Hoare triple {2182#(= (_ bv0 32) main_~p2~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {2182#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:05:43,762 INFO L273 TraceCheckUtils]: 16: Hoare triple {2182#(= (_ bv0 32) main_~p2~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {2182#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:05:43,764 INFO L273 TraceCheckUtils]: 17: Hoare triple {2182#(= (_ bv0 32) main_~p2~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {2182#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:05:43,764 INFO L273 TraceCheckUtils]: 18: Hoare triple {2182#(= (_ bv0 32) main_~p2~0)} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {2182#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:05:43,766 INFO L273 TraceCheckUtils]: 19: Hoare triple {2182#(= (_ bv0 32) main_~p2~0)} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {2182#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:05:43,766 INFO L273 TraceCheckUtils]: 20: Hoare triple {2182#(= (_ bv0 32) main_~p2~0)} assume !(~p1~0 != 0bv32); {2182#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:05:43,772 INFO L273 TraceCheckUtils]: 21: Hoare triple {2182#(= (_ bv0 32) main_~p2~0)} assume ~p2~0 != 0bv32; {2151#false} is VALID [2018-11-14 18:05:43,772 INFO L273 TraceCheckUtils]: 22: Hoare triple {2151#false} assume ~lk2~0 != 1bv32; {2151#false} is VALID [2018-11-14 18:05:43,772 INFO L273 TraceCheckUtils]: 23: Hoare triple {2151#false} assume !false; {2151#false} is VALID [2018-11-14 18:05:43,773 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:43,773 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:05:43,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:05:43,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:05:43,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-14 18:05:43,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:05:43,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:05:43,813 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:43,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:05:43,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:05:43,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:05:43,814 INFO L87 Difference]: Start difference. First operand 115 states and 203 transitions. Second operand 3 states. [2018-11-14 18:05:44,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:44,041 INFO L93 Difference]: Finished difference Result 271 states and 485 transitions. [2018-11-14 18:05:44,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:05:44,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-14 18:05:44,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:05:44,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:44,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2018-11-14 18:05:44,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:44,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2018-11-14 18:05:44,049 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 227 transitions. [2018-11-14 18:05:44,537 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:44,541 INFO L225 Difference]: With dead ends: 271 [2018-11-14 18:05:44,541 INFO L226 Difference]: Without dead ends: 165 [2018-11-14 18:05:44,542 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:44,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-14 18:05:44,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2018-11-14 18:05:44,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:05:44,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand 163 states. [2018-11-14 18:05:44,611 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 163 states. [2018-11-14 18:05:44,611 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 163 states. [2018-11-14 18:05:44,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:44,619 INFO L93 Difference]: Finished difference Result 165 states and 288 transitions. [2018-11-14 18:05:44,619 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 288 transitions. [2018-11-14 18:05:44,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:44,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:44,620 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand 165 states. [2018-11-14 18:05:44,620 INFO L87 Difference]: Start difference. First operand 163 states. Second operand 165 states. [2018-11-14 18:05:44,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:44,627 INFO L93 Difference]: Finished difference Result 165 states and 288 transitions. [2018-11-14 18:05:44,627 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 288 transitions. [2018-11-14 18:05:44,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:44,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:44,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:05:44,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:05:44,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-14 18:05:44,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 287 transitions. [2018-11-14 18:05:44,635 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 287 transitions. Word has length 24 [2018-11-14 18:05:44,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:05:44,635 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 287 transitions. [2018-11-14 18:05:44,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:05:44,635 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 287 transitions. [2018-11-14 18:05:44,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 18:05:44,636 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:05:44,636 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:44,636 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:05:44,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:05:44,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1217556590, now seen corresponding path program 1 times [2018-11-14 18:05:44,637 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:05:44,637 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:05:44,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:05:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:44,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:44,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:05:44,750 INFO L256 TraceCheckUtils]: 0: Hoare triple {3012#true} call ULTIMATE.init(); {3012#true} is VALID [2018-11-14 18:05:44,750 INFO L273 TraceCheckUtils]: 1: Hoare triple {3012#true} assume true; {3012#true} is VALID [2018-11-14 18:05:44,751 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3012#true} {3012#true} #232#return; {3012#true} is VALID [2018-11-14 18:05:44,751 INFO L256 TraceCheckUtils]: 3: Hoare triple {3012#true} call #t~ret13 := main(); {3012#true} is VALID [2018-11-14 18:05:44,751 INFO L273 TraceCheckUtils]: 4: Hoare triple {3012#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;havoc ~cond~0; {3012#true} is VALID [2018-11-14 18:05:44,751 INFO L273 TraceCheckUtils]: 5: Hoare triple {3012#true} assume true; {3012#true} is VALID [2018-11-14 18:05:44,752 INFO L273 TraceCheckUtils]: 6: Hoare triple {3012#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {3012#true} is VALID [2018-11-14 18:05:44,752 INFO L273 TraceCheckUtils]: 7: Hoare triple {3012#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; {3012#true} is VALID [2018-11-14 18:05:44,753 INFO L273 TraceCheckUtils]: 8: Hoare triple {3012#true} assume !(~p1~0 != 0bv32); {3012#true} is VALID [2018-11-14 18:05:44,767 INFO L273 TraceCheckUtils]: 9: Hoare triple {3012#true} assume ~p2~0 != 0bv32;~lk2~0 := 1bv32; {3044#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:05:44,772 INFO L273 TraceCheckUtils]: 10: Hoare triple {3044#(not (= (_ bv0 32) main_~p2~0))} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {3044#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:05:44,772 INFO L273 TraceCheckUtils]: 11: Hoare triple {3044#(not (= (_ bv0 32) main_~p2~0))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {3044#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:05:44,774 INFO L273 TraceCheckUtils]: 12: Hoare triple {3044#(not (= (_ bv0 32) main_~p2~0))} assume !(~p5~0 != 0bv32); {3044#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:05:44,774 INFO L273 TraceCheckUtils]: 13: Hoare triple {3044#(not (= (_ bv0 32) main_~p2~0))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {3044#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:05:44,776 INFO L273 TraceCheckUtils]: 14: Hoare triple {3044#(not (= (_ bv0 32) main_~p2~0))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {3044#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:05:44,776 INFO L273 TraceCheckUtils]: 15: Hoare triple {3044#(not (= (_ bv0 32) main_~p2~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {3044#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:05:44,779 INFO L273 TraceCheckUtils]: 16: Hoare triple {3044#(not (= (_ bv0 32) main_~p2~0))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {3044#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:05:44,779 INFO L273 TraceCheckUtils]: 17: Hoare triple {3044#(not (= (_ bv0 32) main_~p2~0))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {3044#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:05:44,781 INFO L273 TraceCheckUtils]: 18: Hoare triple {3044#(not (= (_ bv0 32) main_~p2~0))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {3044#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:05:44,781 INFO L273 TraceCheckUtils]: 19: Hoare triple {3044#(not (= (_ bv0 32) main_~p2~0))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {3044#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:05:44,783 INFO L273 TraceCheckUtils]: 20: Hoare triple {3044#(not (= (_ bv0 32) main_~p2~0))} assume !(~p1~0 != 0bv32); {3044#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:05:44,783 INFO L273 TraceCheckUtils]: 21: Hoare triple {3044#(not (= (_ bv0 32) main_~p2~0))} assume !(~p2~0 != 0bv32); {3013#false} is VALID [2018-11-14 18:05:44,783 INFO L273 TraceCheckUtils]: 22: Hoare triple {3013#false} assume ~p3~0 != 0bv32; {3013#false} is VALID [2018-11-14 18:05:44,784 INFO L273 TraceCheckUtils]: 23: Hoare triple {3013#false} assume ~lk3~0 != 1bv32; {3013#false} is VALID [2018-11-14 18:05:44,784 INFO L273 TraceCheckUtils]: 24: Hoare triple {3013#false} assume !false; {3013#false} is VALID [2018-11-14 18:05:44,785 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:44,786 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:05:44,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:05:44,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:05:44,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 18:05:44,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:05:44,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:05:44,819 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:44,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:05:44,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:05:44,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:05:44,820 INFO L87 Difference]: Start difference. First operand 163 states and 287 transitions. Second operand 3 states. [2018-11-14 18:05:45,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:45,091 INFO L93 Difference]: Finished difference Result 244 states and 428 transitions. [2018-11-14 18:05:45,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:05:45,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 18:05:45,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:05:45,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:45,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 222 transitions. [2018-11-14 18:05:45,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:45,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 222 transitions. [2018-11-14 18:05:45,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 222 transitions. [2018-11-14 18:05:45,943 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:45,946 INFO L225 Difference]: With dead ends: 244 [2018-11-14 18:05:45,947 INFO L226 Difference]: Without dead ends: 167 [2018-11-14 18:05:45,948 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:45,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-14 18:05:46,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-11-14 18:05:46,223 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:05:46,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand 165 states. [2018-11-14 18:05:46,224 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand 165 states. [2018-11-14 18:05:46,224 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 165 states. [2018-11-14 18:05:46,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:46,239 INFO L93 Difference]: Finished difference Result 167 states and 288 transitions. [2018-11-14 18:05:46,239 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 288 transitions. [2018-11-14 18:05:46,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:46,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:46,244 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 167 states. [2018-11-14 18:05:46,244 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 167 states. [2018-11-14 18:05:46,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:46,257 INFO L93 Difference]: Finished difference Result 167 states and 288 transitions. [2018-11-14 18:05:46,257 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 288 transitions. [2018-11-14 18:05:46,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:46,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:46,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:05:46,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:05:46,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-14 18:05:46,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 287 transitions. [2018-11-14 18:05:46,271 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 287 transitions. Word has length 25 [2018-11-14 18:05:46,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:05:46,272 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 287 transitions. [2018-11-14 18:05:46,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:05:46,272 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 287 transitions. [2018-11-14 18:05:46,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 18:05:46,273 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:05:46,273 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:46,273 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:05:46,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:05:46,274 INFO L82 PathProgramCache]: Analyzing trace with hash 2056342352, now seen corresponding path program 1 times [2018-11-14 18:05:46,274 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:05:46,274 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:05:46,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:05:46,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:46,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:05:46,422 INFO L256 TraceCheckUtils]: 0: Hoare triple {3856#true} call ULTIMATE.init(); {3856#true} is VALID [2018-11-14 18:05:46,422 INFO L273 TraceCheckUtils]: 1: Hoare triple {3856#true} assume true; {3856#true} is VALID [2018-11-14 18:05:46,422 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3856#true} {3856#true} #232#return; {3856#true} is VALID [2018-11-14 18:05:46,423 INFO L256 TraceCheckUtils]: 3: Hoare triple {3856#true} call #t~ret13 := main(); {3856#true} is VALID [2018-11-14 18:05:46,423 INFO L273 TraceCheckUtils]: 4: Hoare triple {3856#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;havoc ~cond~0; {3856#true} is VALID [2018-11-14 18:05:46,423 INFO L273 TraceCheckUtils]: 5: Hoare triple {3856#true} assume true; {3856#true} is VALID [2018-11-14 18:05:46,423 INFO L273 TraceCheckUtils]: 6: Hoare triple {3856#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {3856#true} is VALID [2018-11-14 18:05:46,423 INFO L273 TraceCheckUtils]: 7: Hoare triple {3856#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; {3856#true} is VALID [2018-11-14 18:05:46,424 INFO L273 TraceCheckUtils]: 8: Hoare triple {3856#true} assume !(~p1~0 != 0bv32); {3856#true} is VALID [2018-11-14 18:05:46,424 INFO L273 TraceCheckUtils]: 9: Hoare triple {3856#true} assume !(~p2~0 != 0bv32); {3856#true} is VALID [2018-11-14 18:05:46,424 INFO L273 TraceCheckUtils]: 10: Hoare triple {3856#true} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {3891#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:46,426 INFO L273 TraceCheckUtils]: 11: Hoare triple {3891#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {3891#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:46,426 INFO L273 TraceCheckUtils]: 12: Hoare triple {3891#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {3891#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:46,427 INFO L273 TraceCheckUtils]: 13: Hoare triple {3891#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {3891#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:46,427 INFO L273 TraceCheckUtils]: 14: Hoare triple {3891#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {3891#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:46,427 INFO L273 TraceCheckUtils]: 15: Hoare triple {3891#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {3891#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:46,428 INFO L273 TraceCheckUtils]: 16: Hoare triple {3891#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {3891#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:46,428 INFO L273 TraceCheckUtils]: 17: Hoare triple {3891#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {3891#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:46,429 INFO L273 TraceCheckUtils]: 18: Hoare triple {3891#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {3891#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:46,429 INFO L273 TraceCheckUtils]: 19: Hoare triple {3891#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {3891#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:46,430 INFO L273 TraceCheckUtils]: 20: Hoare triple {3891#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {3891#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:46,431 INFO L273 TraceCheckUtils]: 21: Hoare triple {3891#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {3891#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:46,432 INFO L273 TraceCheckUtils]: 22: Hoare triple {3891#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p3~0 != 0bv32; {3891#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:46,441 INFO L273 TraceCheckUtils]: 23: Hoare triple {3891#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk3~0 != 1bv32; {3857#false} is VALID [2018-11-14 18:05:46,441 INFO L273 TraceCheckUtils]: 24: Hoare triple {3857#false} assume !false; {3857#false} is VALID [2018-11-14 18:05:46,443 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:46,443 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:05:46,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:05:46,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:05:46,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 18:05:46,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:05:46,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:05:46,511 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:46,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:05:46,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:05:46,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:05:46,512 INFO L87 Difference]: Start difference. First operand 165 states and 287 transitions. Second operand 3 states. [2018-11-14 18:05:46,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:46,959 INFO L93 Difference]: Finished difference Result 309 states and 545 transitions. [2018-11-14 18:05:46,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:05:46,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 18:05:46,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:05:46,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:46,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2018-11-14 18:05:46,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:46,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2018-11-14 18:05:46,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 148 transitions. [2018-11-14 18:05:47,188 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:05:47,196 INFO L225 Difference]: With dead ends: 309 [2018-11-14 18:05:47,196 INFO L226 Difference]: Without dead ends: 307 [2018-11-14 18:05:47,197 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:47,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-11-14 18:05:47,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 221. [2018-11-14 18:05:47,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:05:47,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 307 states. Second operand 221 states. [2018-11-14 18:05:47,230 INFO L74 IsIncluded]: Start isIncluded. First operand 307 states. Second operand 221 states. [2018-11-14 18:05:47,231 INFO L87 Difference]: Start difference. First operand 307 states. Second operand 221 states. [2018-11-14 18:05:47,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:47,240 INFO L93 Difference]: Finished difference Result 307 states and 540 transitions. [2018-11-14 18:05:47,240 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 540 transitions. [2018-11-14 18:05:47,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:47,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:47,241 INFO L74 IsIncluded]: Start isIncluded. First operand 221 states. Second operand 307 states. [2018-11-14 18:05:47,241 INFO L87 Difference]: Start difference. First operand 221 states. Second operand 307 states. [2018-11-14 18:05:47,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:47,250 INFO L93 Difference]: Finished difference Result 307 states and 540 transitions. [2018-11-14 18:05:47,251 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 540 transitions. [2018-11-14 18:05:47,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:47,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:47,252 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:05:47,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:05:47,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-11-14 18:05:47,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 383 transitions. [2018-11-14 18:05:47,257 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 383 transitions. Word has length 25 [2018-11-14 18:05:47,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:05:47,258 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 383 transitions. [2018-11-14 18:05:47,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:05:47,258 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 383 transitions. [2018-11-14 18:05:47,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 18:05:47,259 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:05:47,259 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:47,259 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:05:47,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:05:47,260 INFO L82 PathProgramCache]: Analyzing trace with hash 776478674, now seen corresponding path program 1 times [2018-11-14 18:05:47,260 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:05:47,260 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:05:47,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:05:47,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:47,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:47,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:05:47,835 INFO L256 TraceCheckUtils]: 0: Hoare triple {5103#true} call ULTIMATE.init(); {5103#true} is VALID [2018-11-14 18:05:47,835 INFO L273 TraceCheckUtils]: 1: Hoare triple {5103#true} assume true; {5103#true} is VALID [2018-11-14 18:05:47,835 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5103#true} {5103#true} #232#return; {5103#true} is VALID [2018-11-14 18:05:47,835 INFO L256 TraceCheckUtils]: 3: Hoare triple {5103#true} call #t~ret13 := main(); {5103#true} is VALID [2018-11-14 18:05:47,835 INFO L273 TraceCheckUtils]: 4: Hoare triple {5103#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;havoc ~cond~0; {5103#true} is VALID [2018-11-14 18:05:47,836 INFO L273 TraceCheckUtils]: 5: Hoare triple {5103#true} assume true; {5103#true} is VALID [2018-11-14 18:05:47,836 INFO L273 TraceCheckUtils]: 6: Hoare triple {5103#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {5103#true} is VALID [2018-11-14 18:05:47,836 INFO L273 TraceCheckUtils]: 7: Hoare triple {5103#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; {5103#true} is VALID [2018-11-14 18:05:47,836 INFO L273 TraceCheckUtils]: 8: Hoare triple {5103#true} assume !(~p1~0 != 0bv32); {5103#true} is VALID [2018-11-14 18:05:47,836 INFO L273 TraceCheckUtils]: 9: Hoare triple {5103#true} assume !(~p2~0 != 0bv32); {5103#true} is VALID [2018-11-14 18:05:47,837 INFO L273 TraceCheckUtils]: 10: Hoare triple {5103#true} assume !(~p3~0 != 0bv32); {5138#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:05:47,837 INFO L273 TraceCheckUtils]: 11: Hoare triple {5138#(= (_ bv0 32) main_~p3~0)} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {5138#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:05:47,837 INFO L273 TraceCheckUtils]: 12: Hoare triple {5138#(= (_ bv0 32) main_~p3~0)} assume !(~p5~0 != 0bv32); {5138#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:05:47,838 INFO L273 TraceCheckUtils]: 13: Hoare triple {5138#(= (_ bv0 32) main_~p3~0)} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {5138#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:05:47,838 INFO L273 TraceCheckUtils]: 14: Hoare triple {5138#(= (_ bv0 32) main_~p3~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {5138#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:05:47,839 INFO L273 TraceCheckUtils]: 15: Hoare triple {5138#(= (_ bv0 32) main_~p3~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {5138#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:05:47,839 INFO L273 TraceCheckUtils]: 16: Hoare triple {5138#(= (_ bv0 32) main_~p3~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {5138#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:05:47,839 INFO L273 TraceCheckUtils]: 17: Hoare triple {5138#(= (_ bv0 32) main_~p3~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {5138#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:05:47,840 INFO L273 TraceCheckUtils]: 18: Hoare triple {5138#(= (_ bv0 32) main_~p3~0)} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {5138#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:05:47,840 INFO L273 TraceCheckUtils]: 19: Hoare triple {5138#(= (_ bv0 32) main_~p3~0)} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {5138#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:05:47,841 INFO L273 TraceCheckUtils]: 20: Hoare triple {5138#(= (_ bv0 32) main_~p3~0)} assume !(~p1~0 != 0bv32); {5138#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:05:47,842 INFO L273 TraceCheckUtils]: 21: Hoare triple {5138#(= (_ bv0 32) main_~p3~0)} assume !(~p2~0 != 0bv32); {5138#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:05:47,842 INFO L273 TraceCheckUtils]: 22: Hoare triple {5138#(= (_ bv0 32) main_~p3~0)} assume ~p3~0 != 0bv32; {5104#false} is VALID [2018-11-14 18:05:47,843 INFO L273 TraceCheckUtils]: 23: Hoare triple {5104#false} assume ~lk3~0 != 1bv32; {5104#false} is VALID [2018-11-14 18:05:47,843 INFO L273 TraceCheckUtils]: 24: Hoare triple {5104#false} assume !false; {5104#false} is VALID [2018-11-14 18:05:47,844 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:47,844 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:05:47,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:05:47,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:05:47,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 18:05:47,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:05:47,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:05:47,870 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:47,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:05:47,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:05:47,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:05:47,871 INFO L87 Difference]: Start difference. First operand 221 states and 383 transitions. Second operand 3 states. [2018-11-14 18:05:48,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:48,281 INFO L93 Difference]: Finished difference Result 525 states and 917 transitions. [2018-11-14 18:05:48,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:05:48,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 18:05:48,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:05:48,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:48,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2018-11-14 18:05:48,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:48,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2018-11-14 18:05:48,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 224 transitions. [2018-11-14 18:05:48,880 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 224 edges. 224 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:48,889 INFO L225 Difference]: With dead ends: 525 [2018-11-14 18:05:48,889 INFO L226 Difference]: Without dead ends: 315 [2018-11-14 18:05:48,891 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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:48,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-11-14 18:05:48,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 313. [2018-11-14 18:05:48,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:05:48,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 315 states. Second operand 313 states. [2018-11-14 18:05:48,969 INFO L74 IsIncluded]: Start isIncluded. First operand 315 states. Second operand 313 states. [2018-11-14 18:05:48,969 INFO L87 Difference]: Start difference. First operand 315 states. Second operand 313 states. [2018-11-14 18:05:48,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:48,978 INFO L93 Difference]: Finished difference Result 315 states and 540 transitions. [2018-11-14 18:05:48,978 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 540 transitions. [2018-11-14 18:05:48,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:48,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:48,980 INFO L74 IsIncluded]: Start isIncluded. First operand 313 states. Second operand 315 states. [2018-11-14 18:05:48,980 INFO L87 Difference]: Start difference. First operand 313 states. Second operand 315 states. [2018-11-14 18:05:48,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:48,989 INFO L93 Difference]: Finished difference Result 315 states and 540 transitions. [2018-11-14 18:05:48,989 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 540 transitions. [2018-11-14 18:05:48,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:48,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:48,990 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:05:48,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:05:48,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-11-14 18:05:49,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 539 transitions. [2018-11-14 18:05:49,001 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 539 transitions. Word has length 25 [2018-11-14 18:05:49,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:05:49,001 INFO L480 AbstractCegarLoop]: Abstraction has 313 states and 539 transitions. [2018-11-14 18:05:49,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:05:49,001 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 539 transitions. [2018-11-14 18:05:49,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 18:05:49,002 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:05:49,002 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:05:49,003 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:05:49,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:05:49,003 INFO L82 PathProgramCache]: Analyzing trace with hash -677683113, now seen corresponding path program 1 times [2018-11-14 18:05:49,003 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:05:49,003 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:05:49,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:05:49,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:49,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:05:49,552 INFO L256 TraceCheckUtils]: 0: Hoare triple {6682#true} call ULTIMATE.init(); {6682#true} is VALID [2018-11-14 18:05:49,552 INFO L273 TraceCheckUtils]: 1: Hoare triple {6682#true} assume true; {6682#true} is VALID [2018-11-14 18:05:49,552 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6682#true} {6682#true} #232#return; {6682#true} is VALID [2018-11-14 18:05:49,553 INFO L256 TraceCheckUtils]: 3: Hoare triple {6682#true} call #t~ret13 := main(); {6682#true} is VALID [2018-11-14 18:05:49,553 INFO L273 TraceCheckUtils]: 4: Hoare triple {6682#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;havoc ~cond~0; {6682#true} is VALID [2018-11-14 18:05:49,553 INFO L273 TraceCheckUtils]: 5: Hoare triple {6682#true} assume true; {6682#true} is VALID [2018-11-14 18:05:49,554 INFO L273 TraceCheckUtils]: 6: Hoare triple {6682#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {6682#true} is VALID [2018-11-14 18:05:49,554 INFO L273 TraceCheckUtils]: 7: Hoare triple {6682#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; {6682#true} is VALID [2018-11-14 18:05:49,554 INFO L273 TraceCheckUtils]: 8: Hoare triple {6682#true} assume !(~p1~0 != 0bv32); {6682#true} is VALID [2018-11-14 18:05:49,554 INFO L273 TraceCheckUtils]: 9: Hoare triple {6682#true} assume !(~p2~0 != 0bv32); {6682#true} is VALID [2018-11-14 18:05:49,561 INFO L273 TraceCheckUtils]: 10: Hoare triple {6682#true} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {6717#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:05:49,561 INFO L273 TraceCheckUtils]: 11: Hoare triple {6717#(not (= (_ bv0 32) main_~p3~0))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {6717#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:05:49,562 INFO L273 TraceCheckUtils]: 12: Hoare triple {6717#(not (= (_ bv0 32) main_~p3~0))} assume !(~p5~0 != 0bv32); {6717#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:05:49,562 INFO L273 TraceCheckUtils]: 13: Hoare triple {6717#(not (= (_ bv0 32) main_~p3~0))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {6717#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:05:49,562 INFO L273 TraceCheckUtils]: 14: Hoare triple {6717#(not (= (_ bv0 32) main_~p3~0))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {6717#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:05:49,563 INFO L273 TraceCheckUtils]: 15: Hoare triple {6717#(not (= (_ bv0 32) main_~p3~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {6717#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:05:49,563 INFO L273 TraceCheckUtils]: 16: Hoare triple {6717#(not (= (_ bv0 32) main_~p3~0))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {6717#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:05:49,563 INFO L273 TraceCheckUtils]: 17: Hoare triple {6717#(not (= (_ bv0 32) main_~p3~0))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {6717#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:05:49,564 INFO L273 TraceCheckUtils]: 18: Hoare triple {6717#(not (= (_ bv0 32) main_~p3~0))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {6717#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:05:49,565 INFO L273 TraceCheckUtils]: 19: Hoare triple {6717#(not (= (_ bv0 32) main_~p3~0))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {6717#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:05:49,570 INFO L273 TraceCheckUtils]: 20: Hoare triple {6717#(not (= (_ bv0 32) main_~p3~0))} assume !(~p1~0 != 0bv32); {6717#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:05:49,570 INFO L273 TraceCheckUtils]: 21: Hoare triple {6717#(not (= (_ bv0 32) main_~p3~0))} assume !(~p2~0 != 0bv32); {6717#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:05:49,570 INFO L273 TraceCheckUtils]: 22: Hoare triple {6717#(not (= (_ bv0 32) main_~p3~0))} assume !(~p3~0 != 0bv32); {6683#false} is VALID [2018-11-14 18:05:49,571 INFO L273 TraceCheckUtils]: 23: Hoare triple {6683#false} assume ~p4~0 != 0bv32; {6683#false} is VALID [2018-11-14 18:05:49,571 INFO L273 TraceCheckUtils]: 24: Hoare triple {6683#false} assume ~lk4~0 != 1bv32; {6683#false} is VALID [2018-11-14 18:05:49,571 INFO L273 TraceCheckUtils]: 25: Hoare triple {6683#false} assume !false; {6683#false} is VALID [2018-11-14 18:05:49,572 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:49,572 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:05:49,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:05:49,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:05:49,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-14 18:05:49,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:05:49,574 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:05:49,598 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:05:49,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:05:49,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:05:49,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:05:49,599 INFO L87 Difference]: Start difference. First operand 313 states and 539 transitions. Second operand 3 states. [2018-11-14 18:05:50,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:50,143 INFO L93 Difference]: Finished difference Result 469 states and 805 transitions. [2018-11-14 18:05:50,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:05:50,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-14 18:05:50,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:05:50,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:50,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 219 transitions. [2018-11-14 18:05:50,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:50,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 219 transitions. [2018-11-14 18:05:50,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 219 transitions. [2018-11-14 18:05:50,713 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:50,720 INFO L225 Difference]: With dead ends: 469 [2018-11-14 18:05:50,720 INFO L226 Difference]: Without dead ends: 319 [2018-11-14 18:05:50,721 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:05:50,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-11-14 18:05:50,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 317. [2018-11-14 18:05:50,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:05:50,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 319 states. Second operand 317 states. [2018-11-14 18:05:50,910 INFO L74 IsIncluded]: Start isIncluded. First operand 319 states. Second operand 317 states. [2018-11-14 18:05:50,910 INFO L87 Difference]: Start difference. First operand 319 states. Second operand 317 states. [2018-11-14 18:05:50,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:50,920 INFO L93 Difference]: Finished difference Result 319 states and 540 transitions. [2018-11-14 18:05:50,920 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 540 transitions. [2018-11-14 18:05:50,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:50,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:50,921 INFO L74 IsIncluded]: Start isIncluded. First operand 317 states. Second operand 319 states. [2018-11-14 18:05:50,922 INFO L87 Difference]: Start difference. First operand 317 states. Second operand 319 states. [2018-11-14 18:05:50,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:50,931 INFO L93 Difference]: Finished difference Result 319 states and 540 transitions. [2018-11-14 18:05:50,931 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 540 transitions. [2018-11-14 18:05:50,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:50,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:50,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:05:50,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:05:50,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-11-14 18:05:50,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 539 transitions. [2018-11-14 18:05:50,941 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 539 transitions. Word has length 26 [2018-11-14 18:05:50,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:05:50,942 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 539 transitions. [2018-11-14 18:05:50,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:05:50,942 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 539 transitions. [2018-11-14 18:05:50,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 18:05:50,943 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:05:50,943 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:05:50,943 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:05:50,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:05:50,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1698751467, now seen corresponding path program 1 times [2018-11-14 18:05:50,944 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:05:50,944 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:05:50,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:05:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:51,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:05:51,510 INFO L256 TraceCheckUtils]: 0: Hoare triple {8220#true} call ULTIMATE.init(); {8220#true} is VALID [2018-11-14 18:05:51,511 INFO L273 TraceCheckUtils]: 1: Hoare triple {8220#true} assume true; {8220#true} is VALID [2018-11-14 18:05:51,511 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {8220#true} {8220#true} #232#return; {8220#true} is VALID [2018-11-14 18:05:51,511 INFO L256 TraceCheckUtils]: 3: Hoare triple {8220#true} call #t~ret13 := main(); {8220#true} is VALID [2018-11-14 18:05:51,511 INFO L273 TraceCheckUtils]: 4: Hoare triple {8220#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;havoc ~cond~0; {8220#true} is VALID [2018-11-14 18:05:51,512 INFO L273 TraceCheckUtils]: 5: Hoare triple {8220#true} assume true; {8220#true} is VALID [2018-11-14 18:05:51,512 INFO L273 TraceCheckUtils]: 6: Hoare triple {8220#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {8220#true} is VALID [2018-11-14 18:05:51,512 INFO L273 TraceCheckUtils]: 7: Hoare triple {8220#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; {8220#true} is VALID [2018-11-14 18:05:51,512 INFO L273 TraceCheckUtils]: 8: Hoare triple {8220#true} assume !(~p1~0 != 0bv32); {8220#true} is VALID [2018-11-14 18:05:51,512 INFO L273 TraceCheckUtils]: 9: Hoare triple {8220#true} assume !(~p2~0 != 0bv32); {8220#true} is VALID [2018-11-14 18:05:51,512 INFO L273 TraceCheckUtils]: 10: Hoare triple {8220#true} assume !(~p3~0 != 0bv32); {8220#true} is VALID [2018-11-14 18:05:51,513 INFO L273 TraceCheckUtils]: 11: Hoare triple {8220#true} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {8258#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:51,514 INFO L273 TraceCheckUtils]: 12: Hoare triple {8258#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {8258#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:51,514 INFO L273 TraceCheckUtils]: 13: Hoare triple {8258#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {8258#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:51,517 INFO L273 TraceCheckUtils]: 14: Hoare triple {8258#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {8258#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:51,517 INFO L273 TraceCheckUtils]: 15: Hoare triple {8258#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {8258#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:51,517 INFO L273 TraceCheckUtils]: 16: Hoare triple {8258#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {8258#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:51,518 INFO L273 TraceCheckUtils]: 17: Hoare triple {8258#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {8258#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:51,518 INFO L273 TraceCheckUtils]: 18: Hoare triple {8258#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {8258#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:51,518 INFO L273 TraceCheckUtils]: 19: Hoare triple {8258#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {8258#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:51,519 INFO L273 TraceCheckUtils]: 20: Hoare triple {8258#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {8258#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:51,519 INFO L273 TraceCheckUtils]: 21: Hoare triple {8258#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {8258#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:51,519 INFO L273 TraceCheckUtils]: 22: Hoare triple {8258#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p3~0 != 0bv32); {8258#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:51,520 INFO L273 TraceCheckUtils]: 23: Hoare triple {8258#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p4~0 != 0bv32; {8258#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:51,520 INFO L273 TraceCheckUtils]: 24: Hoare triple {8258#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk4~0 != 1bv32; {8221#false} is VALID [2018-11-14 18:05:51,520 INFO L273 TraceCheckUtils]: 25: Hoare triple {8221#false} assume !false; {8221#false} is VALID [2018-11-14 18:05:51,521 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:51,522 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:05:51,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:05:51,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:05:51,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-14 18:05:51,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:05:51,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:05:51,547 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:05:51,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:05:51,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:05:51,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:05:51,548 INFO L87 Difference]: Start difference. First operand 317 states and 539 transitions. Second operand 3 states. [2018-11-14 18:05:52,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:52,120 INFO L93 Difference]: Finished difference Result 589 states and 1017 transitions. [2018-11-14 18:05:52,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:05:52,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-14 18:05:52,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:05:52,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:52,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2018-11-14 18:05:52,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:52,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2018-11-14 18:05:52,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 144 transitions. [2018-11-14 18:05:52,265 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:05:52,284 INFO L225 Difference]: With dead ends: 589 [2018-11-14 18:05:52,284 INFO L226 Difference]: Without dead ends: 587 [2018-11-14 18:05:52,284 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 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:52,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-11-14 18:05:52,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 433. [2018-11-14 18:05:52,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:05:52,415 INFO L82 GeneralOperation]: Start isEquivalent. First operand 587 states. Second operand 433 states. [2018-11-14 18:05:52,415 INFO L74 IsIncluded]: Start isIncluded. First operand 587 states. Second operand 433 states. [2018-11-14 18:05:52,415 INFO L87 Difference]: Start difference. First operand 587 states. Second operand 433 states. [2018-11-14 18:05:52,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:52,433 INFO L93 Difference]: Finished difference Result 587 states and 1008 transitions. [2018-11-14 18:05:52,433 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1008 transitions. [2018-11-14 18:05:52,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:52,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:52,435 INFO L74 IsIncluded]: Start isIncluded. First operand 433 states. Second operand 587 states. [2018-11-14 18:05:52,435 INFO L87 Difference]: Start difference. First operand 433 states. Second operand 587 states. [2018-11-14 18:05:52,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:52,456 INFO L93 Difference]: Finished difference Result 587 states and 1008 transitions. [2018-11-14 18:05:52,457 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1008 transitions. [2018-11-14 18:05:52,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:52,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:52,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:05:52,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:05:52,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-11-14 18:05:52,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 727 transitions. [2018-11-14 18:05:52,472 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 727 transitions. Word has length 26 [2018-11-14 18:05:52,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:05:52,473 INFO L480 AbstractCegarLoop]: Abstraction has 433 states and 727 transitions. [2018-11-14 18:05:52,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:05:52,473 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 727 transitions. [2018-11-14 18:05:52,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 18:05:52,474 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:05:52,475 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:05:52,475 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:05:52,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:05:52,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1316352151, now seen corresponding path program 1 times [2018-11-14 18:05:52,475 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:05:52,476 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:05:52,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:05:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:52,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:52,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:05:52,675 INFO L256 TraceCheckUtils]: 0: Hoare triple {10534#true} call ULTIMATE.init(); {10534#true} is VALID [2018-11-14 18:05:52,675 INFO L273 TraceCheckUtils]: 1: Hoare triple {10534#true} assume true; {10534#true} is VALID [2018-11-14 18:05:52,675 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {10534#true} {10534#true} #232#return; {10534#true} is VALID [2018-11-14 18:05:52,675 INFO L256 TraceCheckUtils]: 3: Hoare triple {10534#true} call #t~ret13 := main(); {10534#true} is VALID [2018-11-14 18:05:52,676 INFO L273 TraceCheckUtils]: 4: Hoare triple {10534#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;havoc ~cond~0; {10534#true} is VALID [2018-11-14 18:05:52,676 INFO L273 TraceCheckUtils]: 5: Hoare triple {10534#true} assume true; {10534#true} is VALID [2018-11-14 18:05:52,676 INFO L273 TraceCheckUtils]: 6: Hoare triple {10534#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {10534#true} is VALID [2018-11-14 18:05:52,676 INFO L273 TraceCheckUtils]: 7: Hoare triple {10534#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; {10534#true} is VALID [2018-11-14 18:05:52,676 INFO L273 TraceCheckUtils]: 8: Hoare triple {10534#true} assume !(~p1~0 != 0bv32); {10534#true} is VALID [2018-11-14 18:05:52,677 INFO L273 TraceCheckUtils]: 9: Hoare triple {10534#true} assume !(~p2~0 != 0bv32); {10534#true} is VALID [2018-11-14 18:05:52,677 INFO L273 TraceCheckUtils]: 10: Hoare triple {10534#true} assume !(~p3~0 != 0bv32); {10534#true} is VALID [2018-11-14 18:05:52,679 INFO L273 TraceCheckUtils]: 11: Hoare triple {10534#true} assume !(~p4~0 != 0bv32); {10572#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:05:52,679 INFO L273 TraceCheckUtils]: 12: Hoare triple {10572#(= (_ bv0 32) main_~p4~0)} assume !(~p5~0 != 0bv32); {10572#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:05:52,681 INFO L273 TraceCheckUtils]: 13: Hoare triple {10572#(= (_ bv0 32) main_~p4~0)} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {10572#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:05:52,681 INFO L273 TraceCheckUtils]: 14: Hoare triple {10572#(= (_ bv0 32) main_~p4~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {10572#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:05:52,684 INFO L273 TraceCheckUtils]: 15: Hoare triple {10572#(= (_ bv0 32) main_~p4~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {10572#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:05:52,684 INFO L273 TraceCheckUtils]: 16: Hoare triple {10572#(= (_ bv0 32) main_~p4~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {10572#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:05:52,687 INFO L273 TraceCheckUtils]: 17: Hoare triple {10572#(= (_ bv0 32) main_~p4~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {10572#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:05:52,687 INFO L273 TraceCheckUtils]: 18: Hoare triple {10572#(= (_ bv0 32) main_~p4~0)} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {10572#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:05:52,687 INFO L273 TraceCheckUtils]: 19: Hoare triple {10572#(= (_ bv0 32) main_~p4~0)} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {10572#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:05:52,688 INFO L273 TraceCheckUtils]: 20: Hoare triple {10572#(= (_ bv0 32) main_~p4~0)} assume !(~p1~0 != 0bv32); {10572#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:05:52,688 INFO L273 TraceCheckUtils]: 21: Hoare triple {10572#(= (_ bv0 32) main_~p4~0)} assume !(~p2~0 != 0bv32); {10572#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:05:52,697 INFO L273 TraceCheckUtils]: 22: Hoare triple {10572#(= (_ bv0 32) main_~p4~0)} assume !(~p3~0 != 0bv32); {10572#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:05:52,712 INFO L273 TraceCheckUtils]: 23: Hoare triple {10572#(= (_ bv0 32) main_~p4~0)} assume ~p4~0 != 0bv32; {10535#false} is VALID [2018-11-14 18:05:52,712 INFO L273 TraceCheckUtils]: 24: Hoare triple {10535#false} assume ~lk4~0 != 1bv32; {10535#false} is VALID [2018-11-14 18:05:52,712 INFO L273 TraceCheckUtils]: 25: Hoare triple {10535#false} assume !false; {10535#false} is VALID [2018-11-14 18:05:52,713 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:52,713 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:05:52,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:05:52,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:05:52,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-14 18:05:52,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:05:52,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:05:52,791 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:05:52,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:05:52,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:05:52,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:05:52,792 INFO L87 Difference]: Start difference. First operand 433 states and 727 transitions. Second operand 3 states. [2018-11-14 18:05:53,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:53,664 INFO L93 Difference]: Finished difference Result 1029 states and 1737 transitions. [2018-11-14 18:05:53,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:05:53,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-14 18:05:53,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:05:53,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:53,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2018-11-14 18:05:53,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:53,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2018-11-14 18:05:53,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 221 transitions. [2018-11-14 18:05:53,878 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:53,897 INFO L225 Difference]: With dead ends: 1029 [2018-11-14 18:05:53,897 INFO L226 Difference]: Without dead ends: 611 [2018-11-14 18:05:53,898 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:05:53,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-11-14 18:05:54,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 609. [2018-11-14 18:05:54,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:05:54,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 611 states. Second operand 609 states. [2018-11-14 18:05:54,032 INFO L74 IsIncluded]: Start isIncluded. First operand 611 states. Second operand 609 states. [2018-11-14 18:05:54,032 INFO L87 Difference]: Start difference. First operand 611 states. Second operand 609 states. [2018-11-14 18:05:54,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:54,053 INFO L93 Difference]: Finished difference Result 611 states and 1016 transitions. [2018-11-14 18:05:54,053 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 1016 transitions. [2018-11-14 18:05:54,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:54,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:54,055 INFO L74 IsIncluded]: Start isIncluded. First operand 609 states. Second operand 611 states. [2018-11-14 18:05:54,055 INFO L87 Difference]: Start difference. First operand 609 states. Second operand 611 states. [2018-11-14 18:05:54,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:54,077 INFO L93 Difference]: Finished difference Result 611 states and 1016 transitions. [2018-11-14 18:05:54,077 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 1016 transitions. [2018-11-14 18:05:54,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:54,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:54,078 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:05:54,078 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:05:54,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2018-11-14 18:05:54,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 1015 transitions. [2018-11-14 18:05:54,099 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 1015 transitions. Word has length 26 [2018-11-14 18:05:54,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:05:54,100 INFO L480 AbstractCegarLoop]: Abstraction has 609 states and 1015 transitions. [2018-11-14 18:05:54,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:05:54,100 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 1015 transitions. [2018-11-14 18:05:54,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 18:05:54,101 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:05:54,101 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:05:54,101 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:05:54,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:05:54,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1121474169, now seen corresponding path program 1 times [2018-11-14 18:05:54,102 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:05:54,102 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:05:54,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:05:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:54,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:05:54,247 INFO L256 TraceCheckUtils]: 0: Hoare triple {13528#true} call ULTIMATE.init(); {13528#true} is VALID [2018-11-14 18:05:54,248 INFO L273 TraceCheckUtils]: 1: Hoare triple {13528#true} assume true; {13528#true} is VALID [2018-11-14 18:05:54,248 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {13528#true} {13528#true} #232#return; {13528#true} is VALID [2018-11-14 18:05:54,248 INFO L256 TraceCheckUtils]: 3: Hoare triple {13528#true} call #t~ret13 := main(); {13528#true} is VALID [2018-11-14 18:05:54,249 INFO L273 TraceCheckUtils]: 4: Hoare triple {13528#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;havoc ~cond~0; {13528#true} is VALID [2018-11-14 18:05:54,249 INFO L273 TraceCheckUtils]: 5: Hoare triple {13528#true} assume true; {13528#true} is VALID [2018-11-14 18:05:54,249 INFO L273 TraceCheckUtils]: 6: Hoare triple {13528#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {13528#true} is VALID [2018-11-14 18:05:54,250 INFO L273 TraceCheckUtils]: 7: Hoare triple {13528#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; {13528#true} is VALID [2018-11-14 18:05:54,250 INFO L273 TraceCheckUtils]: 8: Hoare triple {13528#true} assume !(~p1~0 != 0bv32); {13528#true} is VALID [2018-11-14 18:05:54,250 INFO L273 TraceCheckUtils]: 9: Hoare triple {13528#true} assume !(~p2~0 != 0bv32); {13528#true} is VALID [2018-11-14 18:05:54,251 INFO L273 TraceCheckUtils]: 10: Hoare triple {13528#true} assume !(~p3~0 != 0bv32); {13528#true} is VALID [2018-11-14 18:05:54,251 INFO L273 TraceCheckUtils]: 11: Hoare triple {13528#true} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {13566#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:05:54,251 INFO L273 TraceCheckUtils]: 12: Hoare triple {13566#(not (= (_ bv0 32) main_~p4~0))} assume !(~p5~0 != 0bv32); {13566#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:05:54,252 INFO L273 TraceCheckUtils]: 13: Hoare triple {13566#(not (= (_ bv0 32) main_~p4~0))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {13566#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:05:54,252 INFO L273 TraceCheckUtils]: 14: Hoare triple {13566#(not (= (_ bv0 32) main_~p4~0))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {13566#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:05:54,252 INFO L273 TraceCheckUtils]: 15: Hoare triple {13566#(not (= (_ bv0 32) main_~p4~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {13566#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:05:54,253 INFO L273 TraceCheckUtils]: 16: Hoare triple {13566#(not (= (_ bv0 32) main_~p4~0))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {13566#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:05:54,253 INFO L273 TraceCheckUtils]: 17: Hoare triple {13566#(not (= (_ bv0 32) main_~p4~0))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {13566#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:05:54,253 INFO L273 TraceCheckUtils]: 18: Hoare triple {13566#(not (= (_ bv0 32) main_~p4~0))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {13566#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:05:54,254 INFO L273 TraceCheckUtils]: 19: Hoare triple {13566#(not (= (_ bv0 32) main_~p4~0))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {13566#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:05:54,254 INFO L273 TraceCheckUtils]: 20: Hoare triple {13566#(not (= (_ bv0 32) main_~p4~0))} assume !(~p1~0 != 0bv32); {13566#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:05:54,257 INFO L273 TraceCheckUtils]: 21: Hoare triple {13566#(not (= (_ bv0 32) main_~p4~0))} assume !(~p2~0 != 0bv32); {13566#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:05:54,257 INFO L273 TraceCheckUtils]: 22: Hoare triple {13566#(not (= (_ bv0 32) main_~p4~0))} assume !(~p3~0 != 0bv32); {13566#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:05:54,258 INFO L273 TraceCheckUtils]: 23: Hoare triple {13566#(not (= (_ bv0 32) main_~p4~0))} assume !(~p4~0 != 0bv32); {13529#false} is VALID [2018-11-14 18:05:54,258 INFO L273 TraceCheckUtils]: 24: Hoare triple {13529#false} assume ~p5~0 != 0bv32; {13529#false} is VALID [2018-11-14 18:05:54,258 INFO L273 TraceCheckUtils]: 25: Hoare triple {13529#false} assume ~lk5~0 != 1bv32; {13529#false} is VALID [2018-11-14 18:05:54,258 INFO L273 TraceCheckUtils]: 26: Hoare triple {13529#false} assume !false; {13529#false} is VALID [2018-11-14 18:05:54,259 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:54,259 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:05:54,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:05:54,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:05:54,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 18:05:54,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:05:54,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:05:54,284 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:05:54,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:05:54,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:05:54,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:05:54,286 INFO L87 Difference]: Start difference. First operand 609 states and 1015 transitions. Second operand 3 states. [2018-11-14 18:05:54,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:54,687 INFO L93 Difference]: Finished difference Result 913 states and 1517 transitions. [2018-11-14 18:05:54,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:05:54,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 18:05:54,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:05:54,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:54,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 216 transitions. [2018-11-14 18:05:54,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:54,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 216 transitions. [2018-11-14 18:05:54,692 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 216 transitions. [2018-11-14 18:05:54,910 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:54,936 INFO L225 Difference]: With dead ends: 913 [2018-11-14 18:05:54,936 INFO L226 Difference]: Without dead ends: 619 [2018-11-14 18:05:54,937 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:05:54,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-11-14 18:05:55,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 617. [2018-11-14 18:05:55,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:05:55,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 619 states. Second operand 617 states. [2018-11-14 18:05:55,388 INFO L74 IsIncluded]: Start isIncluded. First operand 619 states. Second operand 617 states. [2018-11-14 18:05:55,388 INFO L87 Difference]: Start difference. First operand 619 states. Second operand 617 states. [2018-11-14 18:05:55,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:55,407 INFO L93 Difference]: Finished difference Result 619 states and 1016 transitions. [2018-11-14 18:05:55,407 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 1016 transitions. [2018-11-14 18:05:55,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:55,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:55,409 INFO L74 IsIncluded]: Start isIncluded. First operand 617 states. Second operand 619 states. [2018-11-14 18:05:55,409 INFO L87 Difference]: Start difference. First operand 617 states. Second operand 619 states. [2018-11-14 18:05:55,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:55,428 INFO L93 Difference]: Finished difference Result 619 states and 1016 transitions. [2018-11-14 18:05:55,428 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 1016 transitions. [2018-11-14 18:05:55,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:55,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:55,429 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:05:55,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:05:55,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2018-11-14 18:05:55,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 1015 transitions. [2018-11-14 18:05:55,447 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 1015 transitions. Word has length 27 [2018-11-14 18:05:55,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:05:55,448 INFO L480 AbstractCegarLoop]: Abstraction has 617 states and 1015 transitions. [2018-11-14 18:05:55,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:05:55,448 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 1015 transitions. [2018-11-14 18:05:55,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 18:05:55,449 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:05:55,449 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:05:55,450 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:05:55,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:05:55,450 INFO L82 PathProgramCache]: Analyzing trace with hash -2142542523, now seen corresponding path program 1 times [2018-11-14 18:05:55,450 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:05:55,450 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:05:55,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:05:55,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:55,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:05:55,567 INFO L256 TraceCheckUtils]: 0: Hoare triple {16433#true} call ULTIMATE.init(); {16433#true} is VALID [2018-11-14 18:05:55,567 INFO L273 TraceCheckUtils]: 1: Hoare triple {16433#true} assume true; {16433#true} is VALID [2018-11-14 18:05:55,568 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {16433#true} {16433#true} #232#return; {16433#true} is VALID [2018-11-14 18:05:55,568 INFO L256 TraceCheckUtils]: 3: Hoare triple {16433#true} call #t~ret13 := main(); {16433#true} is VALID [2018-11-14 18:05:55,568 INFO L273 TraceCheckUtils]: 4: Hoare triple {16433#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;havoc ~cond~0; {16433#true} is VALID [2018-11-14 18:05:55,568 INFO L273 TraceCheckUtils]: 5: Hoare triple {16433#true} assume true; {16433#true} is VALID [2018-11-14 18:05:55,569 INFO L273 TraceCheckUtils]: 6: Hoare triple {16433#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {16433#true} is VALID [2018-11-14 18:05:55,569 INFO L273 TraceCheckUtils]: 7: Hoare triple {16433#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; {16433#true} is VALID [2018-11-14 18:05:55,569 INFO L273 TraceCheckUtils]: 8: Hoare triple {16433#true} assume !(~p1~0 != 0bv32); {16433#true} is VALID [2018-11-14 18:05:55,569 INFO L273 TraceCheckUtils]: 9: Hoare triple {16433#true} assume !(~p2~0 != 0bv32); {16433#true} is VALID [2018-11-14 18:05:55,569 INFO L273 TraceCheckUtils]: 10: Hoare triple {16433#true} assume !(~p3~0 != 0bv32); {16433#true} is VALID [2018-11-14 18:05:55,569 INFO L273 TraceCheckUtils]: 11: Hoare triple {16433#true} assume !(~p4~0 != 0bv32); {16433#true} is VALID [2018-11-14 18:05:55,571 INFO L273 TraceCheckUtils]: 12: Hoare triple {16433#true} assume !(~p5~0 != 0bv32); {16474#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:05:55,571 INFO L273 TraceCheckUtils]: 13: Hoare triple {16474#(= (_ bv0 32) main_~p5~0)} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {16474#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:05:55,572 INFO L273 TraceCheckUtils]: 14: Hoare triple {16474#(= (_ bv0 32) main_~p5~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {16474#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:05:55,572 INFO L273 TraceCheckUtils]: 15: Hoare triple {16474#(= (_ bv0 32) main_~p5~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {16474#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:05:55,572 INFO L273 TraceCheckUtils]: 16: Hoare triple {16474#(= (_ bv0 32) main_~p5~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {16474#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:05:55,573 INFO L273 TraceCheckUtils]: 17: Hoare triple {16474#(= (_ bv0 32) main_~p5~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {16474#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:05:55,573 INFO L273 TraceCheckUtils]: 18: Hoare triple {16474#(= (_ bv0 32) main_~p5~0)} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {16474#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:05:55,574 INFO L273 TraceCheckUtils]: 19: Hoare triple {16474#(= (_ bv0 32) main_~p5~0)} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {16474#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:05:55,574 INFO L273 TraceCheckUtils]: 20: Hoare triple {16474#(= (_ bv0 32) main_~p5~0)} assume !(~p1~0 != 0bv32); {16474#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:05:55,574 INFO L273 TraceCheckUtils]: 21: Hoare triple {16474#(= (_ bv0 32) main_~p5~0)} assume !(~p2~0 != 0bv32); {16474#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:05:55,575 INFO L273 TraceCheckUtils]: 22: Hoare triple {16474#(= (_ bv0 32) main_~p5~0)} assume !(~p3~0 != 0bv32); {16474#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:05:55,575 INFO L273 TraceCheckUtils]: 23: Hoare triple {16474#(= (_ bv0 32) main_~p5~0)} assume !(~p4~0 != 0bv32); {16474#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:05:55,576 INFO L273 TraceCheckUtils]: 24: Hoare triple {16474#(= (_ bv0 32) main_~p5~0)} assume ~p5~0 != 0bv32; {16434#false} is VALID [2018-11-14 18:05:55,576 INFO L273 TraceCheckUtils]: 25: Hoare triple {16434#false} assume ~lk5~0 != 1bv32; {16434#false} is VALID [2018-11-14 18:05:55,577 INFO L273 TraceCheckUtils]: 26: Hoare triple {16434#false} assume !false; {16434#false} is VALID [2018-11-14 18:05:55,578 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,579 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:05:55,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:05:55,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:05:55,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 18:05:55,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:05:55,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:05:55,614 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:05:55,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:05:55,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:05:55,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:05:55,615 INFO L87 Difference]: Start difference. First operand 617 states and 1015 transitions. Second operand 3 states. [2018-11-14 18:05:56,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:56,163 INFO L93 Difference]: Finished difference Result 1789 states and 2937 transitions. [2018-11-14 18:05:56,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:05:56,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 18:05:56,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:05:56,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:56,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 219 transitions. [2018-11-14 18:05:56,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:56,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 219 transitions. [2018-11-14 18:05:56,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 219 transitions. [2018-11-14 18:05:56,392 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:56,448 INFO L225 Difference]: With dead ends: 1789 [2018-11-14 18:05:56,448 INFO L226 Difference]: Without dead ends: 1195 [2018-11-14 18:05:56,450 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:05:56,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2018-11-14 18:05:57,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1193. [2018-11-14 18:05:57,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:05:57,193 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1195 states. Second operand 1193 states. [2018-11-14 18:05:57,193 INFO L74 IsIncluded]: Start isIncluded. First operand 1195 states. Second operand 1193 states. [2018-11-14 18:05:57,193 INFO L87 Difference]: Start difference. First operand 1195 states. Second operand 1193 states. [2018-11-14 18:05:57,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:57,250 INFO L93 Difference]: Finished difference Result 1195 states and 1928 transitions. [2018-11-14 18:05:57,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1928 transitions. [2018-11-14 18:05:57,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:57,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:57,253 INFO L74 IsIncluded]: Start isIncluded. First operand 1193 states. Second operand 1195 states. [2018-11-14 18:05:57,253 INFO L87 Difference]: Start difference. First operand 1193 states. Second operand 1195 states. [2018-11-14 18:05:57,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:57,316 INFO L93 Difference]: Finished difference Result 1195 states and 1928 transitions. [2018-11-14 18:05:57,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1928 transitions. [2018-11-14 18:05:57,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:57,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:57,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:05:57,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:05:57,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1193 states. [2018-11-14 18:05:57,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1927 transitions. [2018-11-14 18:05:57,362 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1927 transitions. Word has length 27 [2018-11-14 18:05:57,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:05:57,362 INFO L480 AbstractCegarLoop]: Abstraction has 1193 states and 1927 transitions. [2018-11-14 18:05:57,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:05:57,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1927 transitions. [2018-11-14 18:05:57,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 18:05:57,363 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:05:57,363 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:05:57,363 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:05:57,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:05:57,364 INFO L82 PathProgramCache]: Analyzing trace with hash -862678845, now seen corresponding path program 1 times [2018-11-14 18:05:57,364 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:05:57,364 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:05:57,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:05:57,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:57,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:05:57,468 INFO L256 TraceCheckUtils]: 0: Hoare triple {21982#true} call ULTIMATE.init(); {21982#true} is VALID [2018-11-14 18:05:57,469 INFO L273 TraceCheckUtils]: 1: Hoare triple {21982#true} assume true; {21982#true} is VALID [2018-11-14 18:05:57,469 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {21982#true} {21982#true} #232#return; {21982#true} is VALID [2018-11-14 18:05:57,469 INFO L256 TraceCheckUtils]: 3: Hoare triple {21982#true} call #t~ret13 := main(); {21982#true} is VALID [2018-11-14 18:05:57,469 INFO L273 TraceCheckUtils]: 4: Hoare triple {21982#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;havoc ~cond~0; {21982#true} is VALID [2018-11-14 18:05:57,469 INFO L273 TraceCheckUtils]: 5: Hoare triple {21982#true} assume true; {21982#true} is VALID [2018-11-14 18:05:57,469 INFO L273 TraceCheckUtils]: 6: Hoare triple {21982#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {21982#true} is VALID [2018-11-14 18:05:57,469 INFO L273 TraceCheckUtils]: 7: Hoare triple {21982#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; {21982#true} is VALID [2018-11-14 18:05:57,470 INFO L273 TraceCheckUtils]: 8: Hoare triple {21982#true} assume !(~p1~0 != 0bv32); {21982#true} is VALID [2018-11-14 18:05:57,470 INFO L273 TraceCheckUtils]: 9: Hoare triple {21982#true} assume !(~p2~0 != 0bv32); {21982#true} is VALID [2018-11-14 18:05:57,470 INFO L273 TraceCheckUtils]: 10: Hoare triple {21982#true} assume !(~p3~0 != 0bv32); {21982#true} is VALID [2018-11-14 18:05:57,470 INFO L273 TraceCheckUtils]: 11: Hoare triple {21982#true} assume !(~p4~0 != 0bv32); {21982#true} is VALID [2018-11-14 18:05:57,470 INFO L273 TraceCheckUtils]: 12: Hoare triple {21982#true} assume ~p5~0 != 0bv32;~lk5~0 := 1bv32; {22023#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:57,475 INFO L273 TraceCheckUtils]: 13: Hoare triple {22023#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {22023#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:57,475 INFO L273 TraceCheckUtils]: 14: Hoare triple {22023#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {22023#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:57,475 INFO L273 TraceCheckUtils]: 15: Hoare triple {22023#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {22023#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:57,476 INFO L273 TraceCheckUtils]: 16: Hoare triple {22023#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {22023#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:57,476 INFO L273 TraceCheckUtils]: 17: Hoare triple {22023#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {22023#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:57,476 INFO L273 TraceCheckUtils]: 18: Hoare triple {22023#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {22023#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:57,477 INFO L273 TraceCheckUtils]: 19: Hoare triple {22023#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {22023#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:57,477 INFO L273 TraceCheckUtils]: 20: Hoare triple {22023#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {22023#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:57,477 INFO L273 TraceCheckUtils]: 21: Hoare triple {22023#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {22023#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:57,478 INFO L273 TraceCheckUtils]: 22: Hoare triple {22023#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p3~0 != 0bv32); {22023#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:57,478 INFO L273 TraceCheckUtils]: 23: Hoare triple {22023#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p4~0 != 0bv32); {22023#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:57,478 INFO L273 TraceCheckUtils]: 24: Hoare triple {22023#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p5~0 != 0bv32; {22023#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:57,479 INFO L273 TraceCheckUtils]: 25: Hoare triple {22023#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk5~0 != 1bv32; {21983#false} is VALID [2018-11-14 18:05:57,479 INFO L273 TraceCheckUtils]: 26: Hoare triple {21983#false} assume !false; {21983#false} is VALID [2018-11-14 18:05:57,481 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,481 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:05:57,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:05:57,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:05:57,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 18:05:57,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:05:57,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:05:57,508 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:05:57,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:05:57,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:05:57,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:05:57,509 INFO L87 Difference]: Start difference. First operand 1193 states and 1927 transitions. Second operand 3 states. [2018-11-14 18:05:58,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:58,614 INFO L93 Difference]: Finished difference Result 1469 states and 2425 transitions. [2018-11-14 18:05:58,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:05:58,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 18:05:58,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:05:58,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:58,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2018-11-14 18:05:58,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:58,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2018-11-14 18:05:58,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 137 transitions. [2018-11-14 18:05:58,764 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:58,846 INFO L225 Difference]: With dead ends: 1469 [2018-11-14 18:05:58,847 INFO L226 Difference]: Without dead ends: 1467 [2018-11-14 18:05:58,847 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:05:58,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2018-11-14 18:05:59,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1193. [2018-11-14 18:05:59,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:05:59,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1467 states. Second operand 1193 states. [2018-11-14 18:05:59,760 INFO L74 IsIncluded]: Start isIncluded. First operand 1467 states. Second operand 1193 states. [2018-11-14 18:05:59,760 INFO L87 Difference]: Start difference. First operand 1467 states. Second operand 1193 states. [2018-11-14 18:05:59,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:59,836 INFO L93 Difference]: Finished difference Result 1467 states and 2408 transitions. [2018-11-14 18:05:59,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2408 transitions. [2018-11-14 18:05:59,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:59,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:59,838 INFO L74 IsIncluded]: Start isIncluded. First operand 1193 states. Second operand 1467 states. [2018-11-14 18:05:59,838 INFO L87 Difference]: Start difference. First operand 1193 states. Second operand 1467 states. [2018-11-14 18:05:59,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:59,919 INFO L93 Difference]: Finished difference Result 1467 states and 2408 transitions. [2018-11-14 18:05:59,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2408 transitions. [2018-11-14 18:05:59,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:59,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:59,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:05:59,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:05:59,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1193 states. [2018-11-14 18:05:59,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1911 transitions. [2018-11-14 18:05:59,973 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1911 transitions. Word has length 27 [2018-11-14 18:05:59,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:05:59,974 INFO L480 AbstractCegarLoop]: Abstraction has 1193 states and 1911 transitions. [2018-11-14 18:05:59,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:05:59,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1911 transitions. [2018-11-14 18:05:59,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 18:05:59,975 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:05:59,975 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:05:59,975 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:05:59,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:05:59,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1994094676, now seen corresponding path program 1 times [2018-11-14 18:05:59,976 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:05:59,976 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:05:59,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:00,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:00,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:00,076 INFO L256 TraceCheckUtils]: 0: Hoare triple {27755#true} call ULTIMATE.init(); {27755#true} is VALID [2018-11-14 18:06:00,077 INFO L273 TraceCheckUtils]: 1: Hoare triple {27755#true} assume true; {27755#true} is VALID [2018-11-14 18:06:00,077 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {27755#true} {27755#true} #232#return; {27755#true} is VALID [2018-11-14 18:06:00,077 INFO L256 TraceCheckUtils]: 3: Hoare triple {27755#true} call #t~ret13 := main(); {27755#true} is VALID [2018-11-14 18:06:00,077 INFO L273 TraceCheckUtils]: 4: Hoare triple {27755#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;havoc ~cond~0; {27755#true} is VALID [2018-11-14 18:06:00,078 INFO L273 TraceCheckUtils]: 5: Hoare triple {27755#true} assume true; {27755#true} is VALID [2018-11-14 18:06:00,078 INFO L273 TraceCheckUtils]: 6: Hoare triple {27755#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {27755#true} is VALID [2018-11-14 18:06:00,078 INFO L273 TraceCheckUtils]: 7: Hoare triple {27755#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; {27755#true} is VALID [2018-11-14 18:06:00,078 INFO L273 TraceCheckUtils]: 8: Hoare triple {27755#true} assume !(~p1~0 != 0bv32); {27755#true} is VALID [2018-11-14 18:06:00,079 INFO L273 TraceCheckUtils]: 9: Hoare triple {27755#true} assume !(~p2~0 != 0bv32); {27755#true} is VALID [2018-11-14 18:06:00,079 INFO L273 TraceCheckUtils]: 10: Hoare triple {27755#true} assume !(~p3~0 != 0bv32); {27755#true} is VALID [2018-11-14 18:06:00,079 INFO L273 TraceCheckUtils]: 11: Hoare triple {27755#true} assume !(~p4~0 != 0bv32); {27755#true} is VALID [2018-11-14 18:06:00,080 INFO L273 TraceCheckUtils]: 12: Hoare triple {27755#true} assume !(~p5~0 != 0bv32); {27755#true} is VALID [2018-11-14 18:06:00,083 INFO L273 TraceCheckUtils]: 13: Hoare triple {27755#true} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {27799#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:00,085 INFO L273 TraceCheckUtils]: 14: Hoare triple {27799#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {27799#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:00,085 INFO L273 TraceCheckUtils]: 15: Hoare triple {27799#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {27799#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:00,088 INFO L273 TraceCheckUtils]: 16: Hoare triple {27799#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {27799#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:00,088 INFO L273 TraceCheckUtils]: 17: Hoare triple {27799#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {27799#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:00,091 INFO L273 TraceCheckUtils]: 18: Hoare triple {27799#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {27799#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:00,091 INFO L273 TraceCheckUtils]: 19: Hoare triple {27799#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {27799#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:00,094 INFO L273 TraceCheckUtils]: 20: Hoare triple {27799#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {27799#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:00,094 INFO L273 TraceCheckUtils]: 21: Hoare triple {27799#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {27799#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:00,097 INFO L273 TraceCheckUtils]: 22: Hoare triple {27799#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p3~0 != 0bv32); {27799#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:00,097 INFO L273 TraceCheckUtils]: 23: Hoare triple {27799#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p4~0 != 0bv32); {27799#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:00,097 INFO L273 TraceCheckUtils]: 24: Hoare triple {27799#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {27799#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:00,098 INFO L273 TraceCheckUtils]: 25: Hoare triple {27799#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32; {27799#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:00,098 INFO L273 TraceCheckUtils]: 26: Hoare triple {27799#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk6~0 != 1bv32; {27756#false} is VALID [2018-11-14 18:06:00,098 INFO L273 TraceCheckUtils]: 27: Hoare triple {27756#false} assume !false; {27756#false} is VALID [2018-11-14 18:06:00,099 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,099 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:00,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:00,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:00,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-14 18:06:00,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:00,104 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:00,130 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:00,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:00,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:00,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:00,131 INFO L87 Difference]: Start difference. First operand 1193 states and 1911 transitions. Second operand 3 states. [2018-11-14 18:06:01,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:01,114 INFO L93 Difference]: Finished difference Result 2173 states and 3545 transitions. [2018-11-14 18:06:01,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:01,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-14 18:06:01,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:01,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:01,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2018-11-14 18:06:01,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:01,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2018-11-14 18:06:01,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 136 transitions. [2018-11-14 18:06:01,265 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:01,463 INFO L225 Difference]: With dead ends: 2173 [2018-11-14 18:06:01,463 INFO L226 Difference]: Without dead ends: 2171 [2018-11-14 18:06:01,464 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:01,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2171 states. [2018-11-14 18:06:02,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2171 to 1689. [2018-11-14 18:06:02,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:02,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2171 states. Second operand 1689 states. [2018-11-14 18:06:02,133 INFO L74 IsIncluded]: Start isIncluded. First operand 2171 states. Second operand 1689 states. [2018-11-14 18:06:02,133 INFO L87 Difference]: Start difference. First operand 2171 states. Second operand 1689 states. [2018-11-14 18:06:02,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:02,283 INFO L93 Difference]: Finished difference Result 2171 states and 3512 transitions. [2018-11-14 18:06:02,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 3512 transitions. [2018-11-14 18:06:02,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:02,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:02,285 INFO L74 IsIncluded]: Start isIncluded. First operand 1689 states. Second operand 2171 states. [2018-11-14 18:06:02,285 INFO L87 Difference]: Start difference. First operand 1689 states. Second operand 2171 states. [2018-11-14 18:06:02,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:02,450 INFO L93 Difference]: Finished difference Result 2171 states and 3512 transitions. [2018-11-14 18:06:02,450 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 3512 transitions. [2018-11-14 18:06:02,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:02,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:02,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:02,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:02,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1689 states. [2018-11-14 18:06:02,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1689 states and 2647 transitions. [2018-11-14 18:06:02,543 INFO L78 Accepts]: Start accepts. Automaton has 1689 states and 2647 transitions. Word has length 28 [2018-11-14 18:06:02,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:02,543 INFO L480 AbstractCegarLoop]: Abstraction has 1689 states and 2647 transitions. [2018-11-14 18:06:02,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:02,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 2647 transitions. [2018-11-14 18:06:02,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 18:06:02,545 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:02,546 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:02,546 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:02,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:02,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1021008942, now seen corresponding path program 1 times [2018-11-14 18:06:02,546 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:02,546 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:02,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:02,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:02,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:02,664 INFO L256 TraceCheckUtils]: 0: Hoare triple {36155#true} call ULTIMATE.init(); {36155#true} is VALID [2018-11-14 18:06:02,664 INFO L273 TraceCheckUtils]: 1: Hoare triple {36155#true} assume true; {36155#true} is VALID [2018-11-14 18:06:02,665 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {36155#true} {36155#true} #232#return; {36155#true} is VALID [2018-11-14 18:06:02,665 INFO L256 TraceCheckUtils]: 3: Hoare triple {36155#true} call #t~ret13 := main(); {36155#true} is VALID [2018-11-14 18:06:02,665 INFO L273 TraceCheckUtils]: 4: Hoare triple {36155#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;havoc ~cond~0; {36155#true} is VALID [2018-11-14 18:06:02,665 INFO L273 TraceCheckUtils]: 5: Hoare triple {36155#true} assume true; {36155#true} is VALID [2018-11-14 18:06:02,665 INFO L273 TraceCheckUtils]: 6: Hoare triple {36155#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {36155#true} is VALID [2018-11-14 18:06:02,666 INFO L273 TraceCheckUtils]: 7: Hoare triple {36155#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; {36155#true} is VALID [2018-11-14 18:06:02,666 INFO L273 TraceCheckUtils]: 8: Hoare triple {36155#true} assume !(~p1~0 != 0bv32); {36155#true} is VALID [2018-11-14 18:06:02,666 INFO L273 TraceCheckUtils]: 9: Hoare triple {36155#true} assume !(~p2~0 != 0bv32); {36155#true} is VALID [2018-11-14 18:06:02,666 INFO L273 TraceCheckUtils]: 10: Hoare triple {36155#true} assume !(~p3~0 != 0bv32); {36155#true} is VALID [2018-11-14 18:06:02,666 INFO L273 TraceCheckUtils]: 11: Hoare triple {36155#true} assume !(~p4~0 != 0bv32); {36155#true} is VALID [2018-11-14 18:06:02,667 INFO L273 TraceCheckUtils]: 12: Hoare triple {36155#true} assume !(~p5~0 != 0bv32); {36155#true} is VALID [2018-11-14 18:06:02,668 INFO L273 TraceCheckUtils]: 13: Hoare triple {36155#true} assume !(~p6~0 != 0bv32); {36199#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:06:02,669 INFO L273 TraceCheckUtils]: 14: Hoare triple {36199#(= (_ bv0 32) main_~p6~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {36199#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:06:02,669 INFO L273 TraceCheckUtils]: 15: Hoare triple {36199#(= (_ bv0 32) main_~p6~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {36199#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:06:02,671 INFO L273 TraceCheckUtils]: 16: Hoare triple {36199#(= (_ bv0 32) main_~p6~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {36199#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:06:02,671 INFO L273 TraceCheckUtils]: 17: Hoare triple {36199#(= (_ bv0 32) main_~p6~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {36199#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:06:02,671 INFO L273 TraceCheckUtils]: 18: Hoare triple {36199#(= (_ bv0 32) main_~p6~0)} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {36199#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:06:02,672 INFO L273 TraceCheckUtils]: 19: Hoare triple {36199#(= (_ bv0 32) main_~p6~0)} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {36199#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:06:02,672 INFO L273 TraceCheckUtils]: 20: Hoare triple {36199#(= (_ bv0 32) main_~p6~0)} assume !(~p1~0 != 0bv32); {36199#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:06:02,673 INFO L273 TraceCheckUtils]: 21: Hoare triple {36199#(= (_ bv0 32) main_~p6~0)} assume !(~p2~0 != 0bv32); {36199#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:06:02,673 INFO L273 TraceCheckUtils]: 22: Hoare triple {36199#(= (_ bv0 32) main_~p6~0)} assume !(~p3~0 != 0bv32); {36199#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:06:02,673 INFO L273 TraceCheckUtils]: 23: Hoare triple {36199#(= (_ bv0 32) main_~p6~0)} assume !(~p4~0 != 0bv32); {36199#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:06:02,674 INFO L273 TraceCheckUtils]: 24: Hoare triple {36199#(= (_ bv0 32) main_~p6~0)} assume !(~p5~0 != 0bv32); {36199#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:06:02,674 INFO L273 TraceCheckUtils]: 25: Hoare triple {36199#(= (_ bv0 32) main_~p6~0)} assume ~p6~0 != 0bv32; {36156#false} is VALID [2018-11-14 18:06:02,674 INFO L273 TraceCheckUtils]: 26: Hoare triple {36156#false} assume ~lk6~0 != 1bv32; {36156#false} is VALID [2018-11-14 18:06:02,674 INFO L273 TraceCheckUtils]: 27: Hoare triple {36156#false} assume !false; {36156#false} is VALID [2018-11-14 18:06:02,675 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,676 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:02,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:02,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:02,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-14 18:06:02,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:02,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:02,703 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:02,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:02,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:02,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:02,704 INFO L87 Difference]: Start difference. First operand 1689 states and 2647 transitions. Second operand 3 states. [2018-11-14 18:06:04,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:04,116 INFO L93 Difference]: Finished difference Result 3997 states and 6297 transitions. [2018-11-14 18:06:04,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:04,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-14 18:06:04,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:04,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:04,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 215 transitions. [2018-11-14 18:06:04,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:04,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 215 transitions. [2018-11-14 18:06:04,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 215 transitions. [2018-11-14 18:06:04,340 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 215 edges. 215 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:04,577 INFO L225 Difference]: With dead ends: 3997 [2018-11-14 18:06:04,577 INFO L226 Difference]: Without dead ends: 2331 [2018-11-14 18:06:04,581 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:04,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2331 states. [2018-11-14 18:06:05,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2331 to 2329. [2018-11-14 18:06:05,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:05,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2331 states. Second operand 2329 states. [2018-11-14 18:06:05,458 INFO L74 IsIncluded]: Start isIncluded. First operand 2331 states. Second operand 2329 states. [2018-11-14 18:06:05,458 INFO L87 Difference]: Start difference. First operand 2331 states. Second operand 2329 states. [2018-11-14 18:06:05,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:05,614 INFO L93 Difference]: Finished difference Result 2331 states and 3624 transitions. [2018-11-14 18:06:05,614 INFO L276 IsEmpty]: Start isEmpty. Operand 2331 states and 3624 transitions. [2018-11-14 18:06:05,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:05,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:05,655 INFO L74 IsIncluded]: Start isIncluded. First operand 2329 states. Second operand 2331 states. [2018-11-14 18:06:05,655 INFO L87 Difference]: Start difference. First operand 2329 states. Second operand 2331 states. [2018-11-14 18:06:05,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:05,810 INFO L93 Difference]: Finished difference Result 2331 states and 3624 transitions. [2018-11-14 18:06:05,810 INFO L276 IsEmpty]: Start isEmpty. Operand 2331 states and 3624 transitions. [2018-11-14 18:06:05,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:05,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:05,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:05,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:05,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2329 states. [2018-11-14 18:06:06,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2329 states to 2329 states and 3623 transitions. [2018-11-14 18:06:06,019 INFO L78 Accepts]: Start accepts. Automaton has 2329 states and 3623 transitions. Word has length 28 [2018-11-14 18:06:06,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:06,019 INFO L480 AbstractCegarLoop]: Abstraction has 2329 states and 3623 transitions. [2018-11-14 18:06:06,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:06,019 INFO L276 IsEmpty]: Start isEmpty. Operand 2329 states and 3623 transitions. [2018-11-14 18:06:06,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 18:06:06,020 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:06,021 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:06,021 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:06,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:06,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1687178374, now seen corresponding path program 1 times [2018-11-14 18:06:06,022 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:06,023 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:06,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:06,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:06,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:06,272 INFO L256 TraceCheckUtils]: 0: Hoare triple {47403#true} call ULTIMATE.init(); {47403#true} is VALID [2018-11-14 18:06:06,273 INFO L273 TraceCheckUtils]: 1: Hoare triple {47403#true} assume true; {47403#true} is VALID [2018-11-14 18:06:06,273 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {47403#true} {47403#true} #232#return; {47403#true} is VALID [2018-11-14 18:06:06,273 INFO L256 TraceCheckUtils]: 3: Hoare triple {47403#true} call #t~ret13 := main(); {47403#true} is VALID [2018-11-14 18:06:06,273 INFO L273 TraceCheckUtils]: 4: Hoare triple {47403#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;havoc ~cond~0; {47403#true} is VALID [2018-11-14 18:06:06,274 INFO L273 TraceCheckUtils]: 5: Hoare triple {47403#true} assume true; {47403#true} is VALID [2018-11-14 18:06:06,274 INFO L273 TraceCheckUtils]: 6: Hoare triple {47403#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {47403#true} is VALID [2018-11-14 18:06:06,274 INFO L273 TraceCheckUtils]: 7: Hoare triple {47403#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; {47403#true} is VALID [2018-11-14 18:06:06,274 INFO L273 TraceCheckUtils]: 8: Hoare triple {47403#true} assume !(~p1~0 != 0bv32); {47403#true} is VALID [2018-11-14 18:06:06,274 INFO L273 TraceCheckUtils]: 9: Hoare triple {47403#true} assume !(~p2~0 != 0bv32); {47403#true} is VALID [2018-11-14 18:06:06,275 INFO L273 TraceCheckUtils]: 10: Hoare triple {47403#true} assume !(~p3~0 != 0bv32); {47403#true} is VALID [2018-11-14 18:06:06,275 INFO L273 TraceCheckUtils]: 11: Hoare triple {47403#true} assume !(~p4~0 != 0bv32); {47403#true} is VALID [2018-11-14 18:06:06,275 INFO L273 TraceCheckUtils]: 12: Hoare triple {47403#true} assume !(~p5~0 != 0bv32); {47403#true} is VALID [2018-11-14 18:06:06,276 INFO L273 TraceCheckUtils]: 13: Hoare triple {47403#true} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {47447#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:06:06,276 INFO L273 TraceCheckUtils]: 14: Hoare triple {47447#(not (= (_ bv0 32) main_~p6~0))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {47447#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:06:06,276 INFO L273 TraceCheckUtils]: 15: Hoare triple {47447#(not (= (_ bv0 32) main_~p6~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {47447#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:06:06,277 INFO L273 TraceCheckUtils]: 16: Hoare triple {47447#(not (= (_ bv0 32) main_~p6~0))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {47447#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:06:06,277 INFO L273 TraceCheckUtils]: 17: Hoare triple {47447#(not (= (_ bv0 32) main_~p6~0))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {47447#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:06:06,277 INFO L273 TraceCheckUtils]: 18: Hoare triple {47447#(not (= (_ bv0 32) main_~p6~0))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {47447#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:06:06,278 INFO L273 TraceCheckUtils]: 19: Hoare triple {47447#(not (= (_ bv0 32) main_~p6~0))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {47447#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:06:06,278 INFO L273 TraceCheckUtils]: 20: Hoare triple {47447#(not (= (_ bv0 32) main_~p6~0))} assume !(~p1~0 != 0bv32); {47447#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:06:06,279 INFO L273 TraceCheckUtils]: 21: Hoare triple {47447#(not (= (_ bv0 32) main_~p6~0))} assume !(~p2~0 != 0bv32); {47447#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:06:06,279 INFO L273 TraceCheckUtils]: 22: Hoare triple {47447#(not (= (_ bv0 32) main_~p6~0))} assume !(~p3~0 != 0bv32); {47447#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:06:06,280 INFO L273 TraceCheckUtils]: 23: Hoare triple {47447#(not (= (_ bv0 32) main_~p6~0))} assume !(~p4~0 != 0bv32); {47447#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:06:06,280 INFO L273 TraceCheckUtils]: 24: Hoare triple {47447#(not (= (_ bv0 32) main_~p6~0))} assume !(~p5~0 != 0bv32); {47447#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:06:06,281 INFO L273 TraceCheckUtils]: 25: Hoare triple {47447#(not (= (_ bv0 32) main_~p6~0))} assume !(~p6~0 != 0bv32); {47404#false} is VALID [2018-11-14 18:06:06,281 INFO L273 TraceCheckUtils]: 26: Hoare triple {47404#false} assume ~p7~0 != 0bv32; {47404#false} is VALID [2018-11-14 18:06:06,282 INFO L273 TraceCheckUtils]: 27: Hoare triple {47404#false} assume ~lk7~0 != 1bv32; {47404#false} is VALID [2018-11-14 18:06:06,282 INFO L273 TraceCheckUtils]: 28: Hoare triple {47404#false} assume !false; {47404#false} is VALID [2018-11-14 18:06:06,283 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,283 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:06,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:06,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:06,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-14 18:06:06,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:06,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:06,311 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:06,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:06,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:06,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:06,312 INFO L87 Difference]: Start difference. First operand 2329 states and 3623 transitions. Second operand 3 states. [2018-11-14 18:06:07,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:07,719 INFO L93 Difference]: Finished difference Result 3517 states and 5465 transitions. [2018-11-14 18:06:07,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:07,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-14 18:06:07,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:07,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:07,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 210 transitions. [2018-11-14 18:06:07,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:07,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 210 transitions. [2018-11-14 18:06:07,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 210 transitions. [2018-11-14 18:06:07,935 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:08,155 INFO L225 Difference]: With dead ends: 3517 [2018-11-14 18:06:08,155 INFO L226 Difference]: Without dead ends: 2379 [2018-11-14 18:06:08,157 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:08,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2379 states. [2018-11-14 18:06:08,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2379 to 2377. [2018-11-14 18:06:08,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:08,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2379 states. Second operand 2377 states. [2018-11-14 18:06:08,996 INFO L74 IsIncluded]: Start isIncluded. First operand 2379 states. Second operand 2377 states. [2018-11-14 18:06:08,996 INFO L87 Difference]: Start difference. First operand 2379 states. Second operand 2377 states. [2018-11-14 18:06:09,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:09,209 INFO L93 Difference]: Finished difference Result 2379 states and 3656 transitions. [2018-11-14 18:06:09,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 3656 transitions. [2018-11-14 18:06:09,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:09,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:09,212 INFO L74 IsIncluded]: Start isIncluded. First operand 2377 states. Second operand 2379 states. [2018-11-14 18:06:09,212 INFO L87 Difference]: Start difference. First operand 2377 states. Second operand 2379 states. [2018-11-14 18:06:09,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:09,381 INFO L93 Difference]: Finished difference Result 2379 states and 3656 transitions. [2018-11-14 18:06:09,381 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 3656 transitions. [2018-11-14 18:06:09,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:09,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:09,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:09,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:09,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2377 states. [2018-11-14 18:06:09,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 3655 transitions. [2018-11-14 18:06:09,549 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 3655 transitions. Word has length 29 [2018-11-14 18:06:09,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:09,549 INFO L480 AbstractCegarLoop]: Abstraction has 2377 states and 3655 transitions. [2018-11-14 18:06:09,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:09,549 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 3655 transitions. [2018-11-14 18:06:09,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 18:06:09,551 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:09,551 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:09,551 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:09,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:09,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1586720568, now seen corresponding path program 1 times [2018-11-14 18:06:09,552 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:09,552 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:09,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:09,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:09,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:09,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:09,650 INFO L256 TraceCheckUtils]: 0: Hoare triple {58318#true} call ULTIMATE.init(); {58318#true} is VALID [2018-11-14 18:06:09,651 INFO L273 TraceCheckUtils]: 1: Hoare triple {58318#true} assume true; {58318#true} is VALID [2018-11-14 18:06:09,651 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {58318#true} {58318#true} #232#return; {58318#true} is VALID [2018-11-14 18:06:09,651 INFO L256 TraceCheckUtils]: 3: Hoare triple {58318#true} call #t~ret13 := main(); {58318#true} is VALID [2018-11-14 18:06:09,651 INFO L273 TraceCheckUtils]: 4: Hoare triple {58318#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;havoc ~cond~0; {58318#true} is VALID [2018-11-14 18:06:09,652 INFO L273 TraceCheckUtils]: 5: Hoare triple {58318#true} assume true; {58318#true} is VALID [2018-11-14 18:06:09,652 INFO L273 TraceCheckUtils]: 6: Hoare triple {58318#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {58318#true} is VALID [2018-11-14 18:06:09,652 INFO L273 TraceCheckUtils]: 7: Hoare triple {58318#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; {58318#true} is VALID [2018-11-14 18:06:09,652 INFO L273 TraceCheckUtils]: 8: Hoare triple {58318#true} assume !(~p1~0 != 0bv32); {58318#true} is VALID [2018-11-14 18:06:09,653 INFO L273 TraceCheckUtils]: 9: Hoare triple {58318#true} assume !(~p2~0 != 0bv32); {58318#true} is VALID [2018-11-14 18:06:09,653 INFO L273 TraceCheckUtils]: 10: Hoare triple {58318#true} assume !(~p3~0 != 0bv32); {58318#true} is VALID [2018-11-14 18:06:09,653 INFO L273 TraceCheckUtils]: 11: Hoare triple {58318#true} assume !(~p4~0 != 0bv32); {58318#true} is VALID [2018-11-14 18:06:09,653 INFO L273 TraceCheckUtils]: 12: Hoare triple {58318#true} assume !(~p5~0 != 0bv32); {58318#true} is VALID [2018-11-14 18:06:09,653 INFO L273 TraceCheckUtils]: 13: Hoare triple {58318#true} assume !(~p6~0 != 0bv32); {58318#true} is VALID [2018-11-14 18:06:09,654 INFO L273 TraceCheckUtils]: 14: Hoare triple {58318#true} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {58365#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:09,656 INFO L273 TraceCheckUtils]: 15: Hoare triple {58365#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {58365#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:09,656 INFO L273 TraceCheckUtils]: 16: Hoare triple {58365#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {58365#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:09,658 INFO L273 TraceCheckUtils]: 17: Hoare triple {58365#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {58365#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:09,658 INFO L273 TraceCheckUtils]: 18: Hoare triple {58365#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {58365#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:09,660 INFO L273 TraceCheckUtils]: 19: Hoare triple {58365#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {58365#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:09,660 INFO L273 TraceCheckUtils]: 20: Hoare triple {58365#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {58365#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:09,662 INFO L273 TraceCheckUtils]: 21: Hoare triple {58365#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {58365#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:09,662 INFO L273 TraceCheckUtils]: 22: Hoare triple {58365#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p3~0 != 0bv32); {58365#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:09,664 INFO L273 TraceCheckUtils]: 23: Hoare triple {58365#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p4~0 != 0bv32); {58365#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:09,664 INFO L273 TraceCheckUtils]: 24: Hoare triple {58365#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {58365#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:09,666 INFO L273 TraceCheckUtils]: 25: Hoare triple {58365#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p6~0 != 0bv32); {58365#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:09,666 INFO L273 TraceCheckUtils]: 26: Hoare triple {58365#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32; {58365#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:09,666 INFO L273 TraceCheckUtils]: 27: Hoare triple {58365#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk7~0 != 1bv32; {58319#false} is VALID [2018-11-14 18:06:09,667 INFO L273 TraceCheckUtils]: 28: Hoare triple {58319#false} assume !false; {58319#false} is VALID [2018-11-14 18:06:09,667 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:09,668 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:09,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:09,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:09,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-14 18:06:09,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:09,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:09,708 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:09,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:09,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:09,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:09,709 INFO L87 Difference]: Start difference. First operand 2377 states and 3655 transitions. Second operand 3 states. [2018-11-14 18:06:11,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:11,550 INFO L93 Difference]: Finished difference Result 4237 states and 6633 transitions. [2018-11-14 18:06:11,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:11,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-14 18:06:11,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:11,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:11,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2018-11-14 18:06:11,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:11,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2018-11-14 18:06:11,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 132 transitions. [2018-11-14 18:06:11,692 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:12,361 INFO L225 Difference]: With dead ends: 4237 [2018-11-14 18:06:12,361 INFO L226 Difference]: Without dead ends: 4235 [2018-11-14 18:06:12,362 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:12,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4235 states. [2018-11-14 18:06:13,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4235 to 3401. [2018-11-14 18:06:13,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:13,270 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4235 states. Second operand 3401 states. [2018-11-14 18:06:13,270 INFO L74 IsIncluded]: Start isIncluded. First operand 4235 states. Second operand 3401 states. [2018-11-14 18:06:13,270 INFO L87 Difference]: Start difference. First operand 4235 states. Second operand 3401 states. [2018-11-14 18:06:13,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:13,916 INFO L93 Difference]: Finished difference Result 4235 states and 6568 transitions. [2018-11-14 18:06:13,916 INFO L276 IsEmpty]: Start isEmpty. Operand 4235 states and 6568 transitions. [2018-11-14 18:06:13,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:13,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:13,920 INFO L74 IsIncluded]: Start isIncluded. First operand 3401 states. Second operand 4235 states. [2018-11-14 18:06:13,920 INFO L87 Difference]: Start difference. First operand 3401 states. Second operand 4235 states. [2018-11-14 18:06:14,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:14,475 INFO L93 Difference]: Finished difference Result 4235 states and 6568 transitions. [2018-11-14 18:06:14,475 INFO L276 IsEmpty]: Start isEmpty. Operand 4235 states and 6568 transitions. [2018-11-14 18:06:14,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:14,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:14,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:14,479 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:14,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3401 states. [2018-11-14 18:06:14,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3401 states to 3401 states and 5095 transitions. [2018-11-14 18:06:14,850 INFO L78 Accepts]: Start accepts. Automaton has 3401 states and 5095 transitions. Word has length 29 [2018-11-14 18:06:14,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:14,850 INFO L480 AbstractCegarLoop]: Abstraction has 3401 states and 5095 transitions. [2018-11-14 18:06:14,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:14,850 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 5095 transitions. [2018-11-14 18:06:14,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 18:06:14,852 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:14,852 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:14,853 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:14,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:14,853 INFO L82 PathProgramCache]: Analyzing trace with hash 306856890, now seen corresponding path program 1 times [2018-11-14 18:06:14,853 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:14,853 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:14,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:14,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:14,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:14,941 INFO L256 TraceCheckUtils]: 0: Hoare triple {74721#true} call ULTIMATE.init(); {74721#true} is VALID [2018-11-14 18:06:14,941 INFO L273 TraceCheckUtils]: 1: Hoare triple {74721#true} assume true; {74721#true} is VALID [2018-11-14 18:06:14,942 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {74721#true} {74721#true} #232#return; {74721#true} is VALID [2018-11-14 18:06:14,942 INFO L256 TraceCheckUtils]: 3: Hoare triple {74721#true} call #t~ret13 := main(); {74721#true} is VALID [2018-11-14 18:06:14,942 INFO L273 TraceCheckUtils]: 4: Hoare triple {74721#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;havoc ~cond~0; {74721#true} is VALID [2018-11-14 18:06:14,942 INFO L273 TraceCheckUtils]: 5: Hoare triple {74721#true} assume true; {74721#true} is VALID [2018-11-14 18:06:14,943 INFO L273 TraceCheckUtils]: 6: Hoare triple {74721#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {74721#true} is VALID [2018-11-14 18:06:14,943 INFO L273 TraceCheckUtils]: 7: Hoare triple {74721#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; {74721#true} is VALID [2018-11-14 18:06:14,943 INFO L273 TraceCheckUtils]: 8: Hoare triple {74721#true} assume !(~p1~0 != 0bv32); {74721#true} is VALID [2018-11-14 18:06:14,943 INFO L273 TraceCheckUtils]: 9: Hoare triple {74721#true} assume !(~p2~0 != 0bv32); {74721#true} is VALID [2018-11-14 18:06:14,944 INFO L273 TraceCheckUtils]: 10: Hoare triple {74721#true} assume !(~p3~0 != 0bv32); {74721#true} is VALID [2018-11-14 18:06:14,944 INFO L273 TraceCheckUtils]: 11: Hoare triple {74721#true} assume !(~p4~0 != 0bv32); {74721#true} is VALID [2018-11-14 18:06:14,944 INFO L273 TraceCheckUtils]: 12: Hoare triple {74721#true} assume !(~p5~0 != 0bv32); {74721#true} is VALID [2018-11-14 18:06:14,944 INFO L273 TraceCheckUtils]: 13: Hoare triple {74721#true} assume !(~p6~0 != 0bv32); {74721#true} is VALID [2018-11-14 18:06:14,946 INFO L273 TraceCheckUtils]: 14: Hoare triple {74721#true} assume !(~p7~0 != 0bv32); {74768#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:06:14,946 INFO L273 TraceCheckUtils]: 15: Hoare triple {74768#(= (_ bv0 32) main_~p7~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {74768#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:06:14,948 INFO L273 TraceCheckUtils]: 16: Hoare triple {74768#(= (_ bv0 32) main_~p7~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {74768#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:06:14,948 INFO L273 TraceCheckUtils]: 17: Hoare triple {74768#(= (_ bv0 32) main_~p7~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {74768#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:06:14,948 INFO L273 TraceCheckUtils]: 18: Hoare triple {74768#(= (_ bv0 32) main_~p7~0)} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {74768#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:06:14,950 INFO L273 TraceCheckUtils]: 19: Hoare triple {74768#(= (_ bv0 32) main_~p7~0)} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {74768#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:06:14,950 INFO L273 TraceCheckUtils]: 20: Hoare triple {74768#(= (_ bv0 32) main_~p7~0)} assume !(~p1~0 != 0bv32); {74768#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:06:14,953 INFO L273 TraceCheckUtils]: 21: Hoare triple {74768#(= (_ bv0 32) main_~p7~0)} assume !(~p2~0 != 0bv32); {74768#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:06:14,953 INFO L273 TraceCheckUtils]: 22: Hoare triple {74768#(= (_ bv0 32) main_~p7~0)} assume !(~p3~0 != 0bv32); {74768#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:06:14,955 INFO L273 TraceCheckUtils]: 23: Hoare triple {74768#(= (_ bv0 32) main_~p7~0)} assume !(~p4~0 != 0bv32); {74768#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:06:14,955 INFO L273 TraceCheckUtils]: 24: Hoare triple {74768#(= (_ bv0 32) main_~p7~0)} assume !(~p5~0 != 0bv32); {74768#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:06:14,957 INFO L273 TraceCheckUtils]: 25: Hoare triple {74768#(= (_ bv0 32) main_~p7~0)} assume !(~p6~0 != 0bv32); {74768#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:06:14,957 INFO L273 TraceCheckUtils]: 26: Hoare triple {74768#(= (_ bv0 32) main_~p7~0)} assume ~p7~0 != 0bv32; {74722#false} is VALID [2018-11-14 18:06:14,957 INFO L273 TraceCheckUtils]: 27: Hoare triple {74722#false} assume ~lk7~0 != 1bv32; {74722#false} is VALID [2018-11-14 18:06:14,957 INFO L273 TraceCheckUtils]: 28: Hoare triple {74722#false} assume !false; {74722#false} is VALID [2018-11-14 18:06:14,958 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:14,958 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:14,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:14,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:14,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-14 18:06:14,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:14,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:14,989 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:14,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:14,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:14,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:14,990 INFO L87 Difference]: Start difference. First operand 3401 states and 5095 transitions. Second operand 3 states. [2018-11-14 18:06:18,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:18,586 INFO L93 Difference]: Finished difference Result 7949 states and 11945 transitions. [2018-11-14 18:06:18,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:18,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-14 18:06:18,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:18,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:18,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 212 transitions. [2018-11-14 18:06:18,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:18,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 212 transitions. [2018-11-14 18:06:18,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 212 transitions. [2018-11-14 18:06:18,804 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:19,705 INFO L225 Difference]: With dead ends: 7949 [2018-11-14 18:06:19,705 INFO L226 Difference]: Without dead ends: 4619 [2018-11-14 18:06:19,711 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,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4619 states. [2018-11-14 18:06:20,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4619 to 4617. [2018-11-14 18:06:20,873 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:20,873 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4619 states. Second operand 4617 states. [2018-11-14 18:06:20,873 INFO L74 IsIncluded]: Start isIncluded. First operand 4619 states. Second operand 4617 states. [2018-11-14 18:06:20,873 INFO L87 Difference]: Start difference. First operand 4619 states. Second operand 4617 states. [2018-11-14 18:06:21,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:21,644 INFO L93 Difference]: Finished difference Result 4619 states and 6856 transitions. [2018-11-14 18:06:21,644 INFO L276 IsEmpty]: Start isEmpty. Operand 4619 states and 6856 transitions. [2018-11-14 18:06:21,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:21,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:21,648 INFO L74 IsIncluded]: Start isIncluded. First operand 4617 states. Second operand 4619 states. [2018-11-14 18:06:21,649 INFO L87 Difference]: Start difference. First operand 4617 states. Second operand 4619 states. [2018-11-14 18:06:22,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:22,451 INFO L93 Difference]: Finished difference Result 4619 states and 6856 transitions. [2018-11-14 18:06:22,451 INFO L276 IsEmpty]: Start isEmpty. Operand 4619 states and 6856 transitions. [2018-11-14 18:06:22,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:22,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:22,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:22,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:22,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4617 states. [2018-11-14 18:06:23,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4617 states to 4617 states and 6855 transitions. [2018-11-14 18:06:23,327 INFO L78 Accepts]: Start accepts. Automaton has 4617 states and 6855 transitions. Word has length 29 [2018-11-14 18:06:23,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:23,327 INFO L480 AbstractCegarLoop]: Abstraction has 4617 states and 6855 transitions. [2018-11-14 18:06:23,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:23,327 INFO L276 IsEmpty]: Start isEmpty. Operand 4617 states and 6855 transitions. [2018-11-14 18:06:23,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 18:06:23,330 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:23,330 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:23,330 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:23,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:23,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1943912131, now seen corresponding path program 1 times [2018-11-14 18:06:23,330 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:23,331 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:23,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:23,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:23,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:23,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:23,425 INFO L256 TraceCheckUtils]: 0: Hoare triple {96948#true} call ULTIMATE.init(); {96948#true} is VALID [2018-11-14 18:06:23,426 INFO L273 TraceCheckUtils]: 1: Hoare triple {96948#true} assume true; {96948#true} is VALID [2018-11-14 18:06:23,426 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {96948#true} {96948#true} #232#return; {96948#true} is VALID [2018-11-14 18:06:23,426 INFO L256 TraceCheckUtils]: 3: Hoare triple {96948#true} call #t~ret13 := main(); {96948#true} is VALID [2018-11-14 18:06:23,427 INFO L273 TraceCheckUtils]: 4: Hoare triple {96948#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;havoc ~cond~0; {96948#true} is VALID [2018-11-14 18:06:23,427 INFO L273 TraceCheckUtils]: 5: Hoare triple {96948#true} assume true; {96948#true} is VALID [2018-11-14 18:06:23,427 INFO L273 TraceCheckUtils]: 6: Hoare triple {96948#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {96948#true} is VALID [2018-11-14 18:06:23,427 INFO L273 TraceCheckUtils]: 7: Hoare triple {96948#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; {96948#true} is VALID [2018-11-14 18:06:23,428 INFO L273 TraceCheckUtils]: 8: Hoare triple {96948#true} assume !(~p1~0 != 0bv32); {96948#true} is VALID [2018-11-14 18:06:23,428 INFO L273 TraceCheckUtils]: 9: Hoare triple {96948#true} assume !(~p2~0 != 0bv32); {96948#true} is VALID [2018-11-14 18:06:23,428 INFO L273 TraceCheckUtils]: 10: Hoare triple {96948#true} assume !(~p3~0 != 0bv32); {96948#true} is VALID [2018-11-14 18:06:23,428 INFO L273 TraceCheckUtils]: 11: Hoare triple {96948#true} assume !(~p4~0 != 0bv32); {96948#true} is VALID [2018-11-14 18:06:23,428 INFO L273 TraceCheckUtils]: 12: Hoare triple {96948#true} assume !(~p5~0 != 0bv32); {96948#true} is VALID [2018-11-14 18:06:23,428 INFO L273 TraceCheckUtils]: 13: Hoare triple {96948#true} assume !(~p6~0 != 0bv32); {96948#true} is VALID [2018-11-14 18:06:23,429 INFO L273 TraceCheckUtils]: 14: Hoare triple {96948#true} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {96995#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:06:23,429 INFO L273 TraceCheckUtils]: 15: Hoare triple {96995#(not (= (_ bv0 32) main_~p7~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {96995#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:06:23,435 INFO L273 TraceCheckUtils]: 16: Hoare triple {96995#(not (= (_ bv0 32) main_~p7~0))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {96995#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:06:23,439 INFO L273 TraceCheckUtils]: 17: Hoare triple {96995#(not (= (_ bv0 32) main_~p7~0))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {96995#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:06:23,440 INFO L273 TraceCheckUtils]: 18: Hoare triple {96995#(not (= (_ bv0 32) main_~p7~0))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {96995#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:06:23,442 INFO L273 TraceCheckUtils]: 19: Hoare triple {96995#(not (= (_ bv0 32) main_~p7~0))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {96995#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:06:23,442 INFO L273 TraceCheckUtils]: 20: Hoare triple {96995#(not (= (_ bv0 32) main_~p7~0))} assume !(~p1~0 != 0bv32); {96995#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:06:23,445 INFO L273 TraceCheckUtils]: 21: Hoare triple {96995#(not (= (_ bv0 32) main_~p7~0))} assume !(~p2~0 != 0bv32); {96995#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:06:23,445 INFO L273 TraceCheckUtils]: 22: Hoare triple {96995#(not (= (_ bv0 32) main_~p7~0))} assume !(~p3~0 != 0bv32); {96995#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:06:23,445 INFO L273 TraceCheckUtils]: 23: Hoare triple {96995#(not (= (_ bv0 32) main_~p7~0))} assume !(~p4~0 != 0bv32); {96995#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:06:23,446 INFO L273 TraceCheckUtils]: 24: Hoare triple {96995#(not (= (_ bv0 32) main_~p7~0))} assume !(~p5~0 != 0bv32); {96995#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:06:23,446 INFO L273 TraceCheckUtils]: 25: Hoare triple {96995#(not (= (_ bv0 32) main_~p7~0))} assume !(~p6~0 != 0bv32); {96995#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:06:23,446 INFO L273 TraceCheckUtils]: 26: Hoare triple {96995#(not (= (_ bv0 32) main_~p7~0))} assume !(~p7~0 != 0bv32); {96949#false} is VALID [2018-11-14 18:06:23,446 INFO L273 TraceCheckUtils]: 27: Hoare triple {96949#false} assume ~p8~0 != 0bv32; {96949#false} is VALID [2018-11-14 18:06:23,447 INFO L273 TraceCheckUtils]: 28: Hoare triple {96949#false} assume ~lk8~0 != 1bv32; {96949#false} is VALID [2018-11-14 18:06:23,447 INFO L273 TraceCheckUtils]: 29: Hoare triple {96949#false} assume !false; {96949#false} is VALID [2018-11-14 18:06:23,448 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:23,448 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:23,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:23,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:23,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-14 18:06:23,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:23,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:23,478 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:23,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:23,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:23,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:23,479 INFO L87 Difference]: Start difference. First operand 4617 states and 6855 transitions. Second operand 3 states. [2018-11-14 18:06:27,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:27,147 INFO L93 Difference]: Finished difference Result 6925 states and 10249 transitions. [2018-11-14 18:06:27,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:27,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-14 18:06:27,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:27,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:27,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 207 transitions. [2018-11-14 18:06:27,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:27,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 207 transitions. [2018-11-14 18:06:27,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 207 transitions. [2018-11-14 18:06:27,363 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:28,408 INFO L225 Difference]: With dead ends: 6925 [2018-11-14 18:06:28,409 INFO L226 Difference]: Without dead ends: 4683 [2018-11-14 18:06:28,413 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:28,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4683 states. [2018-11-14 18:06:30,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4683 to 4681. [2018-11-14 18:06:30,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:30,296 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4683 states. Second operand 4681 states. [2018-11-14 18:06:30,296 INFO L74 IsIncluded]: Start isIncluded. First operand 4683 states. Second operand 4681 states. [2018-11-14 18:06:30,296 INFO L87 Difference]: Start difference. First operand 4683 states. Second operand 4681 states. [2018-11-14 18:06:31,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:31,106 INFO L93 Difference]: Finished difference Result 4683 states and 6856 transitions. [2018-11-14 18:06:31,106 INFO L276 IsEmpty]: Start isEmpty. Operand 4683 states and 6856 transitions. [2018-11-14 18:06:31,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:31,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:31,111 INFO L74 IsIncluded]: Start isIncluded. First operand 4681 states. Second operand 4683 states. [2018-11-14 18:06:31,111 INFO L87 Difference]: Start difference. First operand 4681 states. Second operand 4683 states. [2018-11-14 18:06:31,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:31,925 INFO L93 Difference]: Finished difference Result 4683 states and 6856 transitions. [2018-11-14 18:06:31,925 INFO L276 IsEmpty]: Start isEmpty. Operand 4683 states and 6856 transitions. [2018-11-14 18:06:31,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:31,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:31,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:31,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:31,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4681 states. [2018-11-14 18:06:32,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4681 states to 4681 states and 6855 transitions. [2018-11-14 18:06:32,783 INFO L78 Accepts]: Start accepts. Automaton has 4681 states and 6855 transitions. Word has length 30 [2018-11-14 18:06:32,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:32,783 INFO L480 AbstractCegarLoop]: Abstraction has 4681 states and 6855 transitions. [2018-11-14 18:06:32,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:32,783 INFO L276 IsEmpty]: Start isEmpty. Operand 4681 states and 6855 transitions. [2018-11-14 18:06:32,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 18:06:32,785 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:32,785 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:32,785 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:32,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:32,786 INFO L82 PathProgramCache]: Analyzing trace with hash 922843777, now seen corresponding path program 1 times [2018-11-14 18:06:32,786 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:32,786 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:32,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:32,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:32,918 INFO L256 TraceCheckUtils]: 0: Hoare triple {118346#true} call ULTIMATE.init(); {118346#true} is VALID [2018-11-14 18:06:32,918 INFO L273 TraceCheckUtils]: 1: Hoare triple {118346#true} assume true; {118346#true} is VALID [2018-11-14 18:06:32,919 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {118346#true} {118346#true} #232#return; {118346#true} is VALID [2018-11-14 18:06:32,919 INFO L256 TraceCheckUtils]: 3: Hoare triple {118346#true} call #t~ret13 := main(); {118346#true} is VALID [2018-11-14 18:06:32,919 INFO L273 TraceCheckUtils]: 4: Hoare triple {118346#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;havoc ~cond~0; {118346#true} is VALID [2018-11-14 18:06:32,919 INFO L273 TraceCheckUtils]: 5: Hoare triple {118346#true} assume true; {118346#true} is VALID [2018-11-14 18:06:32,919 INFO L273 TraceCheckUtils]: 6: Hoare triple {118346#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {118346#true} is VALID [2018-11-14 18:06:32,919 INFO L273 TraceCheckUtils]: 7: Hoare triple {118346#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; {118346#true} is VALID [2018-11-14 18:06:32,919 INFO L273 TraceCheckUtils]: 8: Hoare triple {118346#true} assume !(~p1~0 != 0bv32); {118346#true} is VALID [2018-11-14 18:06:32,920 INFO L273 TraceCheckUtils]: 9: Hoare triple {118346#true} assume !(~p2~0 != 0bv32); {118346#true} is VALID [2018-11-14 18:06:32,920 INFO L273 TraceCheckUtils]: 10: Hoare triple {118346#true} assume !(~p3~0 != 0bv32); {118346#true} is VALID [2018-11-14 18:06:32,920 INFO L273 TraceCheckUtils]: 11: Hoare triple {118346#true} assume !(~p4~0 != 0bv32); {118346#true} is VALID [2018-11-14 18:06:32,920 INFO L273 TraceCheckUtils]: 12: Hoare triple {118346#true} assume !(~p5~0 != 0bv32); {118346#true} is VALID [2018-11-14 18:06:32,920 INFO L273 TraceCheckUtils]: 13: Hoare triple {118346#true} assume !(~p6~0 != 0bv32); {118346#true} is VALID [2018-11-14 18:06:32,920 INFO L273 TraceCheckUtils]: 14: Hoare triple {118346#true} assume !(~p7~0 != 0bv32); {118346#true} is VALID [2018-11-14 18:06:32,921 INFO L273 TraceCheckUtils]: 15: Hoare triple {118346#true} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {118396#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:32,921 INFO L273 TraceCheckUtils]: 16: Hoare triple {118396#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {118396#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:32,923 INFO L273 TraceCheckUtils]: 17: Hoare triple {118396#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {118396#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:32,923 INFO L273 TraceCheckUtils]: 18: Hoare triple {118396#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {118396#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:32,925 INFO L273 TraceCheckUtils]: 19: Hoare triple {118396#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {118396#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:32,925 INFO L273 TraceCheckUtils]: 20: Hoare triple {118396#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {118396#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:32,927 INFO L273 TraceCheckUtils]: 21: Hoare triple {118396#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {118396#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:32,927 INFO L273 TraceCheckUtils]: 22: Hoare triple {118396#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p3~0 != 0bv32); {118396#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:32,929 INFO L273 TraceCheckUtils]: 23: Hoare triple {118396#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p4~0 != 0bv32); {118396#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:32,929 INFO L273 TraceCheckUtils]: 24: Hoare triple {118396#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {118396#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:32,931 INFO L273 TraceCheckUtils]: 25: Hoare triple {118396#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p6~0 != 0bv32); {118396#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:32,931 INFO L273 TraceCheckUtils]: 26: Hoare triple {118396#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p7~0 != 0bv32); {118396#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:32,933 INFO L273 TraceCheckUtils]: 27: Hoare triple {118396#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32; {118396#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:32,933 INFO L273 TraceCheckUtils]: 28: Hoare triple {118396#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk8~0 != 1bv32; {118347#false} is VALID [2018-11-14 18:06:32,933 INFO L273 TraceCheckUtils]: 29: Hoare triple {118347#false} assume !false; {118347#false} is VALID [2018-11-14 18:06:32,934 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:32,934 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:32,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:32,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:32,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-14 18:06:32,936 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:32,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:32,976 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:32,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:32,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:32,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:32,976 INFO L87 Difference]: Start difference. First operand 4681 states and 6855 transitions. Second operand 3 states. [2018-11-14 18:06:38,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:38,317 INFO L93 Difference]: Finished difference Result 8205 states and 12233 transitions. [2018-11-14 18:06:38,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:38,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-14 18:06:38,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:38,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:38,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2018-11-14 18:06:38,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:38,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2018-11-14 18:06:38,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 128 transitions. [2018-11-14 18:06:38,466 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:41,497 INFO L225 Difference]: With dead ends: 8205 [2018-11-14 18:06:41,497 INFO L226 Difference]: Without dead ends: 8203 [2018-11-14 18:06:41,500 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:41,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8203 states. [2018-11-14 18:06:44,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8203 to 6793. [2018-11-14 18:06:44,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:44,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8203 states. Second operand 6793 states. [2018-11-14 18:06:44,012 INFO L74 IsIncluded]: Start isIncluded. First operand 8203 states. Second operand 6793 states. [2018-11-14 18:06:44,013 INFO L87 Difference]: Start difference. First operand 8203 states. Second operand 6793 states. [2018-11-14 18:06:46,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:46,559 INFO L93 Difference]: Finished difference Result 8203 states and 12104 transitions. [2018-11-14 18:06:46,559 INFO L276 IsEmpty]: Start isEmpty. Operand 8203 states and 12104 transitions. [2018-11-14 18:06:46,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:46,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:46,566 INFO L74 IsIncluded]: Start isIncluded. First operand 6793 states. Second operand 8203 states. [2018-11-14 18:06:46,566 INFO L87 Difference]: Start difference. First operand 6793 states. Second operand 8203 states. [2018-11-14 18:06:49,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:49,054 INFO L93 Difference]: Finished difference Result 8203 states and 12104 transitions. [2018-11-14 18:06:49,054 INFO L276 IsEmpty]: Start isEmpty. Operand 8203 states and 12104 transitions. [2018-11-14 18:06:49,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:49,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:49,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:49,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:49,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6793 states. [2018-11-14 18:06:50,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6793 states to 6793 states and 9671 transitions. [2018-11-14 18:06:50,909 INFO L78 Accepts]: Start accepts. Automaton has 6793 states and 9671 transitions. Word has length 30 [2018-11-14 18:06:50,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:50,910 INFO L480 AbstractCegarLoop]: Abstraction has 6793 states and 9671 transitions. [2018-11-14 18:06:50,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:50,910 INFO L276 IsEmpty]: Start isEmpty. Operand 6793 states and 9671 transitions. [2018-11-14 18:06:50,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 18:06:50,913 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:50,913 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:50,913 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:50,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:50,915 INFO L82 PathProgramCache]: Analyzing trace with hash -357019901, now seen corresponding path program 1 times [2018-11-14 18:06:50,916 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:50,916 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:06:50,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:50,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:51,010 INFO L256 TraceCheckUtils]: 0: Hoare triple {150240#true} call ULTIMATE.init(); {150240#true} is VALID [2018-11-14 18:06:51,010 INFO L273 TraceCheckUtils]: 1: Hoare triple {150240#true} assume true; {150240#true} is VALID [2018-11-14 18:06:51,010 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {150240#true} {150240#true} #232#return; {150240#true} is VALID [2018-11-14 18:06:51,011 INFO L256 TraceCheckUtils]: 3: Hoare triple {150240#true} call #t~ret13 := main(); {150240#true} is VALID [2018-11-14 18:06:51,011 INFO L273 TraceCheckUtils]: 4: Hoare triple {150240#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;havoc ~cond~0; {150240#true} is VALID [2018-11-14 18:06:51,011 INFO L273 TraceCheckUtils]: 5: Hoare triple {150240#true} assume true; {150240#true} is VALID [2018-11-14 18:06:51,011 INFO L273 TraceCheckUtils]: 6: Hoare triple {150240#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {150240#true} is VALID [2018-11-14 18:06:51,011 INFO L273 TraceCheckUtils]: 7: Hoare triple {150240#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; {150240#true} is VALID [2018-11-14 18:06:51,011 INFO L273 TraceCheckUtils]: 8: Hoare triple {150240#true} assume !(~p1~0 != 0bv32); {150240#true} is VALID [2018-11-14 18:06:51,011 INFO L273 TraceCheckUtils]: 9: Hoare triple {150240#true} assume !(~p2~0 != 0bv32); {150240#true} is VALID [2018-11-14 18:06:51,011 INFO L273 TraceCheckUtils]: 10: Hoare triple {150240#true} assume !(~p3~0 != 0bv32); {150240#true} is VALID [2018-11-14 18:06:51,012 INFO L273 TraceCheckUtils]: 11: Hoare triple {150240#true} assume !(~p4~0 != 0bv32); {150240#true} is VALID [2018-11-14 18:06:51,012 INFO L273 TraceCheckUtils]: 12: Hoare triple {150240#true} assume !(~p5~0 != 0bv32); {150240#true} is VALID [2018-11-14 18:06:51,012 INFO L273 TraceCheckUtils]: 13: Hoare triple {150240#true} assume !(~p6~0 != 0bv32); {150240#true} is VALID [2018-11-14 18:06:51,012 INFO L273 TraceCheckUtils]: 14: Hoare triple {150240#true} assume !(~p7~0 != 0bv32); {150240#true} is VALID [2018-11-14 18:06:51,013 INFO L273 TraceCheckUtils]: 15: Hoare triple {150240#true} assume !(~p8~0 != 0bv32); {150290#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 18:06:51,013 INFO L273 TraceCheckUtils]: 16: Hoare triple {150290#(= (_ bv0 32) main_~p8~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {150290#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 18:06:51,015 INFO L273 TraceCheckUtils]: 17: Hoare triple {150290#(= (_ bv0 32) main_~p8~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {150290#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 18:06:51,015 INFO L273 TraceCheckUtils]: 18: Hoare triple {150290#(= (_ bv0 32) main_~p8~0)} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {150290#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 18:06:51,015 INFO L273 TraceCheckUtils]: 19: Hoare triple {150290#(= (_ bv0 32) main_~p8~0)} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {150290#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 18:06:51,016 INFO L273 TraceCheckUtils]: 20: Hoare triple {150290#(= (_ bv0 32) main_~p8~0)} assume !(~p1~0 != 0bv32); {150290#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 18:06:51,016 INFO L273 TraceCheckUtils]: 21: Hoare triple {150290#(= (_ bv0 32) main_~p8~0)} assume !(~p2~0 != 0bv32); {150290#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 18:06:51,016 INFO L273 TraceCheckUtils]: 22: Hoare triple {150290#(= (_ bv0 32) main_~p8~0)} assume !(~p3~0 != 0bv32); {150290#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 18:06:51,017 INFO L273 TraceCheckUtils]: 23: Hoare triple {150290#(= (_ bv0 32) main_~p8~0)} assume !(~p4~0 != 0bv32); {150290#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 18:06:51,017 INFO L273 TraceCheckUtils]: 24: Hoare triple {150290#(= (_ bv0 32) main_~p8~0)} assume !(~p5~0 != 0bv32); {150290#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 18:06:51,017 INFO L273 TraceCheckUtils]: 25: Hoare triple {150290#(= (_ bv0 32) main_~p8~0)} assume !(~p6~0 != 0bv32); {150290#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 18:06:51,017 INFO L273 TraceCheckUtils]: 26: Hoare triple {150290#(= (_ bv0 32) main_~p8~0)} assume !(~p7~0 != 0bv32); {150290#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 18:06:51,018 INFO L273 TraceCheckUtils]: 27: Hoare triple {150290#(= (_ bv0 32) main_~p8~0)} assume ~p8~0 != 0bv32; {150241#false} is VALID [2018-11-14 18:06:51,018 INFO L273 TraceCheckUtils]: 28: Hoare triple {150241#false} assume ~lk8~0 != 1bv32; {150241#false} is VALID [2018-11-14 18:06:51,018 INFO L273 TraceCheckUtils]: 29: Hoare triple {150241#false} assume !false; {150241#false} is VALID [2018-11-14 18:06:51,019 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:51,019 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:51,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:51,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:51,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-14 18:06:51,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:51,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:51,050 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:51,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:51,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:51,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:51,052 INFO L87 Difference]: Start difference. First operand 6793 states and 9671 transitions. Second operand 3 states. [2018-11-14 18:07:04,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:07:04,234 INFO L93 Difference]: Finished difference Result 15757 states and 22473 transitions. [2018-11-14 18:07:04,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:07:04,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-14 18:07:04,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:07:04,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:07:04,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2018-11-14 18:07:04,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:07:04,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2018-11-14 18:07:04,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 209 transitions. [2018-11-14 18:07:04,450 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 209 edges. 209 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:07:08,510 INFO L225 Difference]: With dead ends: 15757 [2018-11-14 18:07:08,510 INFO L226 Difference]: Without dead ends: 9099 [2018-11-14 18:07:08,518 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:07:08,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9099 states.