java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:53:39,924 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:53:39,926 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:53:39,938 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:53:39,939 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:53:39,940 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:53:39,941 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:53:39,943 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:53:39,945 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:53:39,946 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:53:39,947 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:53:39,947 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:53:39,948 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:53:39,949 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:53:39,950 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:53:39,951 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:53:39,952 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:53:39,954 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:53:39,956 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:53:39,957 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:53:39,959 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:53:39,960 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:53:39,962 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:53:39,962 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:53:39,963 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:53:39,964 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:53:39,965 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:53:39,966 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:53:39,966 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:53:39,968 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:53:39,968 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:53:39,969 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:53:39,969 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:53:39,969 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:53:39,970 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:53:39,971 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:53:39,971 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 10:53:39,998 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:53:39,999 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:53:40,000 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:53:40,000 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:53:40,000 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:53:40,002 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:53:40,002 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:53:40,003 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:53:40,003 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:53:40,003 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:53:40,003 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:53:40,003 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:53:40,003 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:53:40,004 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:53:40,004 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:53:40,004 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:53:40,005 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:53:40,005 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:53:40,005 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:53:40,005 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:53:40,005 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:53:40,006 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:53:40,006 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:53:40,006 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:53:40,006 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:53:40,006 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:53:40,008 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:53:40,008 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:53:40,008 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:53:40,009 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:53:40,009 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:53:40,009 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:53:40,009 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:53:40,065 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:53:40,077 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:53:40,081 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:53:40,083 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:53:40,083 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:53:40,084 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 10:53:40,147 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fdc93efa/657f946f764a471baa791d5ef584f224/FLAG50634db98 [2018-11-23 10:53:40,615 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:53:40,616 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 10:53:40,632 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fdc93efa/657f946f764a471baa791d5ef584f224/FLAG50634db98 [2018-11-23 10:53:40,963 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fdc93efa/657f946f764a471baa791d5ef584f224 [2018-11-23 10:53:40,973 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:53:40,974 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:53:40,976 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:53:40,976 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:53:40,980 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:53:40,982 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:53:40" (1/1) ... [2018-11-23 10:53:40,985 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d0be90c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:53:40, skipping insertion in model container [2018-11-23 10:53:40,985 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:53:40" (1/1) ... [2018-11-23 10:53:40,996 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:53:41,024 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:53:41,230 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:53:41,237 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:53:41,269 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:53:41,287 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:53:41,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:53:41 WrapperNode [2018-11-23 10:53:41,288 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:53:41,289 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:53:41,289 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:53:41,289 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:53:41,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:53:41" (1/1) ... [2018-11-23 10:53:41,309 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:53:41" (1/1) ... [2018-11-23 10:53:41,317 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:53:41,318 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:53:41,318 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:53:41,318 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:53:41,329 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:53:41" (1/1) ... [2018-11-23 10:53:41,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:53:41" (1/1) ... [2018-11-23 10:53:41,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:53:41" (1/1) ... [2018-11-23 10:53:41,331 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:53:41" (1/1) ... [2018-11-23 10:53:41,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:53:41" (1/1) ... [2018-11-23 10:53:41,361 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:53:41" (1/1) ... [2018-11-23 10:53:41,364 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:53:41" (1/1) ... [2018-11-23 10:53:41,370 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:53:41,374 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:53:41,374 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:53:41,374 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:53:41,375 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:53:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:53:41,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:53:41,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:53:41,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:53:41,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:53:41,505 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:53:41,505 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:53:42,425 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:53:42,425 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 10:53:42,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:53:42 BoogieIcfgContainer [2018-11-23 10:53:42,426 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:53:42,427 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:53:42,428 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:53:42,431 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:53:42,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:53:40" (1/3) ... [2018-11-23 10:53:42,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24384d97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:53:42, skipping insertion in model container [2018-11-23 10:53:42,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:53:41" (2/3) ... [2018-11-23 10:53:42,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24384d97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:53:42, skipping insertion in model container [2018-11-23 10:53:42,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:53:42" (3/3) ... [2018-11-23 10:53:42,435 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 10:53:42,445 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:53:42,457 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:53:42,475 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:53:42,508 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:53:42,509 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:53:42,509 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:53:42,509 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:53:42,511 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:53:42,511 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:53:42,511 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:53:42,512 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:53:42,512 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:53:42,532 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-11-23 10:53:42,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 10:53:42,539 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:53:42,540 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:53:42,542 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:53:42,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:53:42,548 INFO L82 PathProgramCache]: Analyzing trace with hash -917347053, now seen corresponding path program 1 times [2018-11-23 10:53:42,553 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:53:42,554 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:53:42,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:53:42,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:42,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:53:42,911 INFO L256 TraceCheckUtils]: 0: Hoare triple {47#true} call ULTIMATE.init(); {47#true} is VALID [2018-11-23 10:53:42,915 INFO L273 TraceCheckUtils]: 1: Hoare triple {47#true} assume true; {47#true} is VALID [2018-11-23 10:53:42,916 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {47#true} {47#true} #197#return; {47#true} is VALID [2018-11-23 10:53:42,916 INFO L256 TraceCheckUtils]: 3: Hoare triple {47#true} call #t~ret11 := main(); {47#true} is VALID [2018-11-23 10:53:42,917 INFO L273 TraceCheckUtils]: 4: Hoare triple {47#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;havoc ~cond~0; {47#true} is VALID [2018-11-23 10:53:42,917 INFO L273 TraceCheckUtils]: 5: Hoare triple {47#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {47#true} is VALID [2018-11-23 10:53:42,918 INFO L273 TraceCheckUtils]: 6: Hoare triple {47#true} assume !(0bv32 == ~cond~0);~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; {47#true} is VALID [2018-11-23 10:53:42,919 INFO L273 TraceCheckUtils]: 7: Hoare triple {47#true} assume 0bv32 != ~p1~0;~lk1~0 := 1bv32; {73#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:42,921 INFO L273 TraceCheckUtils]: 8: Hoare triple {73#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {73#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:42,922 INFO L273 TraceCheckUtils]: 9: Hoare triple {73#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {73#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:42,927 INFO L273 TraceCheckUtils]: 10: Hoare triple {73#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {73#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:42,928 INFO L273 TraceCheckUtils]: 11: Hoare triple {73#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {73#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:42,930 INFO L273 TraceCheckUtils]: 12: Hoare triple {73#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {73#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:42,933 INFO L273 TraceCheckUtils]: 13: Hoare triple {73#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {73#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:42,933 INFO L273 TraceCheckUtils]: 14: Hoare triple {73#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {73#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:42,936 INFO L273 TraceCheckUtils]: 15: Hoare triple {73#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {73#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:42,936 INFO L273 TraceCheckUtils]: 16: Hoare triple {73#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {73#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:42,939 INFO L273 TraceCheckUtils]: 17: Hoare triple {73#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p1~0; {73#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:42,942 INFO L273 TraceCheckUtils]: 18: Hoare triple {73#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk1~0; {48#false} is VALID [2018-11-23 10:53:42,942 INFO L273 TraceCheckUtils]: 19: Hoare triple {48#false} assume !false; {48#false} is VALID [2018-11-23 10:53:42,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:53:42,953 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:53:42,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:53:42,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:53:42,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 10:53:42,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:53:42,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:53:43,124 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:53:43,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:53:43,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:53:43,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:53:43,138 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2018-11-23 10:53:44,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:44,040 INFO L93 Difference]: Finished difference Result 87 states and 150 transitions. [2018-11-23 10:53:44,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:53:44,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 10:53:44,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:53:44,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:44,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2018-11-23 10:53:44,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:44,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2018-11-23 10:53:44,087 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 150 transitions. [2018-11-23 10:53:44,507 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:53:44,525 INFO L225 Difference]: With dead ends: 87 [2018-11-23 10:53:44,526 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 10:53:44,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:53:44,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 10:53:44,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2018-11-23 10:53:44,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:53:44,575 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 50 states. [2018-11-23 10:53:44,575 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 50 states. [2018-11-23 10:53:44,576 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 50 states. [2018-11-23 10:53:44,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:44,589 INFO L93 Difference]: Finished difference Result 72 states and 128 transitions. [2018-11-23 10:53:44,589 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 128 transitions. [2018-11-23 10:53:44,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:44,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:44,591 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 72 states. [2018-11-23 10:53:44,591 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 72 states. [2018-11-23 10:53:44,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:44,601 INFO L93 Difference]: Finished difference Result 72 states and 128 transitions. [2018-11-23 10:53:44,601 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 128 transitions. [2018-11-23 10:53:44,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:44,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:44,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:53:44,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:53:44,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 10:53:44,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 89 transitions. [2018-11-23 10:53:44,609 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 89 transitions. Word has length 20 [2018-11-23 10:53:44,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:53:44,610 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 89 transitions. [2018-11-23 10:53:44,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:53:44,610 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 89 transitions. [2018-11-23 10:53:44,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 10:53:44,611 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:53:44,612 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:53:44,612 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:53:44,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:53:44,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1504153067, now seen corresponding path program 1 times [2018-11-23 10:53:44,613 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:53:44,613 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:53:44,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:53:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:44,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:53:44,755 INFO L256 TraceCheckUtils]: 0: Hoare triple {408#true} call ULTIMATE.init(); {408#true} is VALID [2018-11-23 10:53:44,755 INFO L273 TraceCheckUtils]: 1: Hoare triple {408#true} assume true; {408#true} is VALID [2018-11-23 10:53:44,756 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {408#true} {408#true} #197#return; {408#true} is VALID [2018-11-23 10:53:44,756 INFO L256 TraceCheckUtils]: 3: Hoare triple {408#true} call #t~ret11 := main(); {408#true} is VALID [2018-11-23 10:53:44,756 INFO L273 TraceCheckUtils]: 4: Hoare triple {408#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;havoc ~cond~0; {408#true} is VALID [2018-11-23 10:53:44,757 INFO L273 TraceCheckUtils]: 5: Hoare triple {408#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {408#true} is VALID [2018-11-23 10:53:44,757 INFO L273 TraceCheckUtils]: 6: Hoare triple {408#true} assume !(0bv32 == ~cond~0);~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; {408#true} is VALID [2018-11-23 10:53:44,758 INFO L273 TraceCheckUtils]: 7: Hoare triple {408#true} assume !(0bv32 != ~p1~0); {434#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:53:44,762 INFO L273 TraceCheckUtils]: 8: Hoare triple {434#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {434#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:53:44,762 INFO L273 TraceCheckUtils]: 9: Hoare triple {434#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {434#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:53:44,768 INFO L273 TraceCheckUtils]: 10: Hoare triple {434#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {434#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:53:44,769 INFO L273 TraceCheckUtils]: 11: Hoare triple {434#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {434#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:53:44,769 INFO L273 TraceCheckUtils]: 12: Hoare triple {434#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {434#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:53:44,770 INFO L273 TraceCheckUtils]: 13: Hoare triple {434#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {434#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:53:44,770 INFO L273 TraceCheckUtils]: 14: Hoare triple {434#(= (_ bv0 32) main_~p1~0)} assume !(0bv32 != ~p8~0); {434#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:53:44,771 INFO L273 TraceCheckUtils]: 15: Hoare triple {434#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {434#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:53:44,772 INFO L273 TraceCheckUtils]: 16: Hoare triple {434#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {434#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:53:44,777 INFO L273 TraceCheckUtils]: 17: Hoare triple {434#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p1~0; {409#false} is VALID [2018-11-23 10:53:44,777 INFO L273 TraceCheckUtils]: 18: Hoare triple {409#false} assume 1bv32 != ~lk1~0; {409#false} is VALID [2018-11-23 10:53:44,778 INFO L273 TraceCheckUtils]: 19: Hoare triple {409#false} assume !false; {409#false} is VALID [2018-11-23 10:53:44,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:53:44,780 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:53:44,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:53:44,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:53:44,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 10:53:44,789 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:53:44,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:53:44,885 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:53:44,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:53:44,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:53:44,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:53:44,886 INFO L87 Difference]: Start difference. First operand 50 states and 89 transitions. Second operand 3 states. [2018-11-23 10:53:45,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:45,205 INFO L93 Difference]: Finished difference Result 117 states and 212 transitions. [2018-11-23 10:53:45,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:53:45,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 10:53:45,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:53:45,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:45,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2018-11-23 10:53:45,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:45,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2018-11-23 10:53:45,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 191 transitions. [2018-11-23 10:53:45,605 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:53:45,609 INFO L225 Difference]: With dead ends: 117 [2018-11-23 10:53:45,610 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 10:53:45,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:53:45,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 10:53:45,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-11-23 10:53:45,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:53:45,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 70 states. [2018-11-23 10:53:45,643 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 70 states. [2018-11-23 10:53:45,644 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 70 states. [2018-11-23 10:53:45,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:45,648 INFO L93 Difference]: Finished difference Result 72 states and 126 transitions. [2018-11-23 10:53:45,649 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 126 transitions. [2018-11-23 10:53:45,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:45,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:45,650 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 72 states. [2018-11-23 10:53:45,650 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 72 states. [2018-11-23 10:53:45,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:45,655 INFO L93 Difference]: Finished difference Result 72 states and 126 transitions. [2018-11-23 10:53:45,655 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 126 transitions. [2018-11-23 10:53:45,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:45,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:45,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:53:45,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:53:45,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 10:53:45,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 125 transitions. [2018-11-23 10:53:45,661 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 125 transitions. Word has length 20 [2018-11-23 10:53:45,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:53:45,661 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 125 transitions. [2018-11-23 10:53:45,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:53:45,661 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 125 transitions. [2018-11-23 10:53:45,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 10:53:45,662 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:53:45,663 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:53:45,663 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:53:45,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:53:45,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1627225809, now seen corresponding path program 1 times [2018-11-23 10:53:45,664 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:53:45,664 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:53:45,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:53:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:45,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:53:45,801 INFO L256 TraceCheckUtils]: 0: Hoare triple {818#true} call ULTIMATE.init(); {818#true} is VALID [2018-11-23 10:53:45,802 INFO L273 TraceCheckUtils]: 1: Hoare triple {818#true} assume true; {818#true} is VALID [2018-11-23 10:53:45,802 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {818#true} {818#true} #197#return; {818#true} is VALID [2018-11-23 10:53:45,803 INFO L256 TraceCheckUtils]: 3: Hoare triple {818#true} call #t~ret11 := main(); {818#true} is VALID [2018-11-23 10:53:45,803 INFO L273 TraceCheckUtils]: 4: Hoare triple {818#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;havoc ~cond~0; {818#true} is VALID [2018-11-23 10:53:45,804 INFO L273 TraceCheckUtils]: 5: Hoare triple {818#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {818#true} is VALID [2018-11-23 10:53:45,804 INFO L273 TraceCheckUtils]: 6: Hoare triple {818#true} assume !(0bv32 == ~cond~0);~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; {818#true} is VALID [2018-11-23 10:53:45,807 INFO L273 TraceCheckUtils]: 7: Hoare triple {818#true} assume 0bv32 != ~p1~0;~lk1~0 := 1bv32; {844#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:53:45,807 INFO L273 TraceCheckUtils]: 8: Hoare triple {844#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {844#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:53:45,809 INFO L273 TraceCheckUtils]: 9: Hoare triple {844#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {844#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:53:45,809 INFO L273 TraceCheckUtils]: 10: Hoare triple {844#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {844#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:53:45,814 INFO L273 TraceCheckUtils]: 11: Hoare triple {844#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {844#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:53:45,816 INFO L273 TraceCheckUtils]: 12: Hoare triple {844#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {844#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:53:45,816 INFO L273 TraceCheckUtils]: 13: Hoare triple {844#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {844#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:53:45,818 INFO L273 TraceCheckUtils]: 14: Hoare triple {844#(not (= (_ bv0 32) main_~p1~0))} assume !(0bv32 != ~p8~0); {844#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:53:45,818 INFO L273 TraceCheckUtils]: 15: Hoare triple {844#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {844#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:53:45,820 INFO L273 TraceCheckUtils]: 16: Hoare triple {844#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {844#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:53:45,824 INFO L273 TraceCheckUtils]: 17: Hoare triple {844#(not (= (_ bv0 32) main_~p1~0))} assume !(0bv32 != ~p1~0); {819#false} is VALID [2018-11-23 10:53:45,824 INFO L273 TraceCheckUtils]: 18: Hoare triple {819#false} assume 0bv32 != ~p2~0; {819#false} is VALID [2018-11-23 10:53:45,824 INFO L273 TraceCheckUtils]: 19: Hoare triple {819#false} assume 1bv32 != ~lk2~0; {819#false} is VALID [2018-11-23 10:53:45,825 INFO L273 TraceCheckUtils]: 20: Hoare triple {819#false} assume !false; {819#false} is VALID [2018-11-23 10:53:45,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:53:45,827 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:53:45,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:53:45,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:53:45,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 10:53:45,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:53:45,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:53:45,874 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:53:45,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:53:45,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:53:45,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:53:45,875 INFO L87 Difference]: Start difference. First operand 70 states and 125 transitions. Second operand 3 states. [2018-11-23 10:53:46,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:46,222 INFO L93 Difference]: Finished difference Result 108 states and 189 transitions. [2018-11-23 10:53:46,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:53:46,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 10:53:46,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:53:46,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:46,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2018-11-23 10:53:46,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:46,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2018-11-23 10:53:46,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 186 transitions. [2018-11-23 10:53:46,540 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:53:46,543 INFO L225 Difference]: With dead ends: 108 [2018-11-23 10:53:46,543 INFO L226 Difference]: Without dead ends: 75 [2018-11-23 10:53:46,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:53:46,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-23 10:53:46,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2018-11-23 10:53:46,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:53:46,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 73 states. [2018-11-23 10:53:46,560 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 73 states. [2018-11-23 10:53:46,561 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 73 states. [2018-11-23 10:53:46,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:46,565 INFO L93 Difference]: Finished difference Result 75 states and 128 transitions. [2018-11-23 10:53:46,566 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 128 transitions. [2018-11-23 10:53:46,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:46,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:46,567 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 75 states. [2018-11-23 10:53:46,567 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 75 states. [2018-11-23 10:53:46,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:46,571 INFO L93 Difference]: Finished difference Result 75 states and 128 transitions. [2018-11-23 10:53:46,571 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 128 transitions. [2018-11-23 10:53:46,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:46,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:46,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:53:46,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:53:46,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-23 10:53:46,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 127 transitions. [2018-11-23 10:53:46,577 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 127 transitions. Word has length 21 [2018-11-23 10:53:46,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:53:46,577 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 127 transitions. [2018-11-23 10:53:46,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:53:46,578 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2018-11-23 10:53:46,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 10:53:46,578 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:53:46,579 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:53:46,579 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:53:46,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:53:46,579 INFO L82 PathProgramCache]: Analyzing trace with hash 616108559, now seen corresponding path program 1 times [2018-11-23 10:53:46,580 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:53:46,580 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:53:46,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:53:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:46,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:53:46,695 INFO L256 TraceCheckUtils]: 0: Hoare triple {1233#true} call ULTIMATE.init(); {1233#true} is VALID [2018-11-23 10:53:46,696 INFO L273 TraceCheckUtils]: 1: Hoare triple {1233#true} assume true; {1233#true} is VALID [2018-11-23 10:53:46,696 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1233#true} {1233#true} #197#return; {1233#true} is VALID [2018-11-23 10:53:46,696 INFO L256 TraceCheckUtils]: 3: Hoare triple {1233#true} call #t~ret11 := main(); {1233#true} is VALID [2018-11-23 10:53:46,697 INFO L273 TraceCheckUtils]: 4: Hoare triple {1233#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;havoc ~cond~0; {1233#true} is VALID [2018-11-23 10:53:46,697 INFO L273 TraceCheckUtils]: 5: Hoare triple {1233#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {1233#true} is VALID [2018-11-23 10:53:46,697 INFO L273 TraceCheckUtils]: 6: Hoare triple {1233#true} assume !(0bv32 == ~cond~0);~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; {1233#true} is VALID [2018-11-23 10:53:46,698 INFO L273 TraceCheckUtils]: 7: Hoare triple {1233#true} assume !(0bv32 != ~p1~0); {1233#true} is VALID [2018-11-23 10:53:46,698 INFO L273 TraceCheckUtils]: 8: Hoare triple {1233#true} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {1262#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:46,700 INFO L273 TraceCheckUtils]: 9: Hoare triple {1262#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {1262#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:46,700 INFO L273 TraceCheckUtils]: 10: Hoare triple {1262#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {1262#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:46,702 INFO L273 TraceCheckUtils]: 11: Hoare triple {1262#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {1262#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:46,702 INFO L273 TraceCheckUtils]: 12: Hoare triple {1262#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {1262#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:46,703 INFO L273 TraceCheckUtils]: 13: Hoare triple {1262#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {1262#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:46,704 INFO L273 TraceCheckUtils]: 14: Hoare triple {1262#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {1262#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:46,704 INFO L273 TraceCheckUtils]: 15: Hoare triple {1262#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {1262#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:46,706 INFO L273 TraceCheckUtils]: 16: Hoare triple {1262#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {1262#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:46,708 INFO L273 TraceCheckUtils]: 17: Hoare triple {1262#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {1262#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:46,709 INFO L273 TraceCheckUtils]: 18: Hoare triple {1262#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p2~0; {1262#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:46,710 INFO L273 TraceCheckUtils]: 19: Hoare triple {1262#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk2~0; {1234#false} is VALID [2018-11-23 10:53:46,710 INFO L273 TraceCheckUtils]: 20: Hoare triple {1234#false} assume !false; {1234#false} is VALID [2018-11-23 10:53:46,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:53:46,712 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:53:46,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:53:46,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:53:46,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 10:53:46,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:53:46,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:53:46,743 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:53:46,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:53:46,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:53:46,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:53:46,745 INFO L87 Difference]: Start difference. First operand 73 states and 127 transitions. Second operand 3 states. [2018-11-23 10:53:46,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:46,949 INFO L93 Difference]: Finished difference Result 136 states and 240 transitions. [2018-11-23 10:53:46,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:53:46,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 10:53:46,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:53:46,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:46,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2018-11-23 10:53:46,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:46,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2018-11-23 10:53:46,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 126 transitions. [2018-11-23 10:53:47,117 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:53:47,121 INFO L225 Difference]: With dead ends: 136 [2018-11-23 10:53:47,121 INFO L226 Difference]: Without dead ends: 134 [2018-11-23 10:53:47,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:53:47,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-23 10:53:47,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 96. [2018-11-23 10:53:47,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:53:47,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand 96 states. [2018-11-23 10:53:47,155 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 96 states. [2018-11-23 10:53:47,155 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 96 states. [2018-11-23 10:53:47,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:47,162 INFO L93 Difference]: Finished difference Result 134 states and 237 transitions. [2018-11-23 10:53:47,162 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 237 transitions. [2018-11-23 10:53:47,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:47,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:47,164 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 134 states. [2018-11-23 10:53:47,164 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 134 states. [2018-11-23 10:53:47,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:47,170 INFO L93 Difference]: Finished difference Result 134 states and 237 transitions. [2018-11-23 10:53:47,171 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 237 transitions. [2018-11-23 10:53:47,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:47,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:47,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:53:47,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:53:47,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 10:53:47,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 168 transitions. [2018-11-23 10:53:47,177 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 168 transitions. Word has length 21 [2018-11-23 10:53:47,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:53:47,177 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 168 transitions. [2018-11-23 10:53:47,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:53:47,177 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 168 transitions. [2018-11-23 10:53:47,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 10:53:47,178 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:53:47,178 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:53:47,179 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:53:47,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:53:47,179 INFO L82 PathProgramCache]: Analyzing trace with hash 29302545, now seen corresponding path program 1 times [2018-11-23 10:53:47,179 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:53:47,180 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:53:47,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:53:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:47,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:47,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:53:47,292 INFO L256 TraceCheckUtils]: 0: Hoare triple {1818#true} call ULTIMATE.init(); {1818#true} is VALID [2018-11-23 10:53:47,293 INFO L273 TraceCheckUtils]: 1: Hoare triple {1818#true} assume true; {1818#true} is VALID [2018-11-23 10:53:47,294 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1818#true} {1818#true} #197#return; {1818#true} is VALID [2018-11-23 10:53:47,294 INFO L256 TraceCheckUtils]: 3: Hoare triple {1818#true} call #t~ret11 := main(); {1818#true} is VALID [2018-11-23 10:53:47,295 INFO L273 TraceCheckUtils]: 4: Hoare triple {1818#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;havoc ~cond~0; {1818#true} is VALID [2018-11-23 10:53:47,295 INFO L273 TraceCheckUtils]: 5: Hoare triple {1818#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {1818#true} is VALID [2018-11-23 10:53:47,295 INFO L273 TraceCheckUtils]: 6: Hoare triple {1818#true} assume !(0bv32 == ~cond~0);~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; {1818#true} is VALID [2018-11-23 10:53:47,296 INFO L273 TraceCheckUtils]: 7: Hoare triple {1818#true} assume !(0bv32 != ~p1~0); {1818#true} is VALID [2018-11-23 10:53:47,299 INFO L273 TraceCheckUtils]: 8: Hoare triple {1818#true} assume !(0bv32 != ~p2~0); {1847#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:53:47,302 INFO L273 TraceCheckUtils]: 9: Hoare triple {1847#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {1847#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:53:47,302 INFO L273 TraceCheckUtils]: 10: Hoare triple {1847#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {1847#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:53:47,304 INFO L273 TraceCheckUtils]: 11: Hoare triple {1847#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {1847#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:53:47,304 INFO L273 TraceCheckUtils]: 12: Hoare triple {1847#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {1847#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:53:47,306 INFO L273 TraceCheckUtils]: 13: Hoare triple {1847#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {1847#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:53:47,307 INFO L273 TraceCheckUtils]: 14: Hoare triple {1847#(= (_ bv0 32) main_~p2~0)} assume !(0bv32 != ~p8~0); {1847#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:53:47,308 INFO L273 TraceCheckUtils]: 15: Hoare triple {1847#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {1847#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:53:47,308 INFO L273 TraceCheckUtils]: 16: Hoare triple {1847#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {1847#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:53:47,311 INFO L273 TraceCheckUtils]: 17: Hoare triple {1847#(= (_ bv0 32) main_~p2~0)} assume !(0bv32 != ~p1~0); {1847#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:53:47,314 INFO L273 TraceCheckUtils]: 18: Hoare triple {1847#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p2~0; {1819#false} is VALID [2018-11-23 10:53:47,314 INFO L273 TraceCheckUtils]: 19: Hoare triple {1819#false} assume 1bv32 != ~lk2~0; {1819#false} is VALID [2018-11-23 10:53:47,314 INFO L273 TraceCheckUtils]: 20: Hoare triple {1819#false} assume !false; {1819#false} is VALID [2018-11-23 10:53:47,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:53:47,316 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:53:47,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:53:47,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:53:47,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 10:53:47,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:53:47,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:53:47,350 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:53:47,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:53:47,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:53:47,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:53:47,351 INFO L87 Difference]: Start difference. First operand 96 states and 168 transitions. Second operand 3 states. [2018-11-23 10:53:47,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:47,560 INFO L93 Difference]: Finished difference Result 224 states and 398 transitions. [2018-11-23 10:53:47,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:53:47,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 10:53:47,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:53:47,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:47,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2018-11-23 10:53:47,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:47,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2018-11-23 10:53:47,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 188 transitions. [2018-11-23 10:53:47,962 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:53:47,966 INFO L225 Difference]: With dead ends: 224 [2018-11-23 10:53:47,966 INFO L226 Difference]: Without dead ends: 136 [2018-11-23 10:53:47,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:53:47,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-11-23 10:53:48,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2018-11-23 10:53:48,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:53:48,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand 134 states. [2018-11-23 10:53:48,046 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 134 states. [2018-11-23 10:53:48,046 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 134 states. [2018-11-23 10:53:48,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:48,052 INFO L93 Difference]: Finished difference Result 136 states and 235 transitions. [2018-11-23 10:53:48,052 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 235 transitions. [2018-11-23 10:53:48,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:48,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:48,053 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 136 states. [2018-11-23 10:53:48,053 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 136 states. [2018-11-23 10:53:48,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:48,059 INFO L93 Difference]: Finished difference Result 136 states and 235 transitions. [2018-11-23 10:53:48,060 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 235 transitions. [2018-11-23 10:53:48,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:48,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:48,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:53:48,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:53:48,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-23 10:53:48,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 234 transitions. [2018-11-23 10:53:48,067 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 234 transitions. Word has length 21 [2018-11-23 10:53:48,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:53:48,067 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 234 transitions. [2018-11-23 10:53:48,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:53:48,067 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 234 transitions. [2018-11-23 10:53:48,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 10:53:48,068 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:53:48,068 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:53:48,068 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:53:48,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:53:48,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1919709866, now seen corresponding path program 1 times [2018-11-23 10:53:48,069 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:53:48,069 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:53:48,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:53:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:48,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:53:48,191 INFO L256 TraceCheckUtils]: 0: Hoare triple {2537#true} call ULTIMATE.init(); {2537#true} is VALID [2018-11-23 10:53:48,191 INFO L273 TraceCheckUtils]: 1: Hoare triple {2537#true} assume true; {2537#true} is VALID [2018-11-23 10:53:48,192 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2537#true} {2537#true} #197#return; {2537#true} is VALID [2018-11-23 10:53:48,192 INFO L256 TraceCheckUtils]: 3: Hoare triple {2537#true} call #t~ret11 := main(); {2537#true} is VALID [2018-11-23 10:53:48,192 INFO L273 TraceCheckUtils]: 4: Hoare triple {2537#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;havoc ~cond~0; {2537#true} is VALID [2018-11-23 10:53:48,193 INFO L273 TraceCheckUtils]: 5: Hoare triple {2537#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {2537#true} is VALID [2018-11-23 10:53:48,193 INFO L273 TraceCheckUtils]: 6: Hoare triple {2537#true} assume !(0bv32 == ~cond~0);~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; {2537#true} is VALID [2018-11-23 10:53:48,193 INFO L273 TraceCheckUtils]: 7: Hoare triple {2537#true} assume !(0bv32 != ~p1~0); {2537#true} is VALID [2018-11-23 10:53:48,198 INFO L273 TraceCheckUtils]: 8: Hoare triple {2537#true} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {2566#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:53:48,199 INFO L273 TraceCheckUtils]: 9: Hoare triple {2566#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {2566#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:53:48,200 INFO L273 TraceCheckUtils]: 10: Hoare triple {2566#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {2566#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:53:48,200 INFO L273 TraceCheckUtils]: 11: Hoare triple {2566#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {2566#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:53:48,200 INFO L273 TraceCheckUtils]: 12: Hoare triple {2566#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {2566#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:53:48,201 INFO L273 TraceCheckUtils]: 13: Hoare triple {2566#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {2566#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:53:48,201 INFO L273 TraceCheckUtils]: 14: Hoare triple {2566#(not (= (_ bv0 32) main_~p2~0))} assume !(0bv32 != ~p8~0); {2566#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:53:48,202 INFO L273 TraceCheckUtils]: 15: Hoare triple {2566#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {2566#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:53:48,202 INFO L273 TraceCheckUtils]: 16: Hoare triple {2566#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {2566#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:53:48,202 INFO L273 TraceCheckUtils]: 17: Hoare triple {2566#(not (= (_ bv0 32) main_~p2~0))} assume !(0bv32 != ~p1~0); {2566#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:53:48,217 INFO L273 TraceCheckUtils]: 18: Hoare triple {2566#(not (= (_ bv0 32) main_~p2~0))} assume !(0bv32 != ~p2~0); {2538#false} is VALID [2018-11-23 10:53:48,218 INFO L273 TraceCheckUtils]: 19: Hoare triple {2538#false} assume 0bv32 != ~p3~0; {2538#false} is VALID [2018-11-23 10:53:48,218 INFO L273 TraceCheckUtils]: 20: Hoare triple {2538#false} assume 1bv32 != ~lk3~0; {2538#false} is VALID [2018-11-23 10:53:48,218 INFO L273 TraceCheckUtils]: 21: Hoare triple {2538#false} assume !false; {2538#false} is VALID [2018-11-23 10:53:48,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:53:48,219 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:53:48,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:53:48,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:53:48,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 10:53:48,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:53:48,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:53:48,252 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:53:48,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:53:48,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:53:48,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:53:48,253 INFO L87 Difference]: Start difference. First operand 134 states and 234 transitions. Second operand 3 states. [2018-11-23 10:53:48,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:48,498 INFO L93 Difference]: Finished difference Result 201 states and 349 transitions. [2018-11-23 10:53:48,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:53:48,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 10:53:48,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:53:48,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:48,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2018-11-23 10:53:48,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:48,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2018-11-23 10:53:48,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 183 transitions. [2018-11-23 10:53:48,834 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:53:48,836 INFO L225 Difference]: With dead ends: 201 [2018-11-23 10:53:48,837 INFO L226 Difference]: Without dead ends: 138 [2018-11-23 10:53:48,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:53:48,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-23 10:53:48,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2018-11-23 10:53:48,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:53:48,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand 136 states. [2018-11-23 10:53:48,890 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 136 states. [2018-11-23 10:53:48,890 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 136 states. [2018-11-23 10:53:48,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:48,896 INFO L93 Difference]: Finished difference Result 138 states and 235 transitions. [2018-11-23 10:53:48,896 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 235 transitions. [2018-11-23 10:53:48,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:48,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:48,897 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 138 states. [2018-11-23 10:53:48,897 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 138 states. [2018-11-23 10:53:48,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:48,903 INFO L93 Difference]: Finished difference Result 138 states and 235 transitions. [2018-11-23 10:53:48,903 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 235 transitions. [2018-11-23 10:53:48,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:48,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:48,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:53:48,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:53:48,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-23 10:53:48,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 234 transitions. [2018-11-23 10:53:48,910 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 234 transitions. Word has length 22 [2018-11-23 10:53:48,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:53:48,910 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 234 transitions. [2018-11-23 10:53:48,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:53:48,910 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 234 transitions. [2018-11-23 10:53:48,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 10:53:48,911 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:53:48,911 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:53:48,912 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:53:48,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:53:48,912 INFO L82 PathProgramCache]: Analyzing trace with hash 908592616, now seen corresponding path program 1 times [2018-11-23 10:53:48,912 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:53:48,913 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:53:48,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:53:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:48,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:48,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:53:49,243 INFO L256 TraceCheckUtils]: 0: Hoare triple {3242#true} call ULTIMATE.init(); {3242#true} is VALID [2018-11-23 10:53:49,244 INFO L273 TraceCheckUtils]: 1: Hoare triple {3242#true} assume true; {3242#true} is VALID [2018-11-23 10:53:49,244 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3242#true} {3242#true} #197#return; {3242#true} is VALID [2018-11-23 10:53:49,244 INFO L256 TraceCheckUtils]: 3: Hoare triple {3242#true} call #t~ret11 := main(); {3242#true} is VALID [2018-11-23 10:53:49,244 INFO L273 TraceCheckUtils]: 4: Hoare triple {3242#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;havoc ~cond~0; {3242#true} is VALID [2018-11-23 10:53:49,245 INFO L273 TraceCheckUtils]: 5: Hoare triple {3242#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {3242#true} is VALID [2018-11-23 10:53:49,245 INFO L273 TraceCheckUtils]: 6: Hoare triple {3242#true} assume !(0bv32 == ~cond~0);~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; {3242#true} is VALID [2018-11-23 10:53:49,245 INFO L273 TraceCheckUtils]: 7: Hoare triple {3242#true} assume !(0bv32 != ~p1~0); {3242#true} is VALID [2018-11-23 10:53:49,246 INFO L273 TraceCheckUtils]: 8: Hoare triple {3242#true} assume !(0bv32 != ~p2~0); {3242#true} is VALID [2018-11-23 10:53:49,247 INFO L273 TraceCheckUtils]: 9: Hoare triple {3242#true} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {3274#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:49,248 INFO L273 TraceCheckUtils]: 10: Hoare triple {3274#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {3274#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:49,249 INFO L273 TraceCheckUtils]: 11: Hoare triple {3274#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {3274#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:49,250 INFO L273 TraceCheckUtils]: 12: Hoare triple {3274#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {3274#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:49,250 INFO L273 TraceCheckUtils]: 13: Hoare triple {3274#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {3274#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:49,251 INFO L273 TraceCheckUtils]: 14: Hoare triple {3274#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {3274#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:49,251 INFO L273 TraceCheckUtils]: 15: Hoare triple {3274#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {3274#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:49,252 INFO L273 TraceCheckUtils]: 16: Hoare triple {3274#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {3274#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:49,252 INFO L273 TraceCheckUtils]: 17: Hoare triple {3274#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {3274#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:49,253 INFO L273 TraceCheckUtils]: 18: Hoare triple {3274#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {3274#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:49,254 INFO L273 TraceCheckUtils]: 19: Hoare triple {3274#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p3~0; {3274#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:49,255 INFO L273 TraceCheckUtils]: 20: Hoare triple {3274#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk3~0; {3243#false} is VALID [2018-11-23 10:53:49,255 INFO L273 TraceCheckUtils]: 21: Hoare triple {3243#false} assume !false; {3243#false} is VALID [2018-11-23 10:53:49,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:53:49,258 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:53:49,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:53:49,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:53:49,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 10:53:49,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:53:49,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:53:49,288 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:53:49,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:53:49,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:53:49,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:53:49,289 INFO L87 Difference]: Start difference. First operand 136 states and 234 transitions. Second operand 3 states. [2018-11-23 10:53:49,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:49,588 INFO L93 Difference]: Finished difference Result 252 states and 440 transitions. [2018-11-23 10:53:49,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:53:49,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 10:53:49,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:53:49,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:49,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2018-11-23 10:53:49,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:49,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2018-11-23 10:53:49,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 122 transitions. [2018-11-23 10:53:49,919 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:53:49,926 INFO L225 Difference]: With dead ends: 252 [2018-11-23 10:53:49,926 INFO L226 Difference]: Without dead ends: 250 [2018-11-23 10:53:49,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:53:49,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-11-23 10:53:49,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 184. [2018-11-23 10:53:49,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:53:49,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 250 states. Second operand 184 states. [2018-11-23 10:53:49,969 INFO L74 IsIncluded]: Start isIncluded. First operand 250 states. Second operand 184 states. [2018-11-23 10:53:49,969 INFO L87 Difference]: Start difference. First operand 250 states. Second operand 184 states. [2018-11-23 10:53:49,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:49,978 INFO L93 Difference]: Finished difference Result 250 states and 435 transitions. [2018-11-23 10:53:49,978 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 435 transitions. [2018-11-23 10:53:49,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:49,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:49,979 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand 250 states. [2018-11-23 10:53:49,979 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 250 states. [2018-11-23 10:53:49,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:49,989 INFO L93 Difference]: Finished difference Result 250 states and 435 transitions. [2018-11-23 10:53:49,989 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 435 transitions. [2018-11-23 10:53:49,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:49,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:49,990 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:53:49,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:53:49,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-23 10:53:49,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 314 transitions. [2018-11-23 10:53:49,997 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 314 transitions. Word has length 22 [2018-11-23 10:53:49,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:53:49,998 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 314 transitions. [2018-11-23 10:53:49,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:53:49,998 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 314 transitions. [2018-11-23 10:53:49,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 10:53:49,999 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:53:49,999 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:53:49,999 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:53:50,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:53:50,000 INFO L82 PathProgramCache]: Analyzing trace with hash 321786602, now seen corresponding path program 1 times [2018-11-23 10:53:50,000 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:53:50,000 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-23 10:53:50,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:53:50,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:50,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:50,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:53:50,093 INFO L256 TraceCheckUtils]: 0: Hoare triple {4272#true} call ULTIMATE.init(); {4272#true} is VALID [2018-11-23 10:53:50,093 INFO L273 TraceCheckUtils]: 1: Hoare triple {4272#true} assume true; {4272#true} is VALID [2018-11-23 10:53:50,094 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4272#true} {4272#true} #197#return; {4272#true} is VALID [2018-11-23 10:53:50,094 INFO L256 TraceCheckUtils]: 3: Hoare triple {4272#true} call #t~ret11 := main(); {4272#true} is VALID [2018-11-23 10:53:50,095 INFO L273 TraceCheckUtils]: 4: Hoare triple {4272#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;havoc ~cond~0; {4272#true} is VALID [2018-11-23 10:53:50,095 INFO L273 TraceCheckUtils]: 5: Hoare triple {4272#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {4272#true} is VALID [2018-11-23 10:53:50,095 INFO L273 TraceCheckUtils]: 6: Hoare triple {4272#true} assume !(0bv32 == ~cond~0);~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; {4272#true} is VALID [2018-11-23 10:53:50,096 INFO L273 TraceCheckUtils]: 7: Hoare triple {4272#true} assume !(0bv32 != ~p1~0); {4272#true} is VALID [2018-11-23 10:53:50,096 INFO L273 TraceCheckUtils]: 8: Hoare triple {4272#true} assume !(0bv32 != ~p2~0); {4272#true} is VALID [2018-11-23 10:53:50,096 INFO L273 TraceCheckUtils]: 9: Hoare triple {4272#true} assume !(0bv32 != ~p3~0); {4304#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:53:50,098 INFO L273 TraceCheckUtils]: 10: Hoare triple {4304#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {4304#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:53:50,098 INFO L273 TraceCheckUtils]: 11: Hoare triple {4304#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {4304#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:53:50,098 INFO L273 TraceCheckUtils]: 12: Hoare triple {4304#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {4304#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:53:50,099 INFO L273 TraceCheckUtils]: 13: Hoare triple {4304#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {4304#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:53:50,101 INFO L273 TraceCheckUtils]: 14: Hoare triple {4304#(= (_ bv0 32) main_~p3~0)} assume !(0bv32 != ~p8~0); {4304#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:53:50,101 INFO L273 TraceCheckUtils]: 15: Hoare triple {4304#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {4304#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:53:50,101 INFO L273 TraceCheckUtils]: 16: Hoare triple {4304#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {4304#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:53:50,102 INFO L273 TraceCheckUtils]: 17: Hoare triple {4304#(= (_ bv0 32) main_~p3~0)} assume !(0bv32 != ~p1~0); {4304#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:53:50,102 INFO L273 TraceCheckUtils]: 18: Hoare triple {4304#(= (_ bv0 32) main_~p3~0)} assume !(0bv32 != ~p2~0); {4304#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:53:50,103 INFO L273 TraceCheckUtils]: 19: Hoare triple {4304#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p3~0; {4273#false} is VALID [2018-11-23 10:53:50,103 INFO L273 TraceCheckUtils]: 20: Hoare triple {4273#false} assume 1bv32 != ~lk3~0; {4273#false} is VALID [2018-11-23 10:53:50,103 INFO L273 TraceCheckUtils]: 21: Hoare triple {4273#false} assume !false; {4273#false} is VALID [2018-11-23 10:53:50,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:53:50,104 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:53:50,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:53:50,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:53:50,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 10:53:50,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:53:50,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:53:50,133 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:53:50,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:53:50,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:53:50,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:53:50,134 INFO L87 Difference]: Start difference. First operand 184 states and 314 transitions. Second operand 3 states. [2018-11-23 10:53:50,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:50,463 INFO L93 Difference]: Finished difference Result 432 states and 744 transitions. [2018-11-23 10:53:50,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:53:50,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 10:53:50,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:53:50,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:50,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2018-11-23 10:53:50,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:50,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2018-11-23 10:53:50,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 185 transitions. [2018-11-23 10:53:50,901 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:53:50,907 INFO L225 Difference]: With dead ends: 432 [2018-11-23 10:53:50,908 INFO L226 Difference]: Without dead ends: 258 [2018-11-23 10:53:50,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:53:50,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-11-23 10:53:51,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2018-11-23 10:53:51,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:53:51,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 258 states. Second operand 256 states. [2018-11-23 10:53:51,004 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand 256 states. [2018-11-23 10:53:51,005 INFO L87 Difference]: Start difference. First operand 258 states. Second operand 256 states. [2018-11-23 10:53:51,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:51,014 INFO L93 Difference]: Finished difference Result 258 states and 435 transitions. [2018-11-23 10:53:51,014 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 435 transitions. [2018-11-23 10:53:51,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:51,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:51,015 INFO L74 IsIncluded]: Start isIncluded. First operand 256 states. Second operand 258 states. [2018-11-23 10:53:51,015 INFO L87 Difference]: Start difference. First operand 256 states. Second operand 258 states. [2018-11-23 10:53:51,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:51,023 INFO L93 Difference]: Finished difference Result 258 states and 435 transitions. [2018-11-23 10:53:51,023 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 435 transitions. [2018-11-23 10:53:51,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:51,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:51,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:53:51,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:53:51,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-11-23 10:53:51,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 434 transitions. [2018-11-23 10:53:51,033 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 434 transitions. Word has length 22 [2018-11-23 10:53:51,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:53:51,033 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 434 transitions. [2018-11-23 10:53:51,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:53:51,034 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 434 transitions. [2018-11-23 10:53:51,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 10:53:51,035 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:53:51,035 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:53:51,035 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:53:51,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:53:51,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1898185914, now seen corresponding path program 1 times [2018-11-23 10:53:51,036 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:53:51,036 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-23 10:53:51,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:53:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:51,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:53:51,220 INFO L256 TraceCheckUtils]: 0: Hoare triple {5578#true} call ULTIMATE.init(); {5578#true} is VALID [2018-11-23 10:53:51,220 INFO L273 TraceCheckUtils]: 1: Hoare triple {5578#true} assume true; {5578#true} is VALID [2018-11-23 10:53:51,220 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5578#true} {5578#true} #197#return; {5578#true} is VALID [2018-11-23 10:53:51,221 INFO L256 TraceCheckUtils]: 3: Hoare triple {5578#true} call #t~ret11 := main(); {5578#true} is VALID [2018-11-23 10:53:51,221 INFO L273 TraceCheckUtils]: 4: Hoare triple {5578#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;havoc ~cond~0; {5578#true} is VALID [2018-11-23 10:53:51,221 INFO L273 TraceCheckUtils]: 5: Hoare triple {5578#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {5578#true} is VALID [2018-11-23 10:53:51,221 INFO L273 TraceCheckUtils]: 6: Hoare triple {5578#true} assume !(0bv32 == ~cond~0);~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; {5578#true} is VALID [2018-11-23 10:53:51,221 INFO L273 TraceCheckUtils]: 7: Hoare triple {5578#true} assume !(0bv32 != ~p1~0); {5578#true} is VALID [2018-11-23 10:53:51,221 INFO L273 TraceCheckUtils]: 8: Hoare triple {5578#true} assume !(0bv32 != ~p2~0); {5578#true} is VALID [2018-11-23 10:53:51,222 INFO L273 TraceCheckUtils]: 9: Hoare triple {5578#true} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {5610#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:53:51,224 INFO L273 TraceCheckUtils]: 10: Hoare triple {5610#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {5610#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:53:51,224 INFO L273 TraceCheckUtils]: 11: Hoare triple {5610#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {5610#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:53:51,227 INFO L273 TraceCheckUtils]: 12: Hoare triple {5610#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {5610#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:53:51,227 INFO L273 TraceCheckUtils]: 13: Hoare triple {5610#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {5610#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:53:51,229 INFO L273 TraceCheckUtils]: 14: Hoare triple {5610#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p8~0); {5610#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:53:51,229 INFO L273 TraceCheckUtils]: 15: Hoare triple {5610#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {5610#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:53:51,231 INFO L273 TraceCheckUtils]: 16: Hoare triple {5610#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {5610#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:53:51,233 INFO L273 TraceCheckUtils]: 17: Hoare triple {5610#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p1~0); {5610#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:53:51,233 INFO L273 TraceCheckUtils]: 18: Hoare triple {5610#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p2~0); {5610#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:53:51,236 INFO L273 TraceCheckUtils]: 19: Hoare triple {5610#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p3~0); {5579#false} is VALID [2018-11-23 10:53:51,236 INFO L273 TraceCheckUtils]: 20: Hoare triple {5579#false} assume 0bv32 != ~p4~0; {5579#false} is VALID [2018-11-23 10:53:51,236 INFO L273 TraceCheckUtils]: 21: Hoare triple {5579#false} assume 1bv32 != ~lk4~0; {5579#false} is VALID [2018-11-23 10:53:51,236 INFO L273 TraceCheckUtils]: 22: Hoare triple {5579#false} assume !false; {5579#false} is VALID [2018-11-23 10:53:51,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:53:51,237 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:53:51,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:53:51,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:53:51,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:53:51,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:53:51,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:53:51,305 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:53:51,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:53:51,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:53:51,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:53:51,306 INFO L87 Difference]: Start difference. First operand 256 states and 434 transitions. Second operand 3 states. [2018-11-23 10:53:51,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:51,723 INFO L93 Difference]: Finished difference Result 384 states and 648 transitions. [2018-11-23 10:53:51,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:53:51,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:53:51,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:53:51,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:51,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2018-11-23 10:53:51,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:51,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2018-11-23 10:53:51,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 180 transitions. [2018-11-23 10:53:52,392 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:53:52,398 INFO L225 Difference]: With dead ends: 384 [2018-11-23 10:53:52,398 INFO L226 Difference]: Without dead ends: 262 [2018-11-23 10:53:52,399 INFO L631 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-23 10:53:52,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-11-23 10:53:52,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2018-11-23 10:53:52,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:53:52,523 INFO L82 GeneralOperation]: Start isEquivalent. First operand 262 states. Second operand 260 states. [2018-11-23 10:53:52,524 INFO L74 IsIncluded]: Start isIncluded. First operand 262 states. Second operand 260 states. [2018-11-23 10:53:52,524 INFO L87 Difference]: Start difference. First operand 262 states. Second operand 260 states. [2018-11-23 10:53:52,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:52,531 INFO L93 Difference]: Finished difference Result 262 states and 435 transitions. [2018-11-23 10:53:52,531 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 435 transitions. [2018-11-23 10:53:52,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:52,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:52,532 INFO L74 IsIncluded]: Start isIncluded. First operand 260 states. Second operand 262 states. [2018-11-23 10:53:52,532 INFO L87 Difference]: Start difference. First operand 260 states. Second operand 262 states. [2018-11-23 10:53:52,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:52,540 INFO L93 Difference]: Finished difference Result 262 states and 435 transitions. [2018-11-23 10:53:52,540 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 435 transitions. [2018-11-23 10:53:52,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:52,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:52,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:53:52,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:53:52,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-23 10:53:52,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 434 transitions. [2018-11-23 10:53:52,549 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 434 transitions. Word has length 23 [2018-11-23 10:53:52,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:53:52,549 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 434 transitions. [2018-11-23 10:53:52,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:53:52,549 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 434 transitions. [2018-11-23 10:53:52,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 10:53:52,550 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:53:52,550 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:53:52,550 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:53:52,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:53:52,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1385664132, now seen corresponding path program 1 times [2018-11-23 10:53:52,551 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:53:52,551 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-23 10:53:52,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:53:52,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:52,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:53:53,112 INFO L256 TraceCheckUtils]: 0: Hoare triple {6851#true} call ULTIMATE.init(); {6851#true} is VALID [2018-11-23 10:53:53,112 INFO L273 TraceCheckUtils]: 1: Hoare triple {6851#true} assume true; {6851#true} is VALID [2018-11-23 10:53:53,113 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6851#true} {6851#true} #197#return; {6851#true} is VALID [2018-11-23 10:53:53,113 INFO L256 TraceCheckUtils]: 3: Hoare triple {6851#true} call #t~ret11 := main(); {6851#true} is VALID [2018-11-23 10:53:53,113 INFO L273 TraceCheckUtils]: 4: Hoare triple {6851#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;havoc ~cond~0; {6851#true} is VALID [2018-11-23 10:53:53,113 INFO L273 TraceCheckUtils]: 5: Hoare triple {6851#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {6851#true} is VALID [2018-11-23 10:53:53,114 INFO L273 TraceCheckUtils]: 6: Hoare triple {6851#true} assume !(0bv32 == ~cond~0);~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; {6851#true} is VALID [2018-11-23 10:53:53,114 INFO L273 TraceCheckUtils]: 7: Hoare triple {6851#true} assume !(0bv32 != ~p1~0); {6851#true} is VALID [2018-11-23 10:53:53,114 INFO L273 TraceCheckUtils]: 8: Hoare triple {6851#true} assume !(0bv32 != ~p2~0); {6851#true} is VALID [2018-11-23 10:53:53,114 INFO L273 TraceCheckUtils]: 9: Hoare triple {6851#true} assume !(0bv32 != ~p3~0); {6851#true} is VALID [2018-11-23 10:53:53,125 INFO L273 TraceCheckUtils]: 10: Hoare triple {6851#true} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {6886#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:53,139 INFO L273 TraceCheckUtils]: 11: Hoare triple {6886#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {6886#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:53,154 INFO L273 TraceCheckUtils]: 12: Hoare triple {6886#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {6886#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:53,157 INFO L273 TraceCheckUtils]: 13: Hoare triple {6886#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {6886#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:53,157 INFO L273 TraceCheckUtils]: 14: Hoare triple {6886#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {6886#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:53,159 INFO L273 TraceCheckUtils]: 15: Hoare triple {6886#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {6886#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:53,161 INFO L273 TraceCheckUtils]: 16: Hoare triple {6886#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {6886#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:53,165 INFO L273 TraceCheckUtils]: 17: Hoare triple {6886#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {6886#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:53,165 INFO L273 TraceCheckUtils]: 18: Hoare triple {6886#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {6886#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:53,167 INFO L273 TraceCheckUtils]: 19: Hoare triple {6886#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {6886#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:53,167 INFO L273 TraceCheckUtils]: 20: Hoare triple {6886#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0; {6886#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:53,169 INFO L273 TraceCheckUtils]: 21: Hoare triple {6886#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk4~0; {6852#false} is VALID [2018-11-23 10:53:53,169 INFO L273 TraceCheckUtils]: 22: Hoare triple {6852#false} assume !false; {6852#false} is VALID [2018-11-23 10:53:53,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:53:53,170 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:53:53,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:53:53,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:53:53,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:53:53,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:53:53,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:53:53,222 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:53:53,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:53:53,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:53:53,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:53:53,223 INFO L87 Difference]: Start difference. First operand 260 states and 434 transitions. Second operand 3 states. [2018-11-23 10:53:53,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:53,459 INFO L93 Difference]: Finished difference Result 476 states and 808 transitions. [2018-11-23 10:53:53,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:53:53,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:53:53,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:53:53,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:53,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2018-11-23 10:53:53,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:53,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2018-11-23 10:53:53,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 118 transitions. [2018-11-23 10:53:53,901 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:53:53,918 INFO L225 Difference]: With dead ends: 476 [2018-11-23 10:53:53,918 INFO L226 Difference]: Without dead ends: 474 [2018-11-23 10:53:53,919 INFO L631 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-23 10:53:53,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-11-23 10:53:54,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 360. [2018-11-23 10:53:54,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:53:54,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 474 states. Second operand 360 states. [2018-11-23 10:53:54,122 INFO L74 IsIncluded]: Start isIncluded. First operand 474 states. Second operand 360 states. [2018-11-23 10:53:54,123 INFO L87 Difference]: Start difference. First operand 474 states. Second operand 360 states. [2018-11-23 10:53:54,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:54,139 INFO L93 Difference]: Finished difference Result 474 states and 799 transitions. [2018-11-23 10:53:54,140 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 799 transitions. [2018-11-23 10:53:54,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:54,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:54,141 INFO L74 IsIncluded]: Start isIncluded. First operand 360 states. Second operand 474 states. [2018-11-23 10:53:54,141 INFO L87 Difference]: Start difference. First operand 360 states. Second operand 474 states. [2018-11-23 10:53:54,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:54,159 INFO L93 Difference]: Finished difference Result 474 states and 799 transitions. [2018-11-23 10:53:54,159 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 799 transitions. [2018-11-23 10:53:54,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:54,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:54,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:53:54,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:53:54,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-11-23 10:53:54,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 590 transitions. [2018-11-23 10:53:54,171 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 590 transitions. Word has length 23 [2018-11-23 10:53:54,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:53:54,171 INFO L480 AbstractCegarLoop]: Abstraction has 360 states and 590 transitions. [2018-11-23 10:53:54,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:53:54,172 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 590 transitions. [2018-11-23 10:53:54,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 10:53:54,172 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:53:54,173 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:53:54,173 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:53:54,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:53:54,174 INFO L82 PathProgramCache]: Analyzing trace with hash 798858118, now seen corresponding path program 1 times [2018-11-23 10:53:54,174 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:53:54,174 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-23 10:53:54,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:53:54,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:54,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:54,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:53:54,650 INFO L256 TraceCheckUtils]: 0: Hoare triple {8744#true} call ULTIMATE.init(); {8744#true} is VALID [2018-11-23 10:53:54,651 INFO L273 TraceCheckUtils]: 1: Hoare triple {8744#true} assume true; {8744#true} is VALID [2018-11-23 10:53:54,651 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {8744#true} {8744#true} #197#return; {8744#true} is VALID [2018-11-23 10:53:54,652 INFO L256 TraceCheckUtils]: 3: Hoare triple {8744#true} call #t~ret11 := main(); {8744#true} is VALID [2018-11-23 10:53:54,652 INFO L273 TraceCheckUtils]: 4: Hoare triple {8744#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;havoc ~cond~0; {8744#true} is VALID [2018-11-23 10:53:54,652 INFO L273 TraceCheckUtils]: 5: Hoare triple {8744#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {8744#true} is VALID [2018-11-23 10:53:54,652 INFO L273 TraceCheckUtils]: 6: Hoare triple {8744#true} assume !(0bv32 == ~cond~0);~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; {8744#true} is VALID [2018-11-23 10:53:54,653 INFO L273 TraceCheckUtils]: 7: Hoare triple {8744#true} assume !(0bv32 != ~p1~0); {8744#true} is VALID [2018-11-23 10:53:54,653 INFO L273 TraceCheckUtils]: 8: Hoare triple {8744#true} assume !(0bv32 != ~p2~0); {8744#true} is VALID [2018-11-23 10:53:54,653 INFO L273 TraceCheckUtils]: 9: Hoare triple {8744#true} assume !(0bv32 != ~p3~0); {8744#true} is VALID [2018-11-23 10:53:54,653 INFO L273 TraceCheckUtils]: 10: Hoare triple {8744#true} assume !(0bv32 != ~p4~0); {8779#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:53:54,658 INFO L273 TraceCheckUtils]: 11: Hoare triple {8779#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {8779#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:53:54,658 INFO L273 TraceCheckUtils]: 12: Hoare triple {8779#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {8779#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:53:54,658 INFO L273 TraceCheckUtils]: 13: Hoare triple {8779#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {8779#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:53:54,659 INFO L273 TraceCheckUtils]: 14: Hoare triple {8779#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p8~0); {8779#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:53:54,659 INFO L273 TraceCheckUtils]: 15: Hoare triple {8779#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {8779#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:53:54,660 INFO L273 TraceCheckUtils]: 16: Hoare triple {8779#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {8779#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:53:54,660 INFO L273 TraceCheckUtils]: 17: Hoare triple {8779#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p1~0); {8779#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:53:54,660 INFO L273 TraceCheckUtils]: 18: Hoare triple {8779#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p2~0); {8779#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:53:54,661 INFO L273 TraceCheckUtils]: 19: Hoare triple {8779#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p3~0); {8779#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:53:54,661 INFO L273 TraceCheckUtils]: 20: Hoare triple {8779#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p4~0; {8745#false} is VALID [2018-11-23 10:53:54,661 INFO L273 TraceCheckUtils]: 21: Hoare triple {8745#false} assume 1bv32 != ~lk4~0; {8745#false} is VALID [2018-11-23 10:53:54,662 INFO L273 TraceCheckUtils]: 22: Hoare triple {8745#false} assume !false; {8745#false} is VALID [2018-11-23 10:53:54,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:53:54,662 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:53:54,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:53:54,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:53:54,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:53:54,665 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:53:54,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:53:54,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:53:54,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:53:54,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:53:54,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:53:54,685 INFO L87 Difference]: Start difference. First operand 360 states and 590 transitions. Second operand 3 states. [2018-11-23 10:53:55,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:55,012 INFO L93 Difference]: Finished difference Result 844 states and 1392 transitions. [2018-11-23 10:53:55,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:53:55,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:53:55,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:53:55,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:55,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2018-11-23 10:53:55,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:55,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2018-11-23 10:53:55,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 182 transitions. [2018-11-23 10:53:56,078 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:53:56,092 INFO L225 Difference]: With dead ends: 844 [2018-11-23 10:53:56,092 INFO L226 Difference]: Without dead ends: 498 [2018-11-23 10:53:56,093 INFO L631 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-23 10:53:56,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-11-23 10:53:56,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 496. [2018-11-23 10:53:56,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:53:56,313 INFO L82 GeneralOperation]: Start isEquivalent. First operand 498 states. Second operand 496 states. [2018-11-23 10:53:56,313 INFO L74 IsIncluded]: Start isIncluded. First operand 498 states. Second operand 496 states. [2018-11-23 10:53:56,313 INFO L87 Difference]: Start difference. First operand 498 states. Second operand 496 states. [2018-11-23 10:53:56,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:56,335 INFO L93 Difference]: Finished difference Result 498 states and 807 transitions. [2018-11-23 10:53:56,335 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 807 transitions. [2018-11-23 10:53:56,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:56,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:56,337 INFO L74 IsIncluded]: Start isIncluded. First operand 496 states. Second operand 498 states. [2018-11-23 10:53:56,337 INFO L87 Difference]: Start difference. First operand 496 states. Second operand 498 states. [2018-11-23 10:53:56,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:56,355 INFO L93 Difference]: Finished difference Result 498 states and 807 transitions. [2018-11-23 10:53:56,355 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 807 transitions. [2018-11-23 10:53:56,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:56,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:56,356 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:53:56,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:53:56,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2018-11-23 10:53:56,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 806 transitions. [2018-11-23 10:53:56,373 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 806 transitions. Word has length 23 [2018-11-23 10:53:56,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:53:56,373 INFO L480 AbstractCegarLoop]: Abstraction has 496 states and 806 transitions. [2018-11-23 10:53:56,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:53:56,373 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 806 transitions. [2018-11-23 10:53:56,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 10:53:56,374 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:53:56,375 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:53:56,375 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:53:56,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:53:56,375 INFO L82 PathProgramCache]: Analyzing trace with hash 6129535, now seen corresponding path program 1 times [2018-11-23 10:53:56,375 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:53:56,378 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-23 10:53:56,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:53:56,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:56,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:53:56,905 INFO L256 TraceCheckUtils]: 0: Hoare triple {11205#true} call ULTIMATE.init(); {11205#true} is VALID [2018-11-23 10:53:56,905 INFO L273 TraceCheckUtils]: 1: Hoare triple {11205#true} assume true; {11205#true} is VALID [2018-11-23 10:53:56,906 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {11205#true} {11205#true} #197#return; {11205#true} is VALID [2018-11-23 10:53:56,906 INFO L256 TraceCheckUtils]: 3: Hoare triple {11205#true} call #t~ret11 := main(); {11205#true} is VALID [2018-11-23 10:53:56,906 INFO L273 TraceCheckUtils]: 4: Hoare triple {11205#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;havoc ~cond~0; {11205#true} is VALID [2018-11-23 10:53:56,906 INFO L273 TraceCheckUtils]: 5: Hoare triple {11205#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {11205#true} is VALID [2018-11-23 10:53:56,907 INFO L273 TraceCheckUtils]: 6: Hoare triple {11205#true} assume !(0bv32 == ~cond~0);~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; {11205#true} is VALID [2018-11-23 10:53:56,907 INFO L273 TraceCheckUtils]: 7: Hoare triple {11205#true} assume !(0bv32 != ~p1~0); {11205#true} is VALID [2018-11-23 10:53:56,907 INFO L273 TraceCheckUtils]: 8: Hoare triple {11205#true} assume !(0bv32 != ~p2~0); {11205#true} is VALID [2018-11-23 10:53:56,907 INFO L273 TraceCheckUtils]: 9: Hoare triple {11205#true} assume !(0bv32 != ~p3~0); {11205#true} is VALID [2018-11-23 10:53:56,908 INFO L273 TraceCheckUtils]: 10: Hoare triple {11205#true} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {11240#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:53:56,909 INFO L273 TraceCheckUtils]: 11: Hoare triple {11240#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {11240#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:53:56,909 INFO L273 TraceCheckUtils]: 12: Hoare triple {11240#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {11240#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:53:56,910 INFO L273 TraceCheckUtils]: 13: Hoare triple {11240#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {11240#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:53:56,910 INFO L273 TraceCheckUtils]: 14: Hoare triple {11240#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p8~0); {11240#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:53:56,911 INFO L273 TraceCheckUtils]: 15: Hoare triple {11240#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {11240#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:53:56,913 INFO L273 TraceCheckUtils]: 16: Hoare triple {11240#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {11240#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:53:56,916 INFO L273 TraceCheckUtils]: 17: Hoare triple {11240#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p1~0); {11240#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:53:56,918 INFO L273 TraceCheckUtils]: 18: Hoare triple {11240#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p2~0); {11240#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:53:56,918 INFO L273 TraceCheckUtils]: 19: Hoare triple {11240#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p3~0); {11240#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:53:56,920 INFO L273 TraceCheckUtils]: 20: Hoare triple {11240#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p4~0); {11206#false} is VALID [2018-11-23 10:53:56,920 INFO L273 TraceCheckUtils]: 21: Hoare triple {11206#false} assume 0bv32 != ~p5~0; {11206#false} is VALID [2018-11-23 10:53:56,920 INFO L273 TraceCheckUtils]: 22: Hoare triple {11206#false} assume 1bv32 != ~lk5~0; {11206#false} is VALID [2018-11-23 10:53:56,920 INFO L273 TraceCheckUtils]: 23: Hoare triple {11206#false} assume !false; {11206#false} is VALID [2018-11-23 10:53:56,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:53:56,921 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:53:56,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:53:56,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:53:56,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 10:53:56,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:53:56,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:53:56,944 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-23 10:53:56,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:53:56,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:53:56,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:53:56,946 INFO L87 Difference]: Start difference. First operand 496 states and 806 transitions. Second operand 3 states. [2018-11-23 10:53:57,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:57,318 INFO L93 Difference]: Finished difference Result 744 states and 1204 transitions. [2018-11-23 10:53:57,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:53:57,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 10:53:57,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:53:57,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:57,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2018-11-23 10:53:57,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:57,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2018-11-23 10:53:57,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 177 transitions. [2018-11-23 10:53:57,481 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:53:57,496 INFO L225 Difference]: With dead ends: 744 [2018-11-23 10:53:57,496 INFO L226 Difference]: Without dead ends: 506 [2018-11-23 10:53:57,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:53:57,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2018-11-23 10:53:57,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 504. [2018-11-23 10:53:57,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:53:57,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 506 states. Second operand 504 states. [2018-11-23 10:53:57,699 INFO L74 IsIncluded]: Start isIncluded. First operand 506 states. Second operand 504 states. [2018-11-23 10:53:57,699 INFO L87 Difference]: Start difference. First operand 506 states. Second operand 504 states. [2018-11-23 10:53:57,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:57,713 INFO L93 Difference]: Finished difference Result 506 states and 807 transitions. [2018-11-23 10:53:57,713 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 807 transitions. [2018-11-23 10:53:57,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:57,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:57,715 INFO L74 IsIncluded]: Start isIncluded. First operand 504 states. Second operand 506 states. [2018-11-23 10:53:57,715 INFO L87 Difference]: Start difference. First operand 504 states. Second operand 506 states. [2018-11-23 10:53:57,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:57,730 INFO L93 Difference]: Finished difference Result 506 states and 807 transitions. [2018-11-23 10:53:57,730 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 807 transitions. [2018-11-23 10:53:57,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:57,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:57,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:53:57,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:53:57,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-11-23 10:53:57,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 806 transitions. [2018-11-23 10:53:57,749 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 806 transitions. Word has length 24 [2018-11-23 10:53:57,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:53:57,750 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 806 transitions. [2018-11-23 10:53:57,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:53:57,750 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 806 transitions. [2018-11-23 10:53:57,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 10:53:57,751 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:53:57,751 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:53:57,752 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:53:57,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:53:57,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1004987715, now seen corresponding path program 1 times [2018-11-23 10:53:57,752 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:53:57,753 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-23 10:53:57,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:53:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:57,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:53:57,986 INFO L256 TraceCheckUtils]: 0: Hoare triple {13593#true} call ULTIMATE.init(); {13593#true} is VALID [2018-11-23 10:53:57,986 INFO L273 TraceCheckUtils]: 1: Hoare triple {13593#true} assume true; {13593#true} is VALID [2018-11-23 10:53:57,987 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {13593#true} {13593#true} #197#return; {13593#true} is VALID [2018-11-23 10:53:57,987 INFO L256 TraceCheckUtils]: 3: Hoare triple {13593#true} call #t~ret11 := main(); {13593#true} is VALID [2018-11-23 10:53:57,987 INFO L273 TraceCheckUtils]: 4: Hoare triple {13593#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;havoc ~cond~0; {13593#true} is VALID [2018-11-23 10:53:57,987 INFO L273 TraceCheckUtils]: 5: Hoare triple {13593#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {13593#true} is VALID [2018-11-23 10:53:57,988 INFO L273 TraceCheckUtils]: 6: Hoare triple {13593#true} assume !(0bv32 == ~cond~0);~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; {13593#true} is VALID [2018-11-23 10:53:57,989 INFO L273 TraceCheckUtils]: 7: Hoare triple {13593#true} assume !(0bv32 != ~p1~0); {13593#true} is VALID [2018-11-23 10:53:57,989 INFO L273 TraceCheckUtils]: 8: Hoare triple {13593#true} assume !(0bv32 != ~p2~0); {13593#true} is VALID [2018-11-23 10:53:57,989 INFO L273 TraceCheckUtils]: 9: Hoare triple {13593#true} assume !(0bv32 != ~p3~0); {13593#true} is VALID [2018-11-23 10:53:57,990 INFO L273 TraceCheckUtils]: 10: Hoare triple {13593#true} assume !(0bv32 != ~p4~0); {13593#true} is VALID [2018-11-23 10:53:57,998 INFO L273 TraceCheckUtils]: 11: Hoare triple {13593#true} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {13631#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:58,011 INFO L273 TraceCheckUtils]: 12: Hoare triple {13631#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {13631#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:58,024 INFO L273 TraceCheckUtils]: 13: Hoare triple {13631#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {13631#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:58,033 INFO L273 TraceCheckUtils]: 14: Hoare triple {13631#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {13631#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:58,045 INFO L273 TraceCheckUtils]: 15: Hoare triple {13631#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {13631#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:58,045 INFO L273 TraceCheckUtils]: 16: Hoare triple {13631#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {13631#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:58,047 INFO L273 TraceCheckUtils]: 17: Hoare triple {13631#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {13631#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:58,047 INFO L273 TraceCheckUtils]: 18: Hoare triple {13631#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {13631#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:58,047 INFO L273 TraceCheckUtils]: 19: Hoare triple {13631#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {13631#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:58,050 INFO L273 TraceCheckUtils]: 20: Hoare triple {13631#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {13631#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:58,050 INFO L273 TraceCheckUtils]: 21: Hoare triple {13631#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0; {13631#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:53:58,052 INFO L273 TraceCheckUtils]: 22: Hoare triple {13631#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk5~0; {13594#false} is VALID [2018-11-23 10:53:58,052 INFO L273 TraceCheckUtils]: 23: Hoare triple {13594#false} assume !false; {13594#false} is VALID [2018-11-23 10:53:58,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:53:58,053 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:53:58,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:53:58,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:53:58,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 10:53:58,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:53:58,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:53:58,106 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-23 10:53:58,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:53:58,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:53:58,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:53:58,107 INFO L87 Difference]: Start difference. First operand 504 states and 806 transitions. Second operand 3 states. [2018-11-23 10:53:58,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:58,599 INFO L93 Difference]: Finished difference Result 908 states and 1480 transitions. [2018-11-23 10:53:58,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:53:58,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 10:53:58,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:53:58,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:58,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2018-11-23 10:53:58,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:53:58,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2018-11-23 10:53:58,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 114 transitions. [2018-11-23 10:53:58,726 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:53:58,767 INFO L225 Difference]: With dead ends: 908 [2018-11-23 10:53:58,767 INFO L226 Difference]: Without dead ends: 906 [2018-11-23 10:53:58,768 INFO L631 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-23 10:53:58,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2018-11-23 10:53:59,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 712. [2018-11-23 10:53:59,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:53:59,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 906 states. Second operand 712 states. [2018-11-23 10:53:59,007 INFO L74 IsIncluded]: Start isIncluded. First operand 906 states. Second operand 712 states. [2018-11-23 10:53:59,007 INFO L87 Difference]: Start difference. First operand 906 states. Second operand 712 states. [2018-11-23 10:53:59,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:59,039 INFO L93 Difference]: Finished difference Result 906 states and 1463 transitions. [2018-11-23 10:53:59,040 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1463 transitions. [2018-11-23 10:53:59,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:59,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:59,042 INFO L74 IsIncluded]: Start isIncluded. First operand 712 states. Second operand 906 states. [2018-11-23 10:53:59,042 INFO L87 Difference]: Start difference. First operand 712 states. Second operand 906 states. [2018-11-23 10:53:59,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:53:59,079 INFO L93 Difference]: Finished difference Result 906 states and 1463 transitions. [2018-11-23 10:53:59,079 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1463 transitions. [2018-11-23 10:53:59,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:53:59,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:53:59,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:53:59,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:53:59,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2018-11-23 10:53:59,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1110 transitions. [2018-11-23 10:53:59,111 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1110 transitions. Word has length 24 [2018-11-23 10:53:59,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:53:59,111 INFO L480 AbstractCegarLoop]: Abstraction has 712 states and 1110 transitions. [2018-11-23 10:53:59,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:53:59,111 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1110 transitions. [2018-11-23 10:53:59,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 10:53:59,113 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:53:59,113 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:53:59,113 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:53:59,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:53:59,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1591793729, now seen corresponding path program 1 times [2018-11-23 10:53:59,114 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:53:59,114 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-23 10:53:59,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:53:59,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:53:59,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:53:59,216 INFO L256 TraceCheckUtils]: 0: Hoare triple {17161#true} call ULTIMATE.init(); {17161#true} is VALID [2018-11-23 10:53:59,216 INFO L273 TraceCheckUtils]: 1: Hoare triple {17161#true} assume true; {17161#true} is VALID [2018-11-23 10:53:59,217 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {17161#true} {17161#true} #197#return; {17161#true} is VALID [2018-11-23 10:53:59,217 INFO L256 TraceCheckUtils]: 3: Hoare triple {17161#true} call #t~ret11 := main(); {17161#true} is VALID [2018-11-23 10:53:59,218 INFO L273 TraceCheckUtils]: 4: Hoare triple {17161#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;havoc ~cond~0; {17161#true} is VALID [2018-11-23 10:53:59,218 INFO L273 TraceCheckUtils]: 5: Hoare triple {17161#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {17161#true} is VALID [2018-11-23 10:53:59,218 INFO L273 TraceCheckUtils]: 6: Hoare triple {17161#true} assume !(0bv32 == ~cond~0);~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; {17161#true} is VALID [2018-11-23 10:53:59,219 INFO L273 TraceCheckUtils]: 7: Hoare triple {17161#true} assume !(0bv32 != ~p1~0); {17161#true} is VALID [2018-11-23 10:53:59,219 INFO L273 TraceCheckUtils]: 8: Hoare triple {17161#true} assume !(0bv32 != ~p2~0); {17161#true} is VALID [2018-11-23 10:53:59,219 INFO L273 TraceCheckUtils]: 9: Hoare triple {17161#true} assume !(0bv32 != ~p3~0); {17161#true} is VALID [2018-11-23 10:53:59,219 INFO L273 TraceCheckUtils]: 10: Hoare triple {17161#true} assume !(0bv32 != ~p4~0); {17161#true} is VALID [2018-11-23 10:53:59,220 INFO L273 TraceCheckUtils]: 11: Hoare triple {17161#true} assume !(0bv32 != ~p5~0); {17199#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:53:59,222 INFO L273 TraceCheckUtils]: 12: Hoare triple {17199#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {17199#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:53:59,223 INFO L273 TraceCheckUtils]: 13: Hoare triple {17199#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {17199#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:53:59,223 INFO L273 TraceCheckUtils]: 14: Hoare triple {17199#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p8~0); {17199#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:53:59,225 INFO L273 TraceCheckUtils]: 15: Hoare triple {17199#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {17199#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:53:59,225 INFO L273 TraceCheckUtils]: 16: Hoare triple {17199#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {17199#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:53:59,230 INFO L273 TraceCheckUtils]: 17: Hoare triple {17199#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p1~0); {17199#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:53:59,247 INFO L273 TraceCheckUtils]: 18: Hoare triple {17199#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p2~0); {17199#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:53:59,260 INFO L273 TraceCheckUtils]: 19: Hoare triple {17199#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p3~0); {17199#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:53:59,260 INFO L273 TraceCheckUtils]: 20: Hoare triple {17199#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p4~0); {17199#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:53:59,263 INFO L273 TraceCheckUtils]: 21: Hoare triple {17199#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p5~0; {17162#false} is VALID [2018-11-23 10:53:59,264 INFO L273 TraceCheckUtils]: 22: Hoare triple {17162#false} assume 1bv32 != ~lk5~0; {17162#false} is VALID [2018-11-23 10:53:59,264 INFO L273 TraceCheckUtils]: 23: Hoare triple {17162#false} assume !false; {17162#false} is VALID [2018-11-23 10:53:59,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:53:59,265 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:53:59,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:53:59,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:53:59,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 10:53:59,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:53:59,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:53:59,288 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-23 10:53:59,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:53:59,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:53:59,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:53:59,289 INFO L87 Difference]: Start difference. First operand 712 states and 1110 transitions. Second operand 3 states. [2018-11-23 10:54:00,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:00,035 INFO L93 Difference]: Finished difference Result 1660 states and 2600 transitions. [2018-11-23 10:54:00,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:00,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 10:54:00,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:00,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:00,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 179 transitions. [2018-11-23 10:54:00,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:00,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 179 transitions. [2018-11-23 10:54:00,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 179 transitions. [2018-11-23 10:54:00,225 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:00,269 INFO L225 Difference]: With dead ends: 1660 [2018-11-23 10:54:00,269 INFO L226 Difference]: Without dead ends: 970 [2018-11-23 10:54:00,271 INFO L631 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-23 10:54:00,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2018-11-23 10:54:00,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 968. [2018-11-23 10:54:00,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:00,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 970 states. Second operand 968 states. [2018-11-23 10:54:00,987 INFO L74 IsIncluded]: Start isIncluded. First operand 970 states. Second operand 968 states. [2018-11-23 10:54:00,987 INFO L87 Difference]: Start difference. First operand 970 states. Second operand 968 states. [2018-11-23 10:54:01,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:01,021 INFO L93 Difference]: Finished difference Result 970 states and 1495 transitions. [2018-11-23 10:54:01,022 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1495 transitions. [2018-11-23 10:54:01,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:01,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:01,023 INFO L74 IsIncluded]: Start isIncluded. First operand 968 states. Second operand 970 states. [2018-11-23 10:54:01,023 INFO L87 Difference]: Start difference. First operand 968 states. Second operand 970 states. [2018-11-23 10:54:01,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:01,058 INFO L93 Difference]: Finished difference Result 970 states and 1495 transitions. [2018-11-23 10:54:01,058 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1495 transitions. [2018-11-23 10:54:01,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:01,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:01,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:01,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:01,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2018-11-23 10:54:01,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1494 transitions. [2018-11-23 10:54:01,091 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1494 transitions. Word has length 24 [2018-11-23 10:54:01,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:01,092 INFO L480 AbstractCegarLoop]: Abstraction has 968 states and 1494 transitions. [2018-11-23 10:54:01,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:01,092 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1494 transitions. [2018-11-23 10:54:01,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 10:54:01,093 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:01,093 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:01,093 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:01,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:01,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1089633349, now seen corresponding path program 1 times [2018-11-23 10:54:01,093 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:01,093 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-23 10:54:01,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:01,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:01,183 INFO L256 TraceCheckUtils]: 0: Hoare triple {21897#true} call ULTIMATE.init(); {21897#true} is VALID [2018-11-23 10:54:01,184 INFO L273 TraceCheckUtils]: 1: Hoare triple {21897#true} assume true; {21897#true} is VALID [2018-11-23 10:54:01,184 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {21897#true} {21897#true} #197#return; {21897#true} is VALID [2018-11-23 10:54:01,185 INFO L256 TraceCheckUtils]: 3: Hoare triple {21897#true} call #t~ret11 := main(); {21897#true} is VALID [2018-11-23 10:54:01,185 INFO L273 TraceCheckUtils]: 4: Hoare triple {21897#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;havoc ~cond~0; {21897#true} is VALID [2018-11-23 10:54:01,185 INFO L273 TraceCheckUtils]: 5: Hoare triple {21897#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {21897#true} is VALID [2018-11-23 10:54:01,186 INFO L273 TraceCheckUtils]: 6: Hoare triple {21897#true} assume !(0bv32 == ~cond~0);~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; {21897#true} is VALID [2018-11-23 10:54:01,186 INFO L273 TraceCheckUtils]: 7: Hoare triple {21897#true} assume !(0bv32 != ~p1~0); {21897#true} is VALID [2018-11-23 10:54:01,186 INFO L273 TraceCheckUtils]: 8: Hoare triple {21897#true} assume !(0bv32 != ~p2~0); {21897#true} is VALID [2018-11-23 10:54:01,187 INFO L273 TraceCheckUtils]: 9: Hoare triple {21897#true} assume !(0bv32 != ~p3~0); {21897#true} is VALID [2018-11-23 10:54:01,187 INFO L273 TraceCheckUtils]: 10: Hoare triple {21897#true} assume !(0bv32 != ~p4~0); {21897#true} is VALID [2018-11-23 10:54:01,192 INFO L273 TraceCheckUtils]: 11: Hoare triple {21897#true} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {21935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:01,192 INFO L273 TraceCheckUtils]: 12: Hoare triple {21935#(not (= (_ bv0 32) main_~p5~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {21935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:01,197 INFO L273 TraceCheckUtils]: 13: Hoare triple {21935#(not (= (_ bv0 32) main_~p5~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {21935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:01,197 INFO L273 TraceCheckUtils]: 14: Hoare triple {21935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p8~0); {21935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:01,197 INFO L273 TraceCheckUtils]: 15: Hoare triple {21935#(not (= (_ bv0 32) main_~p5~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {21935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:01,198 INFO L273 TraceCheckUtils]: 16: Hoare triple {21935#(not (= (_ bv0 32) main_~p5~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {21935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:01,198 INFO L273 TraceCheckUtils]: 17: Hoare triple {21935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p1~0); {21935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:01,199 INFO L273 TraceCheckUtils]: 18: Hoare triple {21935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p2~0); {21935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:01,199 INFO L273 TraceCheckUtils]: 19: Hoare triple {21935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p3~0); {21935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:01,199 INFO L273 TraceCheckUtils]: 20: Hoare triple {21935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p4~0); {21935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:01,200 INFO L273 TraceCheckUtils]: 21: Hoare triple {21935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p5~0); {21898#false} is VALID [2018-11-23 10:54:01,200 INFO L273 TraceCheckUtils]: 22: Hoare triple {21898#false} assume 0bv32 != ~p6~0; {21898#false} is VALID [2018-11-23 10:54:01,200 INFO L273 TraceCheckUtils]: 23: Hoare triple {21898#false} assume 1bv32 != ~lk6~0; {21898#false} is VALID [2018-11-23 10:54:01,200 INFO L273 TraceCheckUtils]: 24: Hoare triple {21898#false} assume !false; {21898#false} is VALID [2018-11-23 10:54:01,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:54:01,201 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:01,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:01,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:01,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:54:01,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:01,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:01,227 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-23 10:54:01,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:01,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:01,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:01,228 INFO L87 Difference]: Start difference. First operand 968 states and 1494 transitions. Second operand 3 states. [2018-11-23 10:54:02,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:02,320 INFO L93 Difference]: Finished difference Result 1452 states and 2232 transitions. [2018-11-23 10:54:02,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:02,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:54:02,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:02,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:02,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2018-11-23 10:54:02,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:02,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2018-11-23 10:54:02,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 174 transitions. [2018-11-23 10:54:02,495 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:02,538 INFO L225 Difference]: With dead ends: 1452 [2018-11-23 10:54:02,538 INFO L226 Difference]: Without dead ends: 986 [2018-11-23 10:54:02,540 INFO L631 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-23 10:54:02,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2018-11-23 10:54:02,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 984. [2018-11-23 10:54:02,905 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:02,905 INFO L82 GeneralOperation]: Start isEquivalent. First operand 986 states. Second operand 984 states. [2018-11-23 10:54:02,905 INFO L74 IsIncluded]: Start isIncluded. First operand 986 states. Second operand 984 states. [2018-11-23 10:54:02,906 INFO L87 Difference]: Start difference. First operand 986 states. Second operand 984 states. [2018-11-23 10:54:02,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:02,944 INFO L93 Difference]: Finished difference Result 986 states and 1495 transitions. [2018-11-23 10:54:02,944 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1495 transitions. [2018-11-23 10:54:02,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:02,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:02,945 INFO L74 IsIncluded]: Start isIncluded. First operand 984 states. Second operand 986 states. [2018-11-23 10:54:02,946 INFO L87 Difference]: Start difference. First operand 984 states. Second operand 986 states. [2018-11-23 10:54:02,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:02,991 INFO L93 Difference]: Finished difference Result 986 states and 1495 transitions. [2018-11-23 10:54:02,991 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1495 transitions. [2018-11-23 10:54:02,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:02,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:02,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:02,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:02,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2018-11-23 10:54:03,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1494 transitions. [2018-11-23 10:54:03,045 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1494 transitions. Word has length 25 [2018-11-23 10:54:03,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:03,045 INFO L480 AbstractCegarLoop]: Abstraction has 984 states and 1494 transitions. [2018-11-23 10:54:03,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:03,045 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1494 transitions. [2018-11-23 10:54:03,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 10:54:03,046 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:03,046 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:03,047 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:03,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:03,047 INFO L82 PathProgramCache]: Analyzing trace with hash -2100750599, now seen corresponding path program 1 times [2018-11-23 10:54:03,047 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:03,047 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-23 10:54:03,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:03,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:03,149 INFO L256 TraceCheckUtils]: 0: Hoare triple {26476#true} call ULTIMATE.init(); {26476#true} is VALID [2018-11-23 10:54:03,149 INFO L273 TraceCheckUtils]: 1: Hoare triple {26476#true} assume true; {26476#true} is VALID [2018-11-23 10:54:03,149 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {26476#true} {26476#true} #197#return; {26476#true} is VALID [2018-11-23 10:54:03,150 INFO L256 TraceCheckUtils]: 3: Hoare triple {26476#true} call #t~ret11 := main(); {26476#true} is VALID [2018-11-23 10:54:03,150 INFO L273 TraceCheckUtils]: 4: Hoare triple {26476#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;havoc ~cond~0; {26476#true} is VALID [2018-11-23 10:54:03,150 INFO L273 TraceCheckUtils]: 5: Hoare triple {26476#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {26476#true} is VALID [2018-11-23 10:54:03,150 INFO L273 TraceCheckUtils]: 6: Hoare triple {26476#true} assume !(0bv32 == ~cond~0);~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; {26476#true} is VALID [2018-11-23 10:54:03,150 INFO L273 TraceCheckUtils]: 7: Hoare triple {26476#true} assume !(0bv32 != ~p1~0); {26476#true} is VALID [2018-11-23 10:54:03,151 INFO L273 TraceCheckUtils]: 8: Hoare triple {26476#true} assume !(0bv32 != ~p2~0); {26476#true} is VALID [2018-11-23 10:54:03,151 INFO L273 TraceCheckUtils]: 9: Hoare triple {26476#true} assume !(0bv32 != ~p3~0); {26476#true} is VALID [2018-11-23 10:54:03,151 INFO L273 TraceCheckUtils]: 10: Hoare triple {26476#true} assume !(0bv32 != ~p4~0); {26476#true} is VALID [2018-11-23 10:54:03,152 INFO L273 TraceCheckUtils]: 11: Hoare triple {26476#true} assume !(0bv32 != ~p5~0); {26476#true} is VALID [2018-11-23 10:54:03,155 INFO L273 TraceCheckUtils]: 12: Hoare triple {26476#true} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {26517#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:03,155 INFO L273 TraceCheckUtils]: 13: Hoare triple {26517#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {26517#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:03,156 INFO L273 TraceCheckUtils]: 14: Hoare triple {26517#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {26517#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:03,156 INFO L273 TraceCheckUtils]: 15: Hoare triple {26517#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {26517#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:03,156 INFO L273 TraceCheckUtils]: 16: Hoare triple {26517#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {26517#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:03,157 INFO L273 TraceCheckUtils]: 17: Hoare triple {26517#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {26517#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:03,157 INFO L273 TraceCheckUtils]: 18: Hoare triple {26517#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {26517#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:03,157 INFO L273 TraceCheckUtils]: 19: Hoare triple {26517#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {26517#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:03,158 INFO L273 TraceCheckUtils]: 20: Hoare triple {26517#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {26517#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:03,158 INFO L273 TraceCheckUtils]: 21: Hoare triple {26517#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p5~0); {26517#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:03,159 INFO L273 TraceCheckUtils]: 22: Hoare triple {26517#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0; {26517#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:03,159 INFO L273 TraceCheckUtils]: 23: Hoare triple {26517#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk6~0; {26477#false} is VALID [2018-11-23 10:54:03,160 INFO L273 TraceCheckUtils]: 24: Hoare triple {26477#false} assume !false; {26477#false} is VALID [2018-11-23 10:54:03,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:54:03,161 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:03,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:03,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:03,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:54:03,164 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:03,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:03,188 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-23 10:54:03,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:03,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:03,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:03,189 INFO L87 Difference]: Start difference. First operand 984 states and 1494 transitions. Second operand 3 states. [2018-11-23 10:54:04,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:04,036 INFO L93 Difference]: Finished difference Result 1740 states and 2696 transitions. [2018-11-23 10:54:04,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:04,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:54:04,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:04,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:04,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2018-11-23 10:54:04,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:04,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2018-11-23 10:54:04,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2018-11-23 10:54:04,164 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:04,276 INFO L225 Difference]: With dead ends: 1740 [2018-11-23 10:54:04,277 INFO L226 Difference]: Without dead ends: 1738 [2018-11-23 10:54:04,277 INFO L631 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-23 10:54:04,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2018-11-23 10:54:04,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1416. [2018-11-23 10:54:04,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:04,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1738 states. Second operand 1416 states. [2018-11-23 10:54:04,751 INFO L74 IsIncluded]: Start isIncluded. First operand 1738 states. Second operand 1416 states. [2018-11-23 10:54:04,751 INFO L87 Difference]: Start difference. First operand 1738 states. Second operand 1416 states. [2018-11-23 10:54:04,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:04,845 INFO L93 Difference]: Finished difference Result 1738 states and 2663 transitions. [2018-11-23 10:54:04,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2663 transitions. [2018-11-23 10:54:04,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:04,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:04,847 INFO L74 IsIncluded]: Start isIncluded. First operand 1416 states. Second operand 1738 states. [2018-11-23 10:54:04,847 INFO L87 Difference]: Start difference. First operand 1416 states. Second operand 1738 states. [2018-11-23 10:54:04,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:04,954 INFO L93 Difference]: Finished difference Result 1738 states and 2663 transitions. [2018-11-23 10:54:04,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2663 transitions. [2018-11-23 10:54:04,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:04,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:04,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:04,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:04,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1416 states. [2018-11-23 10:54:05,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2086 transitions. [2018-11-23 10:54:05,026 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2086 transitions. Word has length 25 [2018-11-23 10:54:05,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:05,026 INFO L480 AbstractCegarLoop]: Abstraction has 1416 states and 2086 transitions. [2018-11-23 10:54:05,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:05,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2086 transitions. [2018-11-23 10:54:05,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 10:54:05,028 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:05,028 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:05,029 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:05,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:05,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1607410683, now seen corresponding path program 1 times [2018-11-23 10:54:05,029 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:05,029 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-23 10:54:05,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:05,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:05,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:05,132 INFO L256 TraceCheckUtils]: 0: Hoare triple {33295#true} call ULTIMATE.init(); {33295#true} is VALID [2018-11-23 10:54:05,132 INFO L273 TraceCheckUtils]: 1: Hoare triple {33295#true} assume true; {33295#true} is VALID [2018-11-23 10:54:05,132 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {33295#true} {33295#true} #197#return; {33295#true} is VALID [2018-11-23 10:54:05,133 INFO L256 TraceCheckUtils]: 3: Hoare triple {33295#true} call #t~ret11 := main(); {33295#true} is VALID [2018-11-23 10:54:05,133 INFO L273 TraceCheckUtils]: 4: Hoare triple {33295#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;havoc ~cond~0; {33295#true} is VALID [2018-11-23 10:54:05,133 INFO L273 TraceCheckUtils]: 5: Hoare triple {33295#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {33295#true} is VALID [2018-11-23 10:54:05,133 INFO L273 TraceCheckUtils]: 6: Hoare triple {33295#true} assume !(0bv32 == ~cond~0);~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; {33295#true} is VALID [2018-11-23 10:54:05,133 INFO L273 TraceCheckUtils]: 7: Hoare triple {33295#true} assume !(0bv32 != ~p1~0); {33295#true} is VALID [2018-11-23 10:54:05,134 INFO L273 TraceCheckUtils]: 8: Hoare triple {33295#true} assume !(0bv32 != ~p2~0); {33295#true} is VALID [2018-11-23 10:54:05,134 INFO L273 TraceCheckUtils]: 9: Hoare triple {33295#true} assume !(0bv32 != ~p3~0); {33295#true} is VALID [2018-11-23 10:54:05,134 INFO L273 TraceCheckUtils]: 10: Hoare triple {33295#true} assume !(0bv32 != ~p4~0); {33295#true} is VALID [2018-11-23 10:54:05,134 INFO L273 TraceCheckUtils]: 11: Hoare triple {33295#true} assume !(0bv32 != ~p5~0); {33295#true} is VALID [2018-11-23 10:54:05,135 INFO L273 TraceCheckUtils]: 12: Hoare triple {33295#true} assume !(0bv32 != ~p6~0); {33336#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:05,135 INFO L273 TraceCheckUtils]: 13: Hoare triple {33336#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {33336#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:05,135 INFO L273 TraceCheckUtils]: 14: Hoare triple {33336#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p8~0); {33336#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:05,136 INFO L273 TraceCheckUtils]: 15: Hoare triple {33336#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {33336#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:05,136 INFO L273 TraceCheckUtils]: 16: Hoare triple {33336#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {33336#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:05,140 INFO L273 TraceCheckUtils]: 17: Hoare triple {33336#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p1~0); {33336#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:05,140 INFO L273 TraceCheckUtils]: 18: Hoare triple {33336#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p2~0); {33336#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:05,141 INFO L273 TraceCheckUtils]: 19: Hoare triple {33336#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p3~0); {33336#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:05,141 INFO L273 TraceCheckUtils]: 20: Hoare triple {33336#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p4~0); {33336#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:05,141 INFO L273 TraceCheckUtils]: 21: Hoare triple {33336#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p5~0); {33336#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:05,142 INFO L273 TraceCheckUtils]: 22: Hoare triple {33336#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p6~0; {33296#false} is VALID [2018-11-23 10:54:05,143 INFO L273 TraceCheckUtils]: 23: Hoare triple {33296#false} assume 1bv32 != ~lk6~0; {33296#false} is VALID [2018-11-23 10:54:05,143 INFO L273 TraceCheckUtils]: 24: Hoare triple {33296#false} assume !false; {33296#false} is VALID [2018-11-23 10:54:05,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:54:05,144 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (18)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 10:54:05,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:05,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:05,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:54:05,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:05,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:05,176 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-23 10:54:05,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:05,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:05,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:05,177 INFO L87 Difference]: Start difference. First operand 1416 states and 2086 transitions. Second operand 3 states. [2018-11-23 10:54:06,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:06,521 INFO L93 Difference]: Finished difference Result 3276 states and 4840 transitions. [2018-11-23 10:54:06,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:06,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:54:06,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:06,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:06,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2018-11-23 10:54:06,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:06,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2018-11-23 10:54:06,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 176 transitions. [2018-11-23 10:54:06,768 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-23 10:54:06,906 INFO L225 Difference]: With dead ends: 3276 [2018-11-23 10:54:06,906 INFO L226 Difference]: Without dead ends: 1898 [2018-11-23 10:54:06,909 INFO L631 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-23 10:54:06,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2018-11-23 10:54:07,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1896. [2018-11-23 10:54:07,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:07,776 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1898 states. Second operand 1896 states. [2018-11-23 10:54:07,776 INFO L74 IsIncluded]: Start isIncluded. First operand 1898 states. Second operand 1896 states. [2018-11-23 10:54:07,777 INFO L87 Difference]: Start difference. First operand 1898 states. Second operand 1896 states. [2018-11-23 10:54:07,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:07,895 INFO L93 Difference]: Finished difference Result 1898 states and 2759 transitions. [2018-11-23 10:54:07,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2759 transitions. [2018-11-23 10:54:07,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:07,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:07,898 INFO L74 IsIncluded]: Start isIncluded. First operand 1896 states. Second operand 1898 states. [2018-11-23 10:54:07,898 INFO L87 Difference]: Start difference. First operand 1896 states. Second operand 1898 states. [2018-11-23 10:54:08,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:08,049 INFO L93 Difference]: Finished difference Result 1898 states and 2759 transitions. [2018-11-23 10:54:08,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2759 transitions. [2018-11-23 10:54:08,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:08,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:08,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:08,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:08,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2018-11-23 10:54:08,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2758 transitions. [2018-11-23 10:54:08,186 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2758 transitions. Word has length 25 [2018-11-23 10:54:08,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:08,187 INFO L480 AbstractCegarLoop]: Abstraction has 1896 states and 2758 transitions. [2018-11-23 10:54:08,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:08,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2758 transitions. [2018-11-23 10:54:08,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 10:54:08,188 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:08,189 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:08,189 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:08,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:08,191 INFO L82 PathProgramCache]: Analyzing trace with hash -698544044, now seen corresponding path program 1 times [2018-11-23 10:54:08,191 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:08,191 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-23 10:54:08,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:08,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:08,290 INFO L256 TraceCheckUtils]: 0: Hoare triple {42514#true} call ULTIMATE.init(); {42514#true} is VALID [2018-11-23 10:54:08,290 INFO L273 TraceCheckUtils]: 1: Hoare triple {42514#true} assume true; {42514#true} is VALID [2018-11-23 10:54:08,290 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {42514#true} {42514#true} #197#return; {42514#true} is VALID [2018-11-23 10:54:08,290 INFO L256 TraceCheckUtils]: 3: Hoare triple {42514#true} call #t~ret11 := main(); {42514#true} is VALID [2018-11-23 10:54:08,291 INFO L273 TraceCheckUtils]: 4: Hoare triple {42514#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;havoc ~cond~0; {42514#true} is VALID [2018-11-23 10:54:08,291 INFO L273 TraceCheckUtils]: 5: Hoare triple {42514#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {42514#true} is VALID [2018-11-23 10:54:08,291 INFO L273 TraceCheckUtils]: 6: Hoare triple {42514#true} assume !(0bv32 == ~cond~0);~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; {42514#true} is VALID [2018-11-23 10:54:08,291 INFO L273 TraceCheckUtils]: 7: Hoare triple {42514#true} assume !(0bv32 != ~p1~0); {42514#true} is VALID [2018-11-23 10:54:08,291 INFO L273 TraceCheckUtils]: 8: Hoare triple {42514#true} assume !(0bv32 != ~p2~0); {42514#true} is VALID [2018-11-23 10:54:08,292 INFO L273 TraceCheckUtils]: 9: Hoare triple {42514#true} assume !(0bv32 != ~p3~0); {42514#true} is VALID [2018-11-23 10:54:08,292 INFO L273 TraceCheckUtils]: 10: Hoare triple {42514#true} assume !(0bv32 != ~p4~0); {42514#true} is VALID [2018-11-23 10:54:08,292 INFO L273 TraceCheckUtils]: 11: Hoare triple {42514#true} assume !(0bv32 != ~p5~0); {42514#true} is VALID [2018-11-23 10:54:08,292 INFO L273 TraceCheckUtils]: 12: Hoare triple {42514#true} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {42555#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:08,293 INFO L273 TraceCheckUtils]: 13: Hoare triple {42555#(not (= (_ bv0 32) main_~p6~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {42555#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:08,305 INFO L273 TraceCheckUtils]: 14: Hoare triple {42555#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p8~0); {42555#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:08,307 INFO L273 TraceCheckUtils]: 15: Hoare triple {42555#(not (= (_ bv0 32) main_~p6~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {42555#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:08,307 INFO L273 TraceCheckUtils]: 16: Hoare triple {42555#(not (= (_ bv0 32) main_~p6~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {42555#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:08,310 INFO L273 TraceCheckUtils]: 17: Hoare triple {42555#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p1~0); {42555#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:08,310 INFO L273 TraceCheckUtils]: 18: Hoare triple {42555#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p2~0); {42555#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:08,310 INFO L273 TraceCheckUtils]: 19: Hoare triple {42555#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p3~0); {42555#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:08,311 INFO L273 TraceCheckUtils]: 20: Hoare triple {42555#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p4~0); {42555#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:08,311 INFO L273 TraceCheckUtils]: 21: Hoare triple {42555#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p5~0); {42555#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:08,311 INFO L273 TraceCheckUtils]: 22: Hoare triple {42555#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p6~0); {42515#false} is VALID [2018-11-23 10:54:08,312 INFO L273 TraceCheckUtils]: 23: Hoare triple {42515#false} assume 0bv32 != ~p7~0; {42515#false} is VALID [2018-11-23 10:54:08,312 INFO L273 TraceCheckUtils]: 24: Hoare triple {42515#false} assume 1bv32 != ~lk7~0; {42515#false} is VALID [2018-11-23 10:54:08,312 INFO L273 TraceCheckUtils]: 25: Hoare triple {42515#false} assume !false; {42515#false} is VALID [2018-11-23 10:54:08,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:54:08,313 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:08,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:08,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:08,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 10:54:08,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:08,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:08,341 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-23 10:54:08,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:08,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:08,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:08,342 INFO L87 Difference]: Start difference. First operand 1896 states and 2758 transitions. Second operand 3 states. [2018-11-23 10:54:09,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:09,665 INFO L93 Difference]: Finished difference Result 2844 states and 4120 transitions. [2018-11-23 10:54:09,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:09,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 10:54:09,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:09,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:09,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2018-11-23 10:54:09,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:09,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2018-11-23 10:54:09,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 171 transitions. [2018-11-23 10:54:09,844 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:09,989 INFO L225 Difference]: With dead ends: 2844 [2018-11-23 10:54:09,989 INFO L226 Difference]: Without dead ends: 1930 [2018-11-23 10:54:09,991 INFO L631 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-23 10:54:09,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2018-11-23 10:54:10,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1928. [2018-11-23 10:54:10,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:10,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1930 states. Second operand 1928 states. [2018-11-23 10:54:10,470 INFO L74 IsIncluded]: Start isIncluded. First operand 1930 states. Second operand 1928 states. [2018-11-23 10:54:10,470 INFO L87 Difference]: Start difference. First operand 1930 states. Second operand 1928 states. [2018-11-23 10:54:10,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:10,604 INFO L93 Difference]: Finished difference Result 1930 states and 2759 transitions. [2018-11-23 10:54:10,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 2759 transitions. [2018-11-23 10:54:10,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:10,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:10,607 INFO L74 IsIncluded]: Start isIncluded. First operand 1928 states. Second operand 1930 states. [2018-11-23 10:54:10,607 INFO L87 Difference]: Start difference. First operand 1928 states. Second operand 1930 states. [2018-11-23 10:54:10,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:10,719 INFO L93 Difference]: Finished difference Result 1930 states and 2759 transitions. [2018-11-23 10:54:10,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 2759 transitions. [2018-11-23 10:54:10,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:10,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:10,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:10,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:10,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-11-23 10:54:10,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2758 transitions. [2018-11-23 10:54:10,848 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2758 transitions. Word has length 26 [2018-11-23 10:54:10,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:10,849 INFO L480 AbstractCegarLoop]: Abstraction has 1928 states and 2758 transitions. [2018-11-23 10:54:10,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:10,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2758 transitions. [2018-11-23 10:54:10,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 10:54:10,851 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:10,851 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:10,851 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:10,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:10,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1709661294, now seen corresponding path program 1 times [2018-11-23 10:54:10,852 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:10,852 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-23 10:54:10,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:10,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:11,043 INFO L256 TraceCheckUtils]: 0: Hoare triple {51400#true} call ULTIMATE.init(); {51400#true} is VALID [2018-11-23 10:54:11,043 INFO L273 TraceCheckUtils]: 1: Hoare triple {51400#true} assume true; {51400#true} is VALID [2018-11-23 10:54:11,044 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {51400#true} {51400#true} #197#return; {51400#true} is VALID [2018-11-23 10:54:11,044 INFO L256 TraceCheckUtils]: 3: Hoare triple {51400#true} call #t~ret11 := main(); {51400#true} is VALID [2018-11-23 10:54:11,044 INFO L273 TraceCheckUtils]: 4: Hoare triple {51400#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;havoc ~cond~0; {51400#true} is VALID [2018-11-23 10:54:11,045 INFO L273 TraceCheckUtils]: 5: Hoare triple {51400#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {51400#true} is VALID [2018-11-23 10:54:11,045 INFO L273 TraceCheckUtils]: 6: Hoare triple {51400#true} assume !(0bv32 == ~cond~0);~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; {51400#true} is VALID [2018-11-23 10:54:11,045 INFO L273 TraceCheckUtils]: 7: Hoare triple {51400#true} assume !(0bv32 != ~p1~0); {51400#true} is VALID [2018-11-23 10:54:11,046 INFO L273 TraceCheckUtils]: 8: Hoare triple {51400#true} assume !(0bv32 != ~p2~0); {51400#true} is VALID [2018-11-23 10:54:11,046 INFO L273 TraceCheckUtils]: 9: Hoare triple {51400#true} assume !(0bv32 != ~p3~0); {51400#true} is VALID [2018-11-23 10:54:11,046 INFO L273 TraceCheckUtils]: 10: Hoare triple {51400#true} assume !(0bv32 != ~p4~0); {51400#true} is VALID [2018-11-23 10:54:11,046 INFO L273 TraceCheckUtils]: 11: Hoare triple {51400#true} assume !(0bv32 != ~p5~0); {51400#true} is VALID [2018-11-23 10:54:11,046 INFO L273 TraceCheckUtils]: 12: Hoare triple {51400#true} assume !(0bv32 != ~p6~0); {51400#true} is VALID [2018-11-23 10:54:11,047 INFO L273 TraceCheckUtils]: 13: Hoare triple {51400#true} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {51444#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:11,047 INFO L273 TraceCheckUtils]: 14: Hoare triple {51444#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {51444#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:11,047 INFO L273 TraceCheckUtils]: 15: Hoare triple {51444#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {51444#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:11,048 INFO L273 TraceCheckUtils]: 16: Hoare triple {51444#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {51444#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:11,048 INFO L273 TraceCheckUtils]: 17: Hoare triple {51444#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {51444#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:11,048 INFO L273 TraceCheckUtils]: 18: Hoare triple {51444#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {51444#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:11,049 INFO L273 TraceCheckUtils]: 19: Hoare triple {51444#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {51444#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:11,049 INFO L273 TraceCheckUtils]: 20: Hoare triple {51444#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {51444#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:11,049 INFO L273 TraceCheckUtils]: 21: Hoare triple {51444#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p5~0); {51444#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:11,050 INFO L273 TraceCheckUtils]: 22: Hoare triple {51444#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p6~0); {51444#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:11,050 INFO L273 TraceCheckUtils]: 23: Hoare triple {51444#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0; {51444#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:11,050 INFO L273 TraceCheckUtils]: 24: Hoare triple {51444#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk7~0; {51401#false} is VALID [2018-11-23 10:54:11,051 INFO L273 TraceCheckUtils]: 25: Hoare triple {51401#false} assume !false; {51401#false} is VALID [2018-11-23 10:54:11,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:54:11,052 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:11,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:11,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:11,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 10:54:11,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:11,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:11,079 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-23 10:54:11,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:11,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:11,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:11,080 INFO L87 Difference]: Start difference. First operand 1928 states and 2758 transitions. Second operand 3 states. [2018-11-23 10:54:12,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:12,890 INFO L93 Difference]: Finished difference Result 3340 states and 4872 transitions. [2018-11-23 10:54:12,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:12,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 10:54:12,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:12,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:12,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2018-11-23 10:54:12,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:12,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2018-11-23 10:54:12,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 106 transitions. [2018-11-23 10:54:13,014 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:13,444 INFO L225 Difference]: With dead ends: 3340 [2018-11-23 10:54:13,444 INFO L226 Difference]: Without dead ends: 3338 [2018-11-23 10:54:13,445 INFO L631 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-23 10:54:13,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2018-11-23 10:54:14,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 2824. [2018-11-23 10:54:14,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:14,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3338 states. Second operand 2824 states. [2018-11-23 10:54:14,341 INFO L74 IsIncluded]: Start isIncluded. First operand 3338 states. Second operand 2824 states. [2018-11-23 10:54:14,341 INFO L87 Difference]: Start difference. First operand 3338 states. Second operand 2824 states. [2018-11-23 10:54:14,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:14,753 INFO L93 Difference]: Finished difference Result 3338 states and 4807 transitions. [2018-11-23 10:54:14,753 INFO L276 IsEmpty]: Start isEmpty. Operand 3338 states and 4807 transitions. [2018-11-23 10:54:14,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:14,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:14,757 INFO L74 IsIncluded]: Start isIncluded. First operand 2824 states. Second operand 3338 states. [2018-11-23 10:54:14,757 INFO L87 Difference]: Start difference. First operand 2824 states. Second operand 3338 states. [2018-11-23 10:54:15,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:15,167 INFO L93 Difference]: Finished difference Result 3338 states and 4807 transitions. [2018-11-23 10:54:15,167 INFO L276 IsEmpty]: Start isEmpty. Operand 3338 states and 4807 transitions. [2018-11-23 10:54:15,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:15,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:15,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:15,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:15,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2824 states. [2018-11-23 10:54:15,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2824 states and 3910 transitions. [2018-11-23 10:54:15,437 INFO L78 Accepts]: Start accepts. Automaton has 2824 states and 3910 transitions. Word has length 26 [2018-11-23 10:54:15,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:15,437 INFO L480 AbstractCegarLoop]: Abstraction has 2824 states and 3910 transitions. [2018-11-23 10:54:15,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:15,438 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 3910 transitions. [2018-11-23 10:54:15,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 10:54:15,440 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:15,440 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:15,440 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:15,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:15,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1998499988, now seen corresponding path program 1 times [2018-11-23 10:54:15,441 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:15,441 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-23 10:54:15,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:15,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:15,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:15,698 INFO L256 TraceCheckUtils]: 0: Hoare triple {64526#true} call ULTIMATE.init(); {64526#true} is VALID [2018-11-23 10:54:15,698 INFO L273 TraceCheckUtils]: 1: Hoare triple {64526#true} assume true; {64526#true} is VALID [2018-11-23 10:54:15,698 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {64526#true} {64526#true} #197#return; {64526#true} is VALID [2018-11-23 10:54:15,699 INFO L256 TraceCheckUtils]: 3: Hoare triple {64526#true} call #t~ret11 := main(); {64526#true} is VALID [2018-11-23 10:54:15,699 INFO L273 TraceCheckUtils]: 4: Hoare triple {64526#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;havoc ~cond~0; {64526#true} is VALID [2018-11-23 10:54:15,699 INFO L273 TraceCheckUtils]: 5: Hoare triple {64526#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {64526#true} is VALID [2018-11-23 10:54:15,700 INFO L273 TraceCheckUtils]: 6: Hoare triple {64526#true} assume !(0bv32 == ~cond~0);~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; {64526#true} is VALID [2018-11-23 10:54:15,700 INFO L273 TraceCheckUtils]: 7: Hoare triple {64526#true} assume !(0bv32 != ~p1~0); {64526#true} is VALID [2018-11-23 10:54:15,700 INFO L273 TraceCheckUtils]: 8: Hoare triple {64526#true} assume !(0bv32 != ~p2~0); {64526#true} is VALID [2018-11-23 10:54:15,701 INFO L273 TraceCheckUtils]: 9: Hoare triple {64526#true} assume !(0bv32 != ~p3~0); {64526#true} is VALID [2018-11-23 10:54:15,701 INFO L273 TraceCheckUtils]: 10: Hoare triple {64526#true} assume !(0bv32 != ~p4~0); {64526#true} is VALID [2018-11-23 10:54:15,701 INFO L273 TraceCheckUtils]: 11: Hoare triple {64526#true} assume !(0bv32 != ~p5~0); {64526#true} is VALID [2018-11-23 10:54:15,701 INFO L273 TraceCheckUtils]: 12: Hoare triple {64526#true} assume !(0bv32 != ~p6~0); {64526#true} is VALID [2018-11-23 10:54:15,702 INFO L273 TraceCheckUtils]: 13: Hoare triple {64526#true} assume !(0bv32 != ~p7~0); {64570#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:15,702 INFO L273 TraceCheckUtils]: 14: Hoare triple {64570#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p8~0); {64570#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:15,702 INFO L273 TraceCheckUtils]: 15: Hoare triple {64570#(= (_ bv0 32) main_~p7~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {64570#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:15,703 INFO L273 TraceCheckUtils]: 16: Hoare triple {64570#(= (_ bv0 32) main_~p7~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {64570#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:15,703 INFO L273 TraceCheckUtils]: 17: Hoare triple {64570#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p1~0); {64570#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:15,703 INFO L273 TraceCheckUtils]: 18: Hoare triple {64570#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p2~0); {64570#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:15,704 INFO L273 TraceCheckUtils]: 19: Hoare triple {64570#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p3~0); {64570#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:15,704 INFO L273 TraceCheckUtils]: 20: Hoare triple {64570#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p4~0); {64570#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:15,704 INFO L273 TraceCheckUtils]: 21: Hoare triple {64570#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p5~0); {64570#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:15,705 INFO L273 TraceCheckUtils]: 22: Hoare triple {64570#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p6~0); {64570#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:15,705 INFO L273 TraceCheckUtils]: 23: Hoare triple {64570#(= (_ bv0 32) main_~p7~0)} assume 0bv32 != ~p7~0; {64527#false} is VALID [2018-11-23 10:54:15,705 INFO L273 TraceCheckUtils]: 24: Hoare triple {64527#false} assume 1bv32 != ~lk7~0; {64527#false} is VALID [2018-11-23 10:54:15,705 INFO L273 TraceCheckUtils]: 25: Hoare triple {64527#false} assume !false; {64527#false} is VALID [2018-11-23 10:54:15,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:54:15,706 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:15,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:15,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:15,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 10:54:15,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:15,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:15,732 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-23 10:54:15,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:15,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:15,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:15,733 INFO L87 Difference]: Start difference. First operand 2824 states and 3910 transitions. Second operand 3 states. [2018-11-23 10:54:19,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:19,159 INFO L93 Difference]: Finished difference Result 6476 states and 8968 transitions. [2018-11-23 10:54:19,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:19,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 10:54:19,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:19,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:19,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2018-11-23 10:54:19,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:19,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2018-11-23 10:54:19,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 173 transitions. [2018-11-23 10:54:19,342 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:19,942 INFO L225 Difference]: With dead ends: 6476 [2018-11-23 10:54:19,942 INFO L226 Difference]: Without dead ends: 3722 [2018-11-23 10:54:19,946 INFO L631 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-23 10:54:19,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2018-11-23 10:54:21,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3720. [2018-11-23 10:54:21,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:21,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3722 states. Second operand 3720 states. [2018-11-23 10:54:21,293 INFO L74 IsIncluded]: Start isIncluded. First operand 3722 states. Second operand 3720 states. [2018-11-23 10:54:21,294 INFO L87 Difference]: Start difference. First operand 3722 states. Second operand 3720 states. [2018-11-23 10:54:21,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:21,796 INFO L93 Difference]: Finished difference Result 3722 states and 5063 transitions. [2018-11-23 10:54:21,796 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 5063 transitions. [2018-11-23 10:54:21,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:21,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:21,801 INFO L74 IsIncluded]: Start isIncluded. First operand 3720 states. Second operand 3722 states. [2018-11-23 10:54:21,801 INFO L87 Difference]: Start difference. First operand 3720 states. Second operand 3722 states. [2018-11-23 10:54:22,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:22,327 INFO L93 Difference]: Finished difference Result 3722 states and 5063 transitions. [2018-11-23 10:54:22,327 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 5063 transitions. [2018-11-23 10:54:22,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:22,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:22,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:22,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:22,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3720 states. [2018-11-23 10:54:22,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3720 states to 3720 states and 5062 transitions. [2018-11-23 10:54:22,904 INFO L78 Accepts]: Start accepts. Automaton has 3720 states and 5062 transitions. Word has length 26 [2018-11-23 10:54:22,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:22,904 INFO L480 AbstractCegarLoop]: Abstraction has 3720 states and 5062 transitions. [2018-11-23 10:54:22,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:22,904 INFO L276 IsEmpty]: Start isEmpty. Operand 3720 states and 5062 transitions. [2018-11-23 10:54:22,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 10:54:22,907 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:22,907 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:22,907 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:22,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:22,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1459677136, now seen corresponding path program 1 times [2018-11-23 10:54:22,907 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:22,908 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-23 10:54:22,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:22,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:23,007 INFO L256 TraceCheckUtils]: 0: Hoare triple {82580#true} call ULTIMATE.init(); {82580#true} is VALID [2018-11-23 10:54:23,007 INFO L273 TraceCheckUtils]: 1: Hoare triple {82580#true} assume true; {82580#true} is VALID [2018-11-23 10:54:23,007 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {82580#true} {82580#true} #197#return; {82580#true} is VALID [2018-11-23 10:54:23,008 INFO L256 TraceCheckUtils]: 3: Hoare triple {82580#true} call #t~ret11 := main(); {82580#true} is VALID [2018-11-23 10:54:23,008 INFO L273 TraceCheckUtils]: 4: Hoare triple {82580#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;havoc ~cond~0; {82580#true} is VALID [2018-11-23 10:54:23,008 INFO L273 TraceCheckUtils]: 5: Hoare triple {82580#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {82580#true} is VALID [2018-11-23 10:54:23,008 INFO L273 TraceCheckUtils]: 6: Hoare triple {82580#true} assume !(0bv32 == ~cond~0);~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; {82580#true} is VALID [2018-11-23 10:54:23,008 INFO L273 TraceCheckUtils]: 7: Hoare triple {82580#true} assume !(0bv32 != ~p1~0); {82580#true} is VALID [2018-11-23 10:54:23,009 INFO L273 TraceCheckUtils]: 8: Hoare triple {82580#true} assume !(0bv32 != ~p2~0); {82580#true} is VALID [2018-11-23 10:54:23,009 INFO L273 TraceCheckUtils]: 9: Hoare triple {82580#true} assume !(0bv32 != ~p3~0); {82580#true} is VALID [2018-11-23 10:54:23,009 INFO L273 TraceCheckUtils]: 10: Hoare triple {82580#true} assume !(0bv32 != ~p4~0); {82580#true} is VALID [2018-11-23 10:54:23,009 INFO L273 TraceCheckUtils]: 11: Hoare triple {82580#true} assume !(0bv32 != ~p5~0); {82580#true} is VALID [2018-11-23 10:54:23,009 INFO L273 TraceCheckUtils]: 12: Hoare triple {82580#true} assume !(0bv32 != ~p6~0); {82580#true} is VALID [2018-11-23 10:54:23,010 INFO L273 TraceCheckUtils]: 13: Hoare triple {82580#true} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {82624#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:54:23,010 INFO L273 TraceCheckUtils]: 14: Hoare triple {82624#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p8~0); {82624#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:54:23,011 INFO L273 TraceCheckUtils]: 15: Hoare triple {82624#(not (= (_ bv0 32) main_~p7~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {82624#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:54:23,011 INFO L273 TraceCheckUtils]: 16: Hoare triple {82624#(not (= (_ bv0 32) main_~p7~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {82624#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:54:23,011 INFO L273 TraceCheckUtils]: 17: Hoare triple {82624#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p1~0); {82624#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:54:23,012 INFO L273 TraceCheckUtils]: 18: Hoare triple {82624#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p2~0); {82624#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:54:23,012 INFO L273 TraceCheckUtils]: 19: Hoare triple {82624#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p3~0); {82624#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:54:23,012 INFO L273 TraceCheckUtils]: 20: Hoare triple {82624#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p4~0); {82624#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:54:23,013 INFO L273 TraceCheckUtils]: 21: Hoare triple {82624#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p5~0); {82624#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:54:23,013 INFO L273 TraceCheckUtils]: 22: Hoare triple {82624#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p6~0); {82624#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:54:23,013 INFO L273 TraceCheckUtils]: 23: Hoare triple {82624#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p7~0); {82581#false} is VALID [2018-11-23 10:54:23,014 INFO L273 TraceCheckUtils]: 24: Hoare triple {82581#false} assume 0bv32 != ~p8~0; {82581#false} is VALID [2018-11-23 10:54:23,014 INFO L273 TraceCheckUtils]: 25: Hoare triple {82581#false} assume 1bv32 != ~lk8~0; {82581#false} is VALID [2018-11-23 10:54:23,014 INFO L273 TraceCheckUtils]: 26: Hoare triple {82581#false} assume !false; {82581#false} is VALID [2018-11-23 10:54:23,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:54:23,015 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:23,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:23,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:23,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 10:54:23,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:23,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:23,042 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-23 10:54:23,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:23,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:23,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:23,043 INFO L87 Difference]: Start difference. First operand 3720 states and 5062 transitions. Second operand 3 states. [2018-11-23 10:54:26,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:26,175 INFO L93 Difference]: Finished difference Result 5580 states and 7560 transitions. [2018-11-23 10:54:26,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:26,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 10:54:26,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:26,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:26,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2018-11-23 10:54:26,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:26,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2018-11-23 10:54:26,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 168 transitions. [2018-11-23 10:54:26,354 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:27,028 INFO L225 Difference]: With dead ends: 5580 [2018-11-23 10:54:27,029 INFO L226 Difference]: Without dead ends: 3786 [2018-11-23 10:54:27,032 INFO L631 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-23 10:54:27,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2018-11-23 10:54:29,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2018-11-23 10:54:29,327 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:29,327 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3786 states. Second operand 3784 states. [2018-11-23 10:54:29,327 INFO L74 IsIncluded]: Start isIncluded. First operand 3786 states. Second operand 3784 states. [2018-11-23 10:54:29,328 INFO L87 Difference]: Start difference. First operand 3786 states. Second operand 3784 states. [2018-11-23 10:54:29,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:29,854 INFO L93 Difference]: Finished difference Result 3786 states and 5063 transitions. [2018-11-23 10:54:29,854 INFO L276 IsEmpty]: Start isEmpty. Operand 3786 states and 5063 transitions. [2018-11-23 10:54:29,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:29,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:29,859 INFO L74 IsIncluded]: Start isIncluded. First operand 3784 states. Second operand 3786 states. [2018-11-23 10:54:29,859 INFO L87 Difference]: Start difference. First operand 3784 states. Second operand 3786 states. [2018-11-23 10:54:30,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:30,386 INFO L93 Difference]: Finished difference Result 3786 states and 5063 transitions. [2018-11-23 10:54:30,386 INFO L276 IsEmpty]: Start isEmpty. Operand 3786 states and 5063 transitions. [2018-11-23 10:54:30,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:30,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:30,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:30,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:30,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2018-11-23 10:54:30,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5062 transitions. [2018-11-23 10:54:30,952 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5062 transitions. Word has length 27 [2018-11-23 10:54:30,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:30,952 INFO L480 AbstractCegarLoop]: Abstraction has 3784 states and 5062 transitions. [2018-11-23 10:54:30,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:30,953 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5062 transitions. [2018-11-23 10:54:30,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 10:54:30,955 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:30,955 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:30,956 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:30,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:30,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1824172910, now seen corresponding path program 1 times [2018-11-23 10:54:30,956 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:30,956 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-23 10:54:30,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:30,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:30,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:31,049 INFO L256 TraceCheckUtils]: 0: Hoare triple {99933#true} call ULTIMATE.init(); {99933#true} is VALID [2018-11-23 10:54:31,049 INFO L273 TraceCheckUtils]: 1: Hoare triple {99933#true} assume true; {99933#true} is VALID [2018-11-23 10:54:31,050 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {99933#true} {99933#true} #197#return; {99933#true} is VALID [2018-11-23 10:54:31,050 INFO L256 TraceCheckUtils]: 3: Hoare triple {99933#true} call #t~ret11 := main(); {99933#true} is VALID [2018-11-23 10:54:31,050 INFO L273 TraceCheckUtils]: 4: Hoare triple {99933#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;havoc ~cond~0; {99933#true} is VALID [2018-11-23 10:54:31,050 INFO L273 TraceCheckUtils]: 5: Hoare triple {99933#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {99933#true} is VALID [2018-11-23 10:54:31,050 INFO L273 TraceCheckUtils]: 6: Hoare triple {99933#true} assume !(0bv32 == ~cond~0);~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; {99933#true} is VALID [2018-11-23 10:54:31,050 INFO L273 TraceCheckUtils]: 7: Hoare triple {99933#true} assume !(0bv32 != ~p1~0); {99933#true} is VALID [2018-11-23 10:54:31,051 INFO L273 TraceCheckUtils]: 8: Hoare triple {99933#true} assume !(0bv32 != ~p2~0); {99933#true} is VALID [2018-11-23 10:54:31,051 INFO L273 TraceCheckUtils]: 9: Hoare triple {99933#true} assume !(0bv32 != ~p3~0); {99933#true} is VALID [2018-11-23 10:54:31,051 INFO L273 TraceCheckUtils]: 10: Hoare triple {99933#true} assume !(0bv32 != ~p4~0); {99933#true} is VALID [2018-11-23 10:54:31,051 INFO L273 TraceCheckUtils]: 11: Hoare triple {99933#true} assume !(0bv32 != ~p5~0); {99933#true} is VALID [2018-11-23 10:54:31,051 INFO L273 TraceCheckUtils]: 12: Hoare triple {99933#true} assume !(0bv32 != ~p6~0); {99933#true} is VALID [2018-11-23 10:54:31,052 INFO L273 TraceCheckUtils]: 13: Hoare triple {99933#true} assume !(0bv32 != ~p7~0); {99933#true} is VALID [2018-11-23 10:54:31,053 INFO L273 TraceCheckUtils]: 14: Hoare triple {99933#true} assume !(0bv32 != ~p8~0); {99980#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:54:31,053 INFO L273 TraceCheckUtils]: 15: Hoare triple {99980#(= (_ bv0 32) main_~p8~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {99980#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:54:31,056 INFO L273 TraceCheckUtils]: 16: Hoare triple {99980#(= (_ bv0 32) main_~p8~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {99980#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:54:31,056 INFO L273 TraceCheckUtils]: 17: Hoare triple {99980#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p1~0); {99980#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:54:31,058 INFO L273 TraceCheckUtils]: 18: Hoare triple {99980#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p2~0); {99980#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:54:31,058 INFO L273 TraceCheckUtils]: 19: Hoare triple {99980#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p3~0); {99980#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:54:31,058 INFO L273 TraceCheckUtils]: 20: Hoare triple {99980#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p4~0); {99980#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:54:31,059 INFO L273 TraceCheckUtils]: 21: Hoare triple {99980#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p5~0); {99980#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:54:31,073 INFO L273 TraceCheckUtils]: 22: Hoare triple {99980#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p6~0); {99980#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:54:31,074 INFO L273 TraceCheckUtils]: 23: Hoare triple {99980#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p7~0); {99980#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:54:31,075 INFO L273 TraceCheckUtils]: 24: Hoare triple {99980#(= (_ bv0 32) main_~p8~0)} assume 0bv32 != ~p8~0; {99934#false} is VALID [2018-11-23 10:54:31,075 INFO L273 TraceCheckUtils]: 25: Hoare triple {99934#false} assume 1bv32 != ~lk8~0; {99934#false} is VALID [2018-11-23 10:54:31,075 INFO L273 TraceCheckUtils]: 26: Hoare triple {99934#false} assume !false; {99934#false} is VALID [2018-11-23 10:54:31,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:54:31,075 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:31,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:31,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:31,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 10:54:31,077 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:31,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:31,100 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-23 10:54:31,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:31,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:31,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:31,101 INFO L87 Difference]: Start difference. First operand 3784 states and 5062 transitions. Second operand 3 states. [2018-11-23 10:54:39,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:39,021 INFO L93 Difference]: Finished difference Result 10956 states and 14408 transitions. [2018-11-23 10:54:39,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:39,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 10:54:39,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:39,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:39,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2018-11-23 10:54:39,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:39,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2018-11-23 10:54:39,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 171 transitions. [2018-11-23 10:54:39,201 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:41,771 INFO L225 Difference]: With dead ends: 10956 [2018-11-23 10:54:41,771 INFO L226 Difference]: Without dead ends: 7306 [2018-11-23 10:54:41,777 INFO L631 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-23 10:54:41,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2018-11-23 10:54:45,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 7304. [2018-11-23 10:54:45,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:45,631 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7306 states. Second operand 7304 states. [2018-11-23 10:54:45,631 INFO L74 IsIncluded]: Start isIncluded. First operand 7306 states. Second operand 7304 states. [2018-11-23 10:54:45,631 INFO L87 Difference]: Start difference. First operand 7306 states. Second operand 7304 states. [2018-11-23 10:54:47,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:47,539 INFO L93 Difference]: Finished difference Result 7306 states and 9351 transitions. [2018-11-23 10:54:47,540 INFO L276 IsEmpty]: Start isEmpty. Operand 7306 states and 9351 transitions. [2018-11-23 10:54:47,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:47,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:47,548 INFO L74 IsIncluded]: Start isIncluded. First operand 7304 states. Second operand 7306 states. [2018-11-23 10:54:47,548 INFO L87 Difference]: Start difference. First operand 7304 states. Second operand 7306 states. [2018-11-23 10:54:49,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:49,569 INFO L93 Difference]: Finished difference Result 7306 states and 9351 transitions. [2018-11-23 10:54:49,570 INFO L276 IsEmpty]: Start isEmpty. Operand 7306 states and 9351 transitions. [2018-11-23 10:54:49,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:49,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:49,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:49,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:49,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2018-11-23 10:54:51,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9350 transitions. [2018-11-23 10:54:51,736 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9350 transitions. Word has length 27 [2018-11-23 10:54:51,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:51,737 INFO L480 AbstractCegarLoop]: Abstraction has 7304 states and 9350 transitions. [2018-11-23 10:54:51,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:51,737 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9350 transitions. [2018-11-23 10:54:51,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 10:54:51,740 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:51,740 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:51,740 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:51,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:51,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1883988372, now seen corresponding path program 1 times [2018-11-23 10:54:51,741 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:51,741 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 24 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 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:54:51,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:51,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:51,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:51,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:51,830 INFO L256 TraceCheckUtils]: 0: Hoare triple {133542#true} call ULTIMATE.init(); {133542#true} is VALID [2018-11-23 10:54:51,830 INFO L273 TraceCheckUtils]: 1: Hoare triple {133542#true} assume true; {133542#true} is VALID [2018-11-23 10:54:51,831 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {133542#true} {133542#true} #197#return; {133542#true} is VALID [2018-11-23 10:54:51,831 INFO L256 TraceCheckUtils]: 3: Hoare triple {133542#true} call #t~ret11 := main(); {133542#true} is VALID [2018-11-23 10:54:51,831 INFO L273 TraceCheckUtils]: 4: Hoare triple {133542#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;havoc ~cond~0; {133542#true} is VALID [2018-11-23 10:54:51,831 INFO L273 TraceCheckUtils]: 5: Hoare triple {133542#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {133542#true} is VALID [2018-11-23 10:54:51,831 INFO L273 TraceCheckUtils]: 6: Hoare triple {133542#true} assume !(0bv32 == ~cond~0);~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; {133542#true} is VALID [2018-11-23 10:54:51,832 INFO L273 TraceCheckUtils]: 7: Hoare triple {133542#true} assume !(0bv32 != ~p1~0); {133542#true} is VALID [2018-11-23 10:54:51,832 INFO L273 TraceCheckUtils]: 8: Hoare triple {133542#true} assume !(0bv32 != ~p2~0); {133542#true} is VALID [2018-11-23 10:54:51,832 INFO L273 TraceCheckUtils]: 9: Hoare triple {133542#true} assume !(0bv32 != ~p3~0); {133542#true} is VALID [2018-11-23 10:54:51,832 INFO L273 TraceCheckUtils]: 10: Hoare triple {133542#true} assume !(0bv32 != ~p4~0); {133542#true} is VALID [2018-11-23 10:54:51,832 INFO L273 TraceCheckUtils]: 11: Hoare triple {133542#true} assume !(0bv32 != ~p5~0); {133542#true} is VALID [2018-11-23 10:54:51,832 INFO L273 TraceCheckUtils]: 12: Hoare triple {133542#true} assume !(0bv32 != ~p6~0); {133542#true} is VALID [2018-11-23 10:54:51,833 INFO L273 TraceCheckUtils]: 13: Hoare triple {133542#true} assume !(0bv32 != ~p7~0); {133542#true} is VALID [2018-11-23 10:54:51,834 INFO L273 TraceCheckUtils]: 14: Hoare triple {133542#true} assume 0bv32 != ~p8~0;~lk8~0 := 1bv32; {133589#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,834 INFO L273 TraceCheckUtils]: 15: Hoare triple {133589#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {133589#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,837 INFO L273 TraceCheckUtils]: 16: Hoare triple {133589#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {133589#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,837 INFO L273 TraceCheckUtils]: 17: Hoare triple {133589#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {133589#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,840 INFO L273 TraceCheckUtils]: 18: Hoare triple {133589#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {133589#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,840 INFO L273 TraceCheckUtils]: 19: Hoare triple {133589#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {133589#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,843 INFO L273 TraceCheckUtils]: 20: Hoare triple {133589#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {133589#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,843 INFO L273 TraceCheckUtils]: 21: Hoare triple {133589#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p5~0); {133589#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,846 INFO L273 TraceCheckUtils]: 22: Hoare triple {133589#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p6~0); {133589#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,846 INFO L273 TraceCheckUtils]: 23: Hoare triple {133589#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p7~0); {133589#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,846 INFO L273 TraceCheckUtils]: 24: Hoare triple {133589#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p8~0; {133589#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,847 INFO L273 TraceCheckUtils]: 25: Hoare triple {133589#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk8~0; {133543#false} is VALID [2018-11-23 10:54:51,847 INFO L273 TraceCheckUtils]: 26: Hoare triple {133543#false} assume !false; {133543#false} is VALID [2018-11-23 10:54:51,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:54:51,848 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:51,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:51,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:51,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 10:54:51,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:51,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:51,875 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-23 10:54:51,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:51,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:51,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:51,876 INFO L87 Difference]: Start difference. First operand 7304 states and 9350 transitions. Second operand 3 states. [2018-11-23 10:55:00,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:00,901 INFO L93 Difference]: Finished difference Result 8076 states and 10632 transitions. [2018-11-23 10:55:00,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:00,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 10:55:00,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:00,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:00,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2018-11-23 10:55:00,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:00,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2018-11-23 10:55:00,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 99 transitions. [2018-11-23 10:55:01,030 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:04,086 INFO L225 Difference]: With dead ends: 8076 [2018-11-23 10:55:04,086 INFO L226 Difference]: Without dead ends: 8074 [2018-11-23 10:55:04,089 INFO L631 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-23 10:55:04,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2018-11-23 10:55:06,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 7304. [2018-11-23 10:55:06,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:06,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8074 states. Second operand 7304 states. [2018-11-23 10:55:06,884 INFO L74 IsIncluded]: Start isIncluded. First operand 8074 states. Second operand 7304 states. [2018-11-23 10:55:06,884 INFO L87 Difference]: Start difference. First operand 8074 states. Second operand 7304 states. [2018-11-23 10:55:09,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:09,315 INFO L93 Difference]: Finished difference Result 8074 states and 10503 transitions. [2018-11-23 10:55:09,315 INFO L276 IsEmpty]: Start isEmpty. Operand 8074 states and 10503 transitions. [2018-11-23 10:55:09,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:09,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:09,321 INFO L74 IsIncluded]: Start isIncluded. First operand 7304 states. Second operand 8074 states. [2018-11-23 10:55:09,322 INFO L87 Difference]: Start difference. First operand 7304 states. Second operand 8074 states. [2018-11-23 10:55:11,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:11,795 INFO L93 Difference]: Finished difference Result 8074 states and 10503 transitions. [2018-11-23 10:55:11,795 INFO L276 IsEmpty]: Start isEmpty. Operand 8074 states and 10503 transitions. [2018-11-23 10:55:11,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:11,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:11,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:11,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:11,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2018-11-23 10:55:14,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9222 transitions. [2018-11-23 10:55:14,127 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9222 transitions. Word has length 27 [2018-11-23 10:55:14,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:14,127 INFO L480 AbstractCegarLoop]: Abstraction has 7304 states and 9222 transitions. [2018-11-23 10:55:14,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:14,128 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9222 transitions. [2018-11-23 10:55:14,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 10:55:14,131 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:14,131 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:55:14,131 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:14,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:14,131 INFO L82 PathProgramCache]: Analyzing trace with hash 715001129, now seen corresponding path program 1 times [2018-11-23 10:55:14,131 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:14,131 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 25 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 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:55:14,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:14,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:14,224 INFO L256 TraceCheckUtils]: 0: Hoare triple {165807#true} call ULTIMATE.init(); {165807#true} is VALID [2018-11-23 10:55:14,224 INFO L273 TraceCheckUtils]: 1: Hoare triple {165807#true} assume true; {165807#true} is VALID [2018-11-23 10:55:14,225 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {165807#true} {165807#true} #197#return; {165807#true} is VALID [2018-11-23 10:55:14,225 INFO L256 TraceCheckUtils]: 3: Hoare triple {165807#true} call #t~ret11 := main(); {165807#true} is VALID [2018-11-23 10:55:14,225 INFO L273 TraceCheckUtils]: 4: Hoare triple {165807#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;havoc ~cond~0; {165807#true} is VALID [2018-11-23 10:55:14,226 INFO L273 TraceCheckUtils]: 5: Hoare triple {165807#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {165807#true} is VALID [2018-11-23 10:55:14,226 INFO L273 TraceCheckUtils]: 6: Hoare triple {165807#true} assume !(0bv32 == ~cond~0);~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; {165807#true} is VALID [2018-11-23 10:55:14,226 INFO L273 TraceCheckUtils]: 7: Hoare triple {165807#true} assume !(0bv32 != ~p1~0); {165807#true} is VALID [2018-11-23 10:55:14,227 INFO L273 TraceCheckUtils]: 8: Hoare triple {165807#true} assume !(0bv32 != ~p2~0); {165807#true} is VALID [2018-11-23 10:55:14,227 INFO L273 TraceCheckUtils]: 9: Hoare triple {165807#true} assume !(0bv32 != ~p3~0); {165807#true} is VALID [2018-11-23 10:55:14,227 INFO L273 TraceCheckUtils]: 10: Hoare triple {165807#true} assume !(0bv32 != ~p4~0); {165807#true} is VALID [2018-11-23 10:55:14,227 INFO L273 TraceCheckUtils]: 11: Hoare triple {165807#true} assume !(0bv32 != ~p5~0); {165807#true} is VALID [2018-11-23 10:55:14,227 INFO L273 TraceCheckUtils]: 12: Hoare triple {165807#true} assume !(0bv32 != ~p6~0); {165807#true} is VALID [2018-11-23 10:55:14,228 INFO L273 TraceCheckUtils]: 13: Hoare triple {165807#true} assume !(0bv32 != ~p7~0); {165807#true} is VALID [2018-11-23 10:55:14,228 INFO L273 TraceCheckUtils]: 14: Hoare triple {165807#true} assume !(0bv32 != ~p8~0); {165807#true} is VALID [2018-11-23 10:55:14,229 INFO L273 TraceCheckUtils]: 15: Hoare triple {165807#true} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {165857#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:14,229 INFO L273 TraceCheckUtils]: 16: Hoare triple {165857#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {165857#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:14,231 INFO L273 TraceCheckUtils]: 17: Hoare triple {165857#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {165857#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:14,231 INFO L273 TraceCheckUtils]: 18: Hoare triple {165857#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {165857#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:14,231 INFO L273 TraceCheckUtils]: 19: Hoare triple {165857#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {165857#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:14,232 INFO L273 TraceCheckUtils]: 20: Hoare triple {165857#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {165857#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:14,232 INFO L273 TraceCheckUtils]: 21: Hoare triple {165857#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p5~0); {165857#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:14,232 INFO L273 TraceCheckUtils]: 22: Hoare triple {165857#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p6~0); {165857#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:14,233 INFO L273 TraceCheckUtils]: 23: Hoare triple {165857#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p7~0); {165857#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:14,233 INFO L273 TraceCheckUtils]: 24: Hoare triple {165857#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {165857#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:14,233 INFO L273 TraceCheckUtils]: 25: Hoare triple {165857#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0; {165857#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:14,234 INFO L273 TraceCheckUtils]: 26: Hoare triple {165857#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk9~0; {165808#false} is VALID [2018-11-23 10:55:14,234 INFO L273 TraceCheckUtils]: 27: Hoare triple {165808#false} assume !false; {165808#false} is VALID [2018-11-23 10:55:14,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:55:14,235 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:14,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:14,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:14,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 10:55:14,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:14,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:14,265 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-23 10:55:14,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:14,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:14,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:14,266 INFO L87 Difference]: Start difference. First operand 7304 states and 9222 transitions. Second operand 3 states. [2018-11-23 10:55:27,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:27,862 INFO L93 Difference]: Finished difference Result 12172 states and 15496 transitions. [2018-11-23 10:55:27,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:27,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 10:55:27,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:27,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:27,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2018-11-23 10:55:27,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:27,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2018-11-23 10:55:27,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 98 transitions. [2018-11-23 10:55:27,982 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:34,239 INFO L225 Difference]: With dead ends: 12172 [2018-11-23 10:55:34,239 INFO L226 Difference]: Without dead ends: 12170 [2018-11-23 10:55:34,241 INFO L631 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-23 10:55:34,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2018-11-23 10:55:40,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 11144. [2018-11-23 10:55:40,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:40,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12170 states. Second operand 11144 states. [2018-11-23 10:55:40,054 INFO L74 IsIncluded]: Start isIncluded. First operand 12170 states. Second operand 11144 states. [2018-11-23 10:55:40,054 INFO L87 Difference]: Start difference. First operand 12170 states. Second operand 11144 states. [2018-11-23 10:55:45,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:45,576 INFO L93 Difference]: Finished difference Result 12170 states and 15239 transitions. [2018-11-23 10:55:45,576 INFO L276 IsEmpty]: Start isEmpty. Operand 12170 states and 15239 transitions. [2018-11-23 10:55:45,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:45,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:45,585 INFO L74 IsIncluded]: Start isIncluded. First operand 11144 states. Second operand 12170 states. [2018-11-23 10:55:45,585 INFO L87 Difference]: Start difference. First operand 11144 states. Second operand 12170 states. [2018-11-23 10:55:50,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:50,968 INFO L93 Difference]: Finished difference Result 12170 states and 15239 transitions. [2018-11-23 10:55:50,968 INFO L276 IsEmpty]: Start isEmpty. Operand 12170 states and 15239 transitions. [2018-11-23 10:55:50,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:50,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:50,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:50,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:50,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2018-11-23 10:55:55,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 13702 transitions. [2018-11-23 10:55:55,570 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 13702 transitions. Word has length 28 [2018-11-23 10:55:55,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:55,571 INFO L480 AbstractCegarLoop]: Abstraction has 11144 states and 13702 transitions. [2018-11-23 10:55:55,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:55,571 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 13702 transitions. [2018-11-23 10:55:55,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 10:55:55,577 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:55,577 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:55:55,577 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:55,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:55,580 INFO L82 PathProgramCache]: Analyzing trace with hash 128195115, now seen corresponding path program 1 times [2018-11-23 10:55:55,580 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:55,580 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 26 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 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:55:55,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:55,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:55,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:55,676 INFO L256 TraceCheckUtils]: 0: Hoare triple {214331#true} call ULTIMATE.init(); {214331#true} is VALID [2018-11-23 10:55:55,676 INFO L273 TraceCheckUtils]: 1: Hoare triple {214331#true} assume true; {214331#true} is VALID [2018-11-23 10:55:55,677 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {214331#true} {214331#true} #197#return; {214331#true} is VALID [2018-11-23 10:55:55,677 INFO L256 TraceCheckUtils]: 3: Hoare triple {214331#true} call #t~ret11 := main(); {214331#true} is VALID [2018-11-23 10:55:55,677 INFO L273 TraceCheckUtils]: 4: Hoare triple {214331#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;havoc ~cond~0; {214331#true} is VALID [2018-11-23 10:55:55,677 INFO L273 TraceCheckUtils]: 5: Hoare triple {214331#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {214331#true} is VALID [2018-11-23 10:55:55,677 INFO L273 TraceCheckUtils]: 6: Hoare triple {214331#true} assume !(0bv32 == ~cond~0);~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; {214331#true} is VALID [2018-11-23 10:55:55,678 INFO L273 TraceCheckUtils]: 7: Hoare triple {214331#true} assume !(0bv32 != ~p1~0); {214331#true} is VALID [2018-11-23 10:55:55,678 INFO L273 TraceCheckUtils]: 8: Hoare triple {214331#true} assume !(0bv32 != ~p2~0); {214331#true} is VALID [2018-11-23 10:55:55,678 INFO L273 TraceCheckUtils]: 9: Hoare triple {214331#true} assume !(0bv32 != ~p3~0); {214331#true} is VALID [2018-11-23 10:55:55,678 INFO L273 TraceCheckUtils]: 10: Hoare triple {214331#true} assume !(0bv32 != ~p4~0); {214331#true} is VALID [2018-11-23 10:55:55,679 INFO L273 TraceCheckUtils]: 11: Hoare triple {214331#true} assume !(0bv32 != ~p5~0); {214331#true} is VALID [2018-11-23 10:55:55,679 INFO L273 TraceCheckUtils]: 12: Hoare triple {214331#true} assume !(0bv32 != ~p6~0); {214331#true} is VALID [2018-11-23 10:55:55,679 INFO L273 TraceCheckUtils]: 13: Hoare triple {214331#true} assume !(0bv32 != ~p7~0); {214331#true} is VALID [2018-11-23 10:55:55,680 INFO L273 TraceCheckUtils]: 14: Hoare triple {214331#true} assume !(0bv32 != ~p8~0); {214331#true} is VALID [2018-11-23 10:55:55,680 INFO L273 TraceCheckUtils]: 15: Hoare triple {214331#true} assume !(0bv32 != ~p9~0); {214381#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:55:55,681 INFO L273 TraceCheckUtils]: 16: Hoare triple {214381#(= (_ bv0 32) main_~p9~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {214381#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:55:55,681 INFO L273 TraceCheckUtils]: 17: Hoare triple {214381#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p1~0); {214381#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:55:55,681 INFO L273 TraceCheckUtils]: 18: Hoare triple {214381#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p2~0); {214381#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:55:55,682 INFO L273 TraceCheckUtils]: 19: Hoare triple {214381#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p3~0); {214381#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:55:55,682 INFO L273 TraceCheckUtils]: 20: Hoare triple {214381#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p4~0); {214381#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:55:55,682 INFO L273 TraceCheckUtils]: 21: Hoare triple {214381#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p5~0); {214381#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:55:55,683 INFO L273 TraceCheckUtils]: 22: Hoare triple {214381#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p6~0); {214381#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:55:55,683 INFO L273 TraceCheckUtils]: 23: Hoare triple {214381#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p7~0); {214381#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:55:55,684 INFO L273 TraceCheckUtils]: 24: Hoare triple {214381#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p8~0); {214381#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:55:55,684 INFO L273 TraceCheckUtils]: 25: Hoare triple {214381#(= (_ bv0 32) main_~p9~0)} assume 0bv32 != ~p9~0; {214332#false} is VALID [2018-11-23 10:55:55,684 INFO L273 TraceCheckUtils]: 26: Hoare triple {214332#false} assume 1bv32 != ~lk9~0; {214332#false} is VALID [2018-11-23 10:55:55,685 INFO L273 TraceCheckUtils]: 27: Hoare triple {214332#false} assume !false; {214332#false} is VALID [2018-11-23 10:55:55,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:55:55,686 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:55,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:55,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:55,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 10:55:55,688 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:55,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:55,712 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-23 10:55:55,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:55,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:55,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:55,713 INFO L87 Difference]: Start difference. First operand 11144 states and 13702 transitions. Second operand 3 states. [2018-11-23 10:56:44,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:56:44,841 INFO L93 Difference]: Finished difference Result 25228 states and 30856 transitions. [2018-11-23 10:56:44,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:56:44,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 10:56:44,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:56:44,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:56:44,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2018-11-23 10:56:44,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:56:44,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2018-11-23 10:56:44,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 167 transitions. [2018-11-23 10:56:45,023 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:56:53,203 INFO L225 Difference]: With dead ends: 25228 [2018-11-23 10:56:53,203 INFO L226 Difference]: Without dead ends: 14218 [2018-11-23 10:56:53,214 INFO L631 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-23 10:56:53,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14218 states. [2018-11-23 10:57:06,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14218 to 14216. [2018-11-23 10:57:06,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:57:06,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14218 states. Second operand 14216 states. [2018-11-23 10:57:06,318 INFO L74 IsIncluded]: Start isIncluded. First operand 14218 states. Second operand 14216 states. [2018-11-23 10:57:06,318 INFO L87 Difference]: Start difference. First operand 14218 states. Second operand 14216 states.