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_5_true-unreach-call_true-valid-memsafety_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:54:32,556 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:54:32,558 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:54:32,572 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:54:32,572 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:54:32,574 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:54:32,576 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:54:32,578 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:54:32,581 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:54:32,582 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:54:32,583 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:54:32,583 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:54:32,584 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:54:32,585 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:54:32,586 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:54:32,587 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:54:32,588 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:54:32,590 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:54:32,592 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:54:32,594 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:54:32,595 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:54:32,596 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:54:32,599 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:54:32,599 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:54:32,599 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:54:32,600 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:54:32,602 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:54:32,602 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:54:32,603 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:54:32,604 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:54:32,605 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:54:32,606 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:54:32,606 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:54:32,606 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:54:32,607 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:54:32,608 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:54:32,608 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:54:32,626 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:54:32,627 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:54:32,628 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:54:32,628 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:54:32,630 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:54:32,630 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:54:32,630 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:54:32,631 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:54:32,631 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:54:32,631 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:54:32,631 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:54:32,631 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:54:32,631 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:54:32,632 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:54:32,632 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:54:32,632 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:54:32,632 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:54:32,633 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:54:32,633 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:54:32,633 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:54:32,633 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:54:32,633 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:54:32,634 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:54:32,635 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:54:32,635 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:54:32,635 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:54:32,635 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:54:32,636 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:54:32,636 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:54:32,636 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:54:32,636 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:54:32,636 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:54:32,636 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:54:32,687 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:54:32,703 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:54:32,706 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:54:32,708 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:54:32,708 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:54:32,709 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 10:54:32,782 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc5f08867/ec99f5605a234d649cc0c18d84177bb0/FLAG2259c25ea [2018-11-23 10:54:33,236 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:54:33,237 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 10:54:33,244 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc5f08867/ec99f5605a234d649cc0c18d84177bb0/FLAG2259c25ea [2018-11-23 10:54:33,596 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc5f08867/ec99f5605a234d649cc0c18d84177bb0 [2018-11-23 10:54:33,606 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:54:33,608 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:54:33,609 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:54:33,609 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:54:33,615 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:54:33,617 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:54:33" (1/1) ... [2018-11-23 10:54:33,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74ea1055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:33, skipping insertion in model container [2018-11-23 10:54:33,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:54:33" (1/1) ... [2018-11-23 10:54:33,630 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:54:33,652 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:54:33,890 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:54:33,896 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:54:33,917 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:54:33,935 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:54:33,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:33 WrapperNode [2018-11-23 10:54:33,936 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:54:33,937 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:54:33,937 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:54:33,937 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:54:33,948 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:54:33" (1/1) ... [2018-11-23 10:54:33,956 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:54:33" (1/1) ... [2018-11-23 10:54:33,964 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:54:33,964 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:54:33,965 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:54:33,965 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:54:33,976 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:33" (1/1) ... [2018-11-23 10:54:33,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:33" (1/1) ... [2018-11-23 10:54:33,978 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:33" (1/1) ... [2018-11-23 10:54:33,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:33" (1/1) ... [2018-11-23 10:54:33,994 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:33" (1/1) ... [2018-11-23 10:54:34,004 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:33" (1/1) ... [2018-11-23 10:54:34,006 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:33" (1/1) ... [2018-11-23 10:54:34,013 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:54:34,014 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:54:34,014 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:54:34,015 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:54:34,019 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:33" (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:54:34,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:54:34,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:54:34,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:54:34,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:54:34,199 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:54:34,199 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:54:34,803 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:54:34,803 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 10:54:34,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:54:34 BoogieIcfgContainer [2018-11-23 10:54:34,804 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:54:34,805 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:54:34,805 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:54:34,808 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:54:34,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:54:33" (1/3) ... [2018-11-23 10:54:34,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f1d991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:54:34, skipping insertion in model container [2018-11-23 10:54:34,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:33" (2/3) ... [2018-11-23 10:54:34,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f1d991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:54:34, skipping insertion in model container [2018-11-23 10:54:34,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:54:34" (3/3) ... [2018-11-23 10:54:34,812 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 10:54:34,820 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:54:34,828 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:54:34,842 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:54:34,873 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:54:34,874 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:54:34,874 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:54:34,874 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:54:34,876 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:54:34,876 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:54:34,876 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:54:34,877 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:54:34,877 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:54:34,897 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-23 10:54:34,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 10:54:34,903 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:34,904 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:34,907 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:34,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:34,913 INFO L82 PathProgramCache]: Analyzing trace with hash 316328318, now seen corresponding path program 1 times [2018-11-23 10:54:34,917 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:34,917 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:54:34,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:34,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:35,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:35,205 INFO L256 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2018-11-23 10:54:35,208 INFO L273 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2018-11-23 10:54:35,209 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #112#return; {32#true} is VALID [2018-11-23 10:54:35,209 INFO L256 TraceCheckUtils]: 3: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2018-11-23 10:54:35,210 INFO L273 TraceCheckUtils]: 4: Hoare triple {32#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;havoc ~cond~0; {32#true} is VALID [2018-11-23 10:54:35,210 INFO L273 TraceCheckUtils]: 5: Hoare triple {32#true} assume !false;~cond~0 := #t~nondet5;havoc #t~nondet5; {32#true} is VALID [2018-11-23 10:54:35,210 INFO L273 TraceCheckUtils]: 6: Hoare triple {32#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32; {32#true} is VALID [2018-11-23 10:54:35,216 INFO L273 TraceCheckUtils]: 7: Hoare triple {32#true} assume 0bv32 != ~p1~0;~lk1~0 := 1bv32; {58#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:35,217 INFO L273 TraceCheckUtils]: 8: Hoare triple {58#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {58#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:35,218 INFO L273 TraceCheckUtils]: 9: Hoare triple {58#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {58#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:35,219 INFO L273 TraceCheckUtils]: 10: Hoare triple {58#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {58#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:35,222 INFO L273 TraceCheckUtils]: 11: Hoare triple {58#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {58#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:35,222 INFO L273 TraceCheckUtils]: 12: Hoare triple {58#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p1~0; {58#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:35,224 INFO L273 TraceCheckUtils]: 13: Hoare triple {58#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk1~0; {33#false} is VALID [2018-11-23 10:54:35,224 INFO L273 TraceCheckUtils]: 14: Hoare triple {33#false} assume !false; {33#false} is VALID [2018-11-23 10:54:35,228 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:35,228 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:35,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:35,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:35,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 10:54:35,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:35,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:35,352 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:35,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:35,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:35,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:35,363 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2018-11-23 10:54:35,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:35,846 INFO L93 Difference]: Finished difference Result 57 states and 90 transitions. [2018-11-23 10:54:35,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:35,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 10:54:35,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:35,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:35,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-23 10:54:35,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:35,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-23 10:54:35,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2018-11-23 10:54:36,139 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:36,158 INFO L225 Difference]: With dead ends: 57 [2018-11-23 10:54:36,159 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 10:54:36,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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:36,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 10:54:36,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2018-11-23 10:54:36,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:36,295 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 30 states. [2018-11-23 10:54:36,295 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 30 states. [2018-11-23 10:54:36,296 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 30 states. [2018-11-23 10:54:36,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:36,310 INFO L93 Difference]: Finished difference Result 42 states and 68 transitions. [2018-11-23 10:54:36,310 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 68 transitions. [2018-11-23 10:54:36,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:36,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:36,315 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 42 states. [2018-11-23 10:54:36,315 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 42 states. [2018-11-23 10:54:36,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:36,326 INFO L93 Difference]: Finished difference Result 42 states and 68 transitions. [2018-11-23 10:54:36,327 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 68 transitions. [2018-11-23 10:54:36,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:36,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:36,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:36,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:36,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 10:54:36,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2018-11-23 10:54:36,337 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 15 [2018-11-23 10:54:36,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:36,337 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2018-11-23 10:54:36,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:36,338 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2018-11-23 10:54:36,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 10:54:36,339 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:36,340 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:36,340 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:36,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:36,341 INFO L82 PathProgramCache]: Analyzing trace with hash -493018308, now seen corresponding path program 1 times [2018-11-23 10:54:36,342 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:36,342 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:54:36,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:36,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:36,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:36,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:36,515 INFO L256 TraceCheckUtils]: 0: Hoare triple {268#true} call ULTIMATE.init(); {268#true} is VALID [2018-11-23 10:54:36,515 INFO L273 TraceCheckUtils]: 1: Hoare triple {268#true} assume true; {268#true} is VALID [2018-11-23 10:54:36,516 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {268#true} {268#true} #112#return; {268#true} is VALID [2018-11-23 10:54:36,516 INFO L256 TraceCheckUtils]: 3: Hoare triple {268#true} call #t~ret6 := main(); {268#true} is VALID [2018-11-23 10:54:36,516 INFO L273 TraceCheckUtils]: 4: Hoare triple {268#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;havoc ~cond~0; {268#true} is VALID [2018-11-23 10:54:36,517 INFO L273 TraceCheckUtils]: 5: Hoare triple {268#true} assume !false;~cond~0 := #t~nondet5;havoc #t~nondet5; {268#true} is VALID [2018-11-23 10:54:36,517 INFO L273 TraceCheckUtils]: 6: Hoare triple {268#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32; {268#true} is VALID [2018-11-23 10:54:36,520 INFO L273 TraceCheckUtils]: 7: Hoare triple {268#true} assume !(0bv32 != ~p1~0); {294#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:36,522 INFO L273 TraceCheckUtils]: 8: Hoare triple {294#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {294#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:36,522 INFO L273 TraceCheckUtils]: 9: Hoare triple {294#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {294#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:36,524 INFO L273 TraceCheckUtils]: 10: Hoare triple {294#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {294#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:36,525 INFO L273 TraceCheckUtils]: 11: Hoare triple {294#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {294#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:36,526 INFO L273 TraceCheckUtils]: 12: Hoare triple {294#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p1~0; {269#false} is VALID [2018-11-23 10:54:36,526 INFO L273 TraceCheckUtils]: 13: Hoare triple {269#false} assume 1bv32 != ~lk1~0; {269#false} is VALID [2018-11-23 10:54:36,527 INFO L273 TraceCheckUtils]: 14: Hoare triple {269#false} assume !false; {269#false} is VALID [2018-11-23 10:54:36,529 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:36,530 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:36,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:36,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:36,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 10:54:36,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:36,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:36,564 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:36,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:36,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:36,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:36,566 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 3 states. [2018-11-23 10:54:37,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:37,067 INFO L93 Difference]: Finished difference Result 67 states and 112 transitions. [2018-11-23 10:54:37,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:37,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 10:54:37,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:37,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:37,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2018-11-23 10:54:37,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:37,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2018-11-23 10:54:37,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2018-11-23 10:54:37,360 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:37,362 INFO L225 Difference]: With dead ends: 67 [2018-11-23 10:54:37,363 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 10:54:37,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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:37,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 10:54:37,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-11-23 10:54:37,384 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:37,384 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 40 states. [2018-11-23 10:54:37,384 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 40 states. [2018-11-23 10:54:37,385 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 40 states. [2018-11-23 10:54:37,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:37,389 INFO L93 Difference]: Finished difference Result 42 states and 66 transitions. [2018-11-23 10:54:37,389 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 66 transitions. [2018-11-23 10:54:37,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:37,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:37,390 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 42 states. [2018-11-23 10:54:37,390 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 42 states. [2018-11-23 10:54:37,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:37,394 INFO L93 Difference]: Finished difference Result 42 states and 66 transitions. [2018-11-23 10:54:37,394 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 66 transitions. [2018-11-23 10:54:37,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:37,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:37,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:37,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:37,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 10:54:37,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 65 transitions. [2018-11-23 10:54:37,401 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 65 transitions. Word has length 15 [2018-11-23 10:54:37,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:37,402 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 65 transitions. [2018-11-23 10:54:37,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:37,403 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 65 transitions. [2018-11-23 10:54:37,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 10:54:37,404 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:37,404 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:37,404 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:37,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:37,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1216458266, now seen corresponding path program 1 times [2018-11-23 10:54:37,405 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:37,405 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:54:37,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:37,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:37,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:37,556 INFO L256 TraceCheckUtils]: 0: Hoare triple {523#true} call ULTIMATE.init(); {523#true} is VALID [2018-11-23 10:54:37,556 INFO L273 TraceCheckUtils]: 1: Hoare triple {523#true} assume true; {523#true} is VALID [2018-11-23 10:54:37,557 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {523#true} {523#true} #112#return; {523#true} is VALID [2018-11-23 10:54:37,557 INFO L256 TraceCheckUtils]: 3: Hoare triple {523#true} call #t~ret6 := main(); {523#true} is VALID [2018-11-23 10:54:37,557 INFO L273 TraceCheckUtils]: 4: Hoare triple {523#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;havoc ~cond~0; {523#true} is VALID [2018-11-23 10:54:37,557 INFO L273 TraceCheckUtils]: 5: Hoare triple {523#true} assume !false;~cond~0 := #t~nondet5;havoc #t~nondet5; {523#true} is VALID [2018-11-23 10:54:37,558 INFO L273 TraceCheckUtils]: 6: Hoare triple {523#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32; {523#true} is VALID [2018-11-23 10:54:37,558 INFO L273 TraceCheckUtils]: 7: Hoare triple {523#true} assume 0bv32 != ~p1~0;~lk1~0 := 1bv32; {549#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:37,559 INFO L273 TraceCheckUtils]: 8: Hoare triple {549#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {549#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:37,559 INFO L273 TraceCheckUtils]: 9: Hoare triple {549#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {549#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:37,560 INFO L273 TraceCheckUtils]: 10: Hoare triple {549#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {549#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:37,560 INFO L273 TraceCheckUtils]: 11: Hoare triple {549#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {549#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:37,561 INFO L273 TraceCheckUtils]: 12: Hoare triple {549#(not (= (_ bv0 32) main_~p1~0))} assume !(0bv32 != ~p1~0); {524#false} is VALID [2018-11-23 10:54:37,562 INFO L273 TraceCheckUtils]: 13: Hoare triple {524#false} assume 0bv32 != ~p2~0; {524#false} is VALID [2018-11-23 10:54:37,562 INFO L273 TraceCheckUtils]: 14: Hoare triple {524#false} assume 1bv32 != ~lk2~0; {524#false} is VALID [2018-11-23 10:54:37,562 INFO L273 TraceCheckUtils]: 15: Hoare triple {524#false} assume !false; {524#false} is VALID [2018-11-23 10:54:37,563 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:37,563 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 (4)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 10:54:37,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:37,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:37,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 10:54:37,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:37,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:37,704 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:37,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:37,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:37,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:37,705 INFO L87 Difference]: Start difference. First operand 40 states and 65 transitions. Second operand 3 states. [2018-11-23 10:54:37,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:37,886 INFO L93 Difference]: Finished difference Result 63 states and 99 transitions. [2018-11-23 10:54:37,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:37,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 10:54:37,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:37,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:37,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2018-11-23 10:54:37,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:37,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2018-11-23 10:54:37,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 96 transitions. [2018-11-23 10:54:38,092 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:38,095 INFO L225 Difference]: With dead ends: 63 [2018-11-23 10:54:38,095 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 10:54:38,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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:38,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 10:54:38,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-11-23 10:54:38,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:38,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 43 states. [2018-11-23 10:54:38,121 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 43 states. [2018-11-23 10:54:38,121 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 43 states. [2018-11-23 10:54:38,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:38,125 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2018-11-23 10:54:38,125 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 68 transitions. [2018-11-23 10:54:38,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:38,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:38,127 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 45 states. [2018-11-23 10:54:38,127 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 45 states. [2018-11-23 10:54:38,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:38,130 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2018-11-23 10:54:38,130 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 68 transitions. [2018-11-23 10:54:38,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:38,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:38,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:38,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:38,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 10:54:38,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 67 transitions. [2018-11-23 10:54:38,134 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 67 transitions. Word has length 16 [2018-11-23 10:54:38,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:38,134 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 67 transitions. [2018-11-23 10:54:38,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:38,134 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2018-11-23 10:54:38,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 10:54:38,135 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:38,136 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:38,136 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:38,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:38,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1896516636, now seen corresponding path program 1 times [2018-11-23 10:54:38,137 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:38,137 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:54:38,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:38,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:38,232 INFO L256 TraceCheckUtils]: 0: Hoare triple {788#true} call ULTIMATE.init(); {788#true} is VALID [2018-11-23 10:54:38,233 INFO L273 TraceCheckUtils]: 1: Hoare triple {788#true} assume true; {788#true} is VALID [2018-11-23 10:54:38,233 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {788#true} {788#true} #112#return; {788#true} is VALID [2018-11-23 10:54:38,234 INFO L256 TraceCheckUtils]: 3: Hoare triple {788#true} call #t~ret6 := main(); {788#true} is VALID [2018-11-23 10:54:38,234 INFO L273 TraceCheckUtils]: 4: Hoare triple {788#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;havoc ~cond~0; {788#true} is VALID [2018-11-23 10:54:38,234 INFO L273 TraceCheckUtils]: 5: Hoare triple {788#true} assume !false;~cond~0 := #t~nondet5;havoc #t~nondet5; {788#true} is VALID [2018-11-23 10:54:38,235 INFO L273 TraceCheckUtils]: 6: Hoare triple {788#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32; {788#true} is VALID [2018-11-23 10:54:38,235 INFO L273 TraceCheckUtils]: 7: Hoare triple {788#true} assume !(0bv32 != ~p1~0); {788#true} is VALID [2018-11-23 10:54:38,239 INFO L273 TraceCheckUtils]: 8: Hoare triple {788#true} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {817#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:38,239 INFO L273 TraceCheckUtils]: 9: Hoare triple {817#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {817#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:38,241 INFO L273 TraceCheckUtils]: 10: Hoare triple {817#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {817#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:38,241 INFO L273 TraceCheckUtils]: 11: Hoare triple {817#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {817#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:38,243 INFO L273 TraceCheckUtils]: 12: Hoare triple {817#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {817#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:38,243 INFO L273 TraceCheckUtils]: 13: Hoare triple {817#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p2~0; {817#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:38,245 INFO L273 TraceCheckUtils]: 14: Hoare triple {817#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk2~0; {789#false} is VALID [2018-11-23 10:54:38,245 INFO L273 TraceCheckUtils]: 15: Hoare triple {789#false} assume !false; {789#false} is VALID [2018-11-23 10:54:38,246 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:38,246 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:38,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:38,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:38,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 10:54:38,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:38,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:38,265 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:38,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:38,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:38,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:38,267 INFO L87 Difference]: Start difference. First operand 43 states and 67 transitions. Second operand 3 states. [2018-11-23 10:54:38,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:38,396 INFO L93 Difference]: Finished difference Result 76 states and 120 transitions. [2018-11-23 10:54:38,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:38,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 10:54:38,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:38,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:38,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-23 10:54:38,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:38,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-23 10:54:38,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2018-11-23 10:54:38,596 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:38,600 INFO L225 Difference]: With dead ends: 76 [2018-11-23 10:54:38,600 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 10:54:38,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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:38,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 10:54:38,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 56. [2018-11-23 10:54:38,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:38,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 56 states. [2018-11-23 10:54:38,627 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 56 states. [2018-11-23 10:54:38,627 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 56 states. [2018-11-23 10:54:38,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:38,631 INFO L93 Difference]: Finished difference Result 74 states and 117 transitions. [2018-11-23 10:54:38,632 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 117 transitions. [2018-11-23 10:54:38,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:38,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:38,633 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 74 states. [2018-11-23 10:54:38,633 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 74 states. [2018-11-23 10:54:38,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:38,638 INFO L93 Difference]: Finished difference Result 74 states and 117 transitions. [2018-11-23 10:54:38,638 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 117 transitions. [2018-11-23 10:54:38,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:38,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:38,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:38,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:38,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 10:54:38,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 88 transitions. [2018-11-23 10:54:38,643 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 88 transitions. Word has length 16 [2018-11-23 10:54:38,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:38,643 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 88 transitions. [2018-11-23 10:54:38,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:38,643 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 88 transitions. [2018-11-23 10:54:38,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 10:54:38,644 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:38,644 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:38,645 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:38,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:38,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1087170010, now seen corresponding path program 1 times [2018-11-23 10:54:38,645 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:38,646 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:54:38,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:38,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:38,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:38,733 INFO L256 TraceCheckUtils]: 0: Hoare triple {1138#true} call ULTIMATE.init(); {1138#true} is VALID [2018-11-23 10:54:38,734 INFO L273 TraceCheckUtils]: 1: Hoare triple {1138#true} assume true; {1138#true} is VALID [2018-11-23 10:54:38,734 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1138#true} {1138#true} #112#return; {1138#true} is VALID [2018-11-23 10:54:38,735 INFO L256 TraceCheckUtils]: 3: Hoare triple {1138#true} call #t~ret6 := main(); {1138#true} is VALID [2018-11-23 10:54:38,735 INFO L273 TraceCheckUtils]: 4: Hoare triple {1138#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;havoc ~cond~0; {1138#true} is VALID [2018-11-23 10:54:38,735 INFO L273 TraceCheckUtils]: 5: Hoare triple {1138#true} assume !false;~cond~0 := #t~nondet5;havoc #t~nondet5; {1138#true} is VALID [2018-11-23 10:54:38,735 INFO L273 TraceCheckUtils]: 6: Hoare triple {1138#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32; {1138#true} is VALID [2018-11-23 10:54:38,735 INFO L273 TraceCheckUtils]: 7: Hoare triple {1138#true} assume !(0bv32 != ~p1~0); {1138#true} is VALID [2018-11-23 10:54:38,736 INFO L273 TraceCheckUtils]: 8: Hoare triple {1138#true} assume !(0bv32 != ~p2~0); {1167#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:38,738 INFO L273 TraceCheckUtils]: 9: Hoare triple {1167#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {1167#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:38,738 INFO L273 TraceCheckUtils]: 10: Hoare triple {1167#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {1167#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:38,740 INFO L273 TraceCheckUtils]: 11: Hoare triple {1167#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {1167#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:38,741 INFO L273 TraceCheckUtils]: 12: Hoare triple {1167#(= (_ bv0 32) main_~p2~0)} assume !(0bv32 != ~p1~0); {1167#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:38,742 INFO L273 TraceCheckUtils]: 13: Hoare triple {1167#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p2~0; {1139#false} is VALID [2018-11-23 10:54:38,742 INFO L273 TraceCheckUtils]: 14: Hoare triple {1139#false} assume 1bv32 != ~lk2~0; {1139#false} is VALID [2018-11-23 10:54:38,743 INFO L273 TraceCheckUtils]: 15: Hoare triple {1139#false} assume !false; {1139#false} is VALID [2018-11-23 10:54:38,744 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:38,744 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:38,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:38,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:38,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 10:54:38,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:38,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:38,777 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:38,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:38,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:38,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:38,778 INFO L87 Difference]: Start difference. First operand 56 states and 88 transitions. Second operand 3 states. [2018-11-23 10:54:38,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:38,947 INFO L93 Difference]: Finished difference Result 124 states and 198 transitions. [2018-11-23 10:54:38,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:38,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 10:54:38,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:38,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:38,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2018-11-23 10:54:38,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:38,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2018-11-23 10:54:38,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 98 transitions. [2018-11-23 10:54:39,133 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:54:39,137 INFO L225 Difference]: With dead ends: 124 [2018-11-23 10:54:39,137 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 10:54:39,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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:39,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 10:54:39,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-11-23 10:54:39,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:39,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 74 states. [2018-11-23 10:54:39,216 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 74 states. [2018-11-23 10:54:39,216 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 74 states. [2018-11-23 10:54:39,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:39,220 INFO L93 Difference]: Finished difference Result 76 states and 115 transitions. [2018-11-23 10:54:39,221 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 115 transitions. [2018-11-23 10:54:39,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:39,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:39,222 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 76 states. [2018-11-23 10:54:39,222 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 76 states. [2018-11-23 10:54:39,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:39,226 INFO L93 Difference]: Finished difference Result 76 states and 115 transitions. [2018-11-23 10:54:39,226 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 115 transitions. [2018-11-23 10:54:39,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:39,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:39,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:39,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:39,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 10:54:39,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 114 transitions. [2018-11-23 10:54:39,231 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 114 transitions. Word has length 16 [2018-11-23 10:54:39,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:39,231 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 114 transitions. [2018-11-23 10:54:39,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:39,231 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 114 transitions. [2018-11-23 10:54:39,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 10:54:39,232 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:39,232 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:39,233 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:39,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:39,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1337311087, now seen corresponding path program 1 times [2018-11-23 10:54:39,234 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:39,234 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:54:39,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:39,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:39,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:39,325 INFO L256 TraceCheckUtils]: 0: Hoare triple {1562#true} call ULTIMATE.init(); {1562#true} is VALID [2018-11-23 10:54:39,325 INFO L273 TraceCheckUtils]: 1: Hoare triple {1562#true} assume true; {1562#true} is VALID [2018-11-23 10:54:39,325 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1562#true} {1562#true} #112#return; {1562#true} is VALID [2018-11-23 10:54:39,326 INFO L256 TraceCheckUtils]: 3: Hoare triple {1562#true} call #t~ret6 := main(); {1562#true} is VALID [2018-11-23 10:54:39,326 INFO L273 TraceCheckUtils]: 4: Hoare triple {1562#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;havoc ~cond~0; {1562#true} is VALID [2018-11-23 10:54:39,326 INFO L273 TraceCheckUtils]: 5: Hoare triple {1562#true} assume !false;~cond~0 := #t~nondet5;havoc #t~nondet5; {1562#true} is VALID [2018-11-23 10:54:39,326 INFO L273 TraceCheckUtils]: 6: Hoare triple {1562#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32; {1562#true} is VALID [2018-11-23 10:54:39,327 INFO L273 TraceCheckUtils]: 7: Hoare triple {1562#true} assume !(0bv32 != ~p1~0); {1562#true} is VALID [2018-11-23 10:54:39,328 INFO L273 TraceCheckUtils]: 8: Hoare triple {1562#true} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {1591#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:39,331 INFO L273 TraceCheckUtils]: 9: Hoare triple {1591#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {1591#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:39,331 INFO L273 TraceCheckUtils]: 10: Hoare triple {1591#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {1591#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:39,334 INFO L273 TraceCheckUtils]: 11: Hoare triple {1591#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {1591#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:39,334 INFO L273 TraceCheckUtils]: 12: Hoare triple {1591#(not (= (_ bv0 32) main_~p2~0))} assume !(0bv32 != ~p1~0); {1591#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:39,336 INFO L273 TraceCheckUtils]: 13: Hoare triple {1591#(not (= (_ bv0 32) main_~p2~0))} assume !(0bv32 != ~p2~0); {1563#false} is VALID [2018-11-23 10:54:39,336 INFO L273 TraceCheckUtils]: 14: Hoare triple {1563#false} assume 0bv32 != ~p3~0; {1563#false} is VALID [2018-11-23 10:54:39,336 INFO L273 TraceCheckUtils]: 15: Hoare triple {1563#false} assume 1bv32 != ~lk3~0; {1563#false} is VALID [2018-11-23 10:54:39,336 INFO L273 TraceCheckUtils]: 16: Hoare triple {1563#false} assume !false; {1563#false} is VALID [2018-11-23 10:54:39,337 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:39,337 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:39,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:39,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:39,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 10:54:39,339 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:39,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:39,358 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:39,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:39,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:39,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:39,359 INFO L87 Difference]: Start difference. First operand 74 states and 114 transitions. Second operand 3 states. [2018-11-23 10:54:39,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:39,542 INFO L93 Difference]: Finished difference Result 111 states and 169 transitions. [2018-11-23 10:54:39,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:39,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 10:54:39,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:39,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:39,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2018-11-23 10:54:39,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:39,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2018-11-23 10:54:39,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 93 transitions. [2018-11-23 10:54:39,664 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:39,667 INFO L225 Difference]: With dead ends: 111 [2018-11-23 10:54:39,667 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 10:54:39,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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:39,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 10:54:39,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-11-23 10:54:39,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:39,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 76 states. [2018-11-23 10:54:39,710 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 76 states. [2018-11-23 10:54:39,710 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 76 states. [2018-11-23 10:54:39,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:39,714 INFO L93 Difference]: Finished difference Result 78 states and 115 transitions. [2018-11-23 10:54:39,714 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 115 transitions. [2018-11-23 10:54:39,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:39,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:39,715 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 78 states. [2018-11-23 10:54:39,715 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 78 states. [2018-11-23 10:54:39,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:39,719 INFO L93 Difference]: Finished difference Result 78 states and 115 transitions. [2018-11-23 10:54:39,719 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 115 transitions. [2018-11-23 10:54:39,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:39,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:39,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:39,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:39,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 10:54:39,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 114 transitions. [2018-11-23 10:54:39,723 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 114 transitions. Word has length 17 [2018-11-23 10:54:39,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:39,724 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 114 transitions. [2018-11-23 10:54:39,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:39,724 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 114 transitions. [2018-11-23 10:54:39,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 10:54:39,725 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:39,725 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:39,725 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:39,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:39,726 INFO L82 PathProgramCache]: Analyzing trace with hash -657252717, now seen corresponding path program 1 times [2018-11-23 10:54:39,726 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:39,726 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:54:39,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:39,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:39,832 INFO L256 TraceCheckUtils]: 0: Hoare triple {1982#true} call ULTIMATE.init(); {1982#true} is VALID [2018-11-23 10:54:39,832 INFO L273 TraceCheckUtils]: 1: Hoare triple {1982#true} assume true; {1982#true} is VALID [2018-11-23 10:54:39,832 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1982#true} {1982#true} #112#return; {1982#true} is VALID [2018-11-23 10:54:39,833 INFO L256 TraceCheckUtils]: 3: Hoare triple {1982#true} call #t~ret6 := main(); {1982#true} is VALID [2018-11-23 10:54:39,833 INFO L273 TraceCheckUtils]: 4: Hoare triple {1982#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;havoc ~cond~0; {1982#true} is VALID [2018-11-23 10:54:39,833 INFO L273 TraceCheckUtils]: 5: Hoare triple {1982#true} assume !false;~cond~0 := #t~nondet5;havoc #t~nondet5; {1982#true} is VALID [2018-11-23 10:54:39,833 INFO L273 TraceCheckUtils]: 6: Hoare triple {1982#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32; {1982#true} is VALID [2018-11-23 10:54:39,834 INFO L273 TraceCheckUtils]: 7: Hoare triple {1982#true} assume !(0bv32 != ~p1~0); {1982#true} is VALID [2018-11-23 10:54:39,834 INFO L273 TraceCheckUtils]: 8: Hoare triple {1982#true} assume !(0bv32 != ~p2~0); {1982#true} is VALID [2018-11-23 10:54:39,834 INFO L273 TraceCheckUtils]: 9: Hoare triple {1982#true} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {2014#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:39,839 INFO L273 TraceCheckUtils]: 10: Hoare triple {2014#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {2014#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:39,840 INFO L273 TraceCheckUtils]: 11: Hoare triple {2014#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {2014#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:39,845 INFO L273 TraceCheckUtils]: 12: Hoare triple {2014#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {2014#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:39,845 INFO L273 TraceCheckUtils]: 13: Hoare triple {2014#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {2014#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:39,846 INFO L273 TraceCheckUtils]: 14: Hoare triple {2014#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p3~0; {2014#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:39,846 INFO L273 TraceCheckUtils]: 15: Hoare triple {2014#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk3~0; {1983#false} is VALID [2018-11-23 10:54:39,846 INFO L273 TraceCheckUtils]: 16: Hoare triple {1983#false} assume !false; {1983#false} is VALID [2018-11-23 10:54:39,847 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:39,847 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 (8)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 10:54:39,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:39,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:39,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 10:54:39,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:39,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:39,867 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:39,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:39,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:39,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:39,868 INFO L87 Difference]: Start difference. First operand 76 states and 114 transitions. Second operand 3 states. [2018-11-23 10:54:40,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:40,003 INFO L93 Difference]: Finished difference Result 132 states and 200 transitions. [2018-11-23 10:54:40,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:40,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 10:54:40,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:40,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:40,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2018-11-23 10:54:40,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:40,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2018-11-23 10:54:40,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 62 transitions. [2018-11-23 10:54:40,087 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:40,090 INFO L225 Difference]: With dead ends: 132 [2018-11-23 10:54:40,090 INFO L226 Difference]: Without dead ends: 130 [2018-11-23 10:54:40,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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:40,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-23 10:54:40,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 104. [2018-11-23 10:54:40,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:40,164 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand 104 states. [2018-11-23 10:54:40,164 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 104 states. [2018-11-23 10:54:40,165 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 104 states. [2018-11-23 10:54:40,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:40,169 INFO L93 Difference]: Finished difference Result 130 states and 195 transitions. [2018-11-23 10:54:40,170 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 195 transitions. [2018-11-23 10:54:40,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:40,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:40,171 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 130 states. [2018-11-23 10:54:40,171 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 130 states. [2018-11-23 10:54:40,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:40,176 INFO L93 Difference]: Finished difference Result 130 states and 195 transitions. [2018-11-23 10:54:40,176 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 195 transitions. [2018-11-23 10:54:40,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:40,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:40,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:40,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:40,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-23 10:54:40,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2018-11-23 10:54:40,181 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 17 [2018-11-23 10:54:40,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:40,182 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2018-11-23 10:54:40,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:40,182 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2018-11-23 10:54:40,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 10:54:40,183 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:40,183 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:40,183 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:40,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:40,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1466599343, now seen corresponding path program 1 times [2018-11-23 10:54:40,184 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:40,184 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:54:40,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:40,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:40,287 INFO L256 TraceCheckUtils]: 0: Hoare triple {2557#true} call ULTIMATE.init(); {2557#true} is VALID [2018-11-23 10:54:40,288 INFO L273 TraceCheckUtils]: 1: Hoare triple {2557#true} assume true; {2557#true} is VALID [2018-11-23 10:54:40,288 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2557#true} {2557#true} #112#return; {2557#true} is VALID [2018-11-23 10:54:40,288 INFO L256 TraceCheckUtils]: 3: Hoare triple {2557#true} call #t~ret6 := main(); {2557#true} is VALID [2018-11-23 10:54:40,289 INFO L273 TraceCheckUtils]: 4: Hoare triple {2557#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;havoc ~cond~0; {2557#true} is VALID [2018-11-23 10:54:40,289 INFO L273 TraceCheckUtils]: 5: Hoare triple {2557#true} assume !false;~cond~0 := #t~nondet5;havoc #t~nondet5; {2557#true} is VALID [2018-11-23 10:54:40,290 INFO L273 TraceCheckUtils]: 6: Hoare triple {2557#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32; {2557#true} is VALID [2018-11-23 10:54:40,290 INFO L273 TraceCheckUtils]: 7: Hoare triple {2557#true} assume !(0bv32 != ~p1~0); {2557#true} is VALID [2018-11-23 10:54:40,290 INFO L273 TraceCheckUtils]: 8: Hoare triple {2557#true} assume !(0bv32 != ~p2~0); {2557#true} is VALID [2018-11-23 10:54:40,305 INFO L273 TraceCheckUtils]: 9: Hoare triple {2557#true} assume !(0bv32 != ~p3~0); {2589#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:40,307 INFO L273 TraceCheckUtils]: 10: Hoare triple {2589#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {2589#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:40,307 INFO L273 TraceCheckUtils]: 11: Hoare triple {2589#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {2589#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:40,311 INFO L273 TraceCheckUtils]: 12: Hoare triple {2589#(= (_ bv0 32) main_~p3~0)} assume !(0bv32 != ~p1~0); {2589#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:40,311 INFO L273 TraceCheckUtils]: 13: Hoare triple {2589#(= (_ bv0 32) main_~p3~0)} assume !(0bv32 != ~p2~0); {2589#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:40,313 INFO L273 TraceCheckUtils]: 14: Hoare triple {2589#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p3~0; {2558#false} is VALID [2018-11-23 10:54:40,313 INFO L273 TraceCheckUtils]: 15: Hoare triple {2558#false} assume 1bv32 != ~lk3~0; {2558#false} is VALID [2018-11-23 10:54:40,313 INFO L273 TraceCheckUtils]: 16: Hoare triple {2558#false} assume !false; {2558#false} is VALID [2018-11-23 10:54:40,314 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:40,314 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:40,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:40,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:40,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 10:54:40,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:40,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:40,337 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:40,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:40,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:40,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:40,338 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand 3 states. [2018-11-23 10:54:40,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:40,496 INFO L93 Difference]: Finished difference Result 232 states and 344 transitions. [2018-11-23 10:54:40,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:40,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 10:54:40,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:40,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:40,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2018-11-23 10:54:40,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:40,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2018-11-23 10:54:40,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2018-11-23 10:54:40,659 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:40,662 INFO L225 Difference]: With dead ends: 232 [2018-11-23 10:54:40,662 INFO L226 Difference]: Without dead ends: 138 [2018-11-23 10:54:40,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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:40,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-23 10:54:40,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2018-11-23 10:54:40,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:40,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand 136 states. [2018-11-23 10:54:40,761 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 136 states. [2018-11-23 10:54:40,761 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 136 states. [2018-11-23 10:54:40,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:40,765 INFO L93 Difference]: Finished difference Result 138 states and 195 transitions. [2018-11-23 10:54:40,766 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 195 transitions. [2018-11-23 10:54:40,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:40,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:40,767 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 138 states. [2018-11-23 10:54:40,767 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 138 states. [2018-11-23 10:54:40,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:40,772 INFO L93 Difference]: Finished difference Result 138 states and 195 transitions. [2018-11-23 10:54:40,772 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 195 transitions. [2018-11-23 10:54:40,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:40,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:40,773 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:40,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:40,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-23 10:54:40,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 194 transitions. [2018-11-23 10:54:40,778 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 194 transitions. Word has length 17 [2018-11-23 10:54:40,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:40,778 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 194 transitions. [2018-11-23 10:54:40,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:40,778 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 194 transitions. [2018-11-23 10:54:40,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 10:54:40,779 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:40,779 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:40,779 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:40,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:40,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1100217935, now seen corresponding path program 1 times [2018-11-23 10:54:40,780 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:40,780 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:54:40,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:40,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:40,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:40,852 INFO L256 TraceCheckUtils]: 0: Hoare triple {3288#true} call ULTIMATE.init(); {3288#true} is VALID [2018-11-23 10:54:40,853 INFO L273 TraceCheckUtils]: 1: Hoare triple {3288#true} assume true; {3288#true} is VALID [2018-11-23 10:54:40,853 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3288#true} {3288#true} #112#return; {3288#true} is VALID [2018-11-23 10:54:40,853 INFO L256 TraceCheckUtils]: 3: Hoare triple {3288#true} call #t~ret6 := main(); {3288#true} is VALID [2018-11-23 10:54:40,853 INFO L273 TraceCheckUtils]: 4: Hoare triple {3288#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;havoc ~cond~0; {3288#true} is VALID [2018-11-23 10:54:40,853 INFO L273 TraceCheckUtils]: 5: Hoare triple {3288#true} assume !false;~cond~0 := #t~nondet5;havoc #t~nondet5; {3288#true} is VALID [2018-11-23 10:54:40,854 INFO L273 TraceCheckUtils]: 6: Hoare triple {3288#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32; {3288#true} is VALID [2018-11-23 10:54:40,854 INFO L273 TraceCheckUtils]: 7: Hoare triple {3288#true} assume !(0bv32 != ~p1~0); {3288#true} is VALID [2018-11-23 10:54:40,854 INFO L273 TraceCheckUtils]: 8: Hoare triple {3288#true} assume !(0bv32 != ~p2~0); {3288#true} is VALID [2018-11-23 10:54:40,855 INFO L273 TraceCheckUtils]: 9: Hoare triple {3288#true} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {3320#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:40,858 INFO L273 TraceCheckUtils]: 10: Hoare triple {3320#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {3320#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:40,858 INFO L273 TraceCheckUtils]: 11: Hoare triple {3320#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {3320#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:40,861 INFO L273 TraceCheckUtils]: 12: Hoare triple {3320#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p1~0); {3320#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:40,861 INFO L273 TraceCheckUtils]: 13: Hoare triple {3320#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p2~0); {3320#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:40,863 INFO L273 TraceCheckUtils]: 14: Hoare triple {3320#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p3~0); {3289#false} is VALID [2018-11-23 10:54:40,863 INFO L273 TraceCheckUtils]: 15: Hoare triple {3289#false} assume 0bv32 != ~p4~0; {3289#false} is VALID [2018-11-23 10:54:40,863 INFO L273 TraceCheckUtils]: 16: Hoare triple {3289#false} assume 1bv32 != ~lk4~0; {3289#false} is VALID [2018-11-23 10:54:40,863 INFO L273 TraceCheckUtils]: 17: Hoare triple {3289#false} assume !false; {3289#false} is VALID [2018-11-23 10:54:40,864 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:40,864 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:40,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:40,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:40,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 10:54:40,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:40,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:40,887 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:40,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:40,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:40,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:40,888 INFO L87 Difference]: Start difference. First operand 136 states and 194 transitions. Second operand 3 states. [2018-11-23 10:54:41,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:41,057 INFO L93 Difference]: Finished difference Result 204 states and 288 transitions. [2018-11-23 10:54:41,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:41,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 10:54:41,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:41,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:41,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-23 10:54:41,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:41,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-23 10:54:41,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2018-11-23 10:54:41,673 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:41,677 INFO L225 Difference]: With dead ends: 204 [2018-11-23 10:54:41,677 INFO L226 Difference]: Without dead ends: 142 [2018-11-23 10:54:41,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-23 10:54:41,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2018-11-23 10:54:41,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:41,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand 140 states. [2018-11-23 10:54:41,741 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 140 states. [2018-11-23 10:54:41,741 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 140 states. [2018-11-23 10:54:41,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:41,746 INFO L93 Difference]: Finished difference Result 142 states and 195 transitions. [2018-11-23 10:54:41,746 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 195 transitions. [2018-11-23 10:54:41,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:41,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:41,747 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 142 states. [2018-11-23 10:54:41,747 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 142 states. [2018-11-23 10:54:41,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:41,751 INFO L93 Difference]: Finished difference Result 142 states and 195 transitions. [2018-11-23 10:54:41,751 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 195 transitions. [2018-11-23 10:54:41,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:41,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:41,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:41,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:41,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-23 10:54:41,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 194 transitions. [2018-11-23 10:54:41,756 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 194 transitions. Word has length 18 [2018-11-23 10:54:41,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:41,757 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 194 transitions. [2018-11-23 10:54:41,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:41,757 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 194 transitions. [2018-11-23 10:54:41,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 10:54:41,758 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:41,758 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:41,758 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:41,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:41,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1780276305, now seen corresponding path program 1 times [2018-11-23 10:54:41,759 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:41,759 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:54:41,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:41,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:41,861 INFO L256 TraceCheckUtils]: 0: Hoare triple {4006#true} call ULTIMATE.init(); {4006#true} is VALID [2018-11-23 10:54:41,861 INFO L273 TraceCheckUtils]: 1: Hoare triple {4006#true} assume true; {4006#true} is VALID [2018-11-23 10:54:41,861 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4006#true} {4006#true} #112#return; {4006#true} is VALID [2018-11-23 10:54:41,862 INFO L256 TraceCheckUtils]: 3: Hoare triple {4006#true} call #t~ret6 := main(); {4006#true} is VALID [2018-11-23 10:54:41,862 INFO L273 TraceCheckUtils]: 4: Hoare triple {4006#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;havoc ~cond~0; {4006#true} is VALID [2018-11-23 10:54:41,862 INFO L273 TraceCheckUtils]: 5: Hoare triple {4006#true} assume !false;~cond~0 := #t~nondet5;havoc #t~nondet5; {4006#true} is VALID [2018-11-23 10:54:41,862 INFO L273 TraceCheckUtils]: 6: Hoare triple {4006#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32; {4006#true} is VALID [2018-11-23 10:54:41,862 INFO L273 TraceCheckUtils]: 7: Hoare triple {4006#true} assume !(0bv32 != ~p1~0); {4006#true} is VALID [2018-11-23 10:54:41,863 INFO L273 TraceCheckUtils]: 8: Hoare triple {4006#true} assume !(0bv32 != ~p2~0); {4006#true} is VALID [2018-11-23 10:54:41,863 INFO L273 TraceCheckUtils]: 9: Hoare triple {4006#true} assume !(0bv32 != ~p3~0); {4006#true} is VALID [2018-11-23 10:54:41,870 INFO L273 TraceCheckUtils]: 10: Hoare triple {4006#true} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {4041#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:41,871 INFO L273 TraceCheckUtils]: 11: Hoare triple {4041#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {4041#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:41,872 INFO L273 TraceCheckUtils]: 12: Hoare triple {4041#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {4041#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:41,875 INFO L273 TraceCheckUtils]: 13: Hoare triple {4041#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {4041#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:41,875 INFO L273 TraceCheckUtils]: 14: Hoare triple {4041#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {4041#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:41,877 INFO L273 TraceCheckUtils]: 15: Hoare triple {4041#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0; {4041#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:41,877 INFO L273 TraceCheckUtils]: 16: Hoare triple {4041#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk4~0; {4007#false} is VALID [2018-11-23 10:54:41,877 INFO L273 TraceCheckUtils]: 17: Hoare triple {4007#false} assume !false; {4007#false} is VALID [2018-11-23 10:54:41,878 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:41,878 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:41,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:41,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:41,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 10:54:41,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:41,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:41,919 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:41,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:41,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:41,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:41,920 INFO L87 Difference]: Start difference. First operand 140 states and 194 transitions. Second operand 3 states. [2018-11-23 10:54:42,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:42,179 INFO L93 Difference]: Finished difference Result 236 states and 328 transitions. [2018-11-23 10:54:42,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:42,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 10:54:42,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:42,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:42,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2018-11-23 10:54:42,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:42,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2018-11-23 10:54:42,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2018-11-23 10:54:42,382 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:42,386 INFO L225 Difference]: With dead ends: 236 [2018-11-23 10:54:42,386 INFO L226 Difference]: Without dead ends: 234 [2018-11-23 10:54:42,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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:42,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-11-23 10:54:42,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 200. [2018-11-23 10:54:42,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:42,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 234 states. Second operand 200 states. [2018-11-23 10:54:42,516 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand 200 states. [2018-11-23 10:54:42,517 INFO L87 Difference]: Start difference. First operand 234 states. Second operand 200 states. [2018-11-23 10:54:42,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:42,522 INFO L93 Difference]: Finished difference Result 234 states and 319 transitions. [2018-11-23 10:54:42,523 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 319 transitions. [2018-11-23 10:54:42,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:42,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:42,523 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand 234 states. [2018-11-23 10:54:42,524 INFO L87 Difference]: Start difference. First operand 200 states. Second operand 234 states. [2018-11-23 10:54:42,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:42,529 INFO L93 Difference]: Finished difference Result 234 states and 319 transitions. [2018-11-23 10:54:42,530 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 319 transitions. [2018-11-23 10:54:42,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:42,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:42,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:42,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:42,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-23 10:54:42,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 270 transitions. [2018-11-23 10:54:42,535 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 270 transitions. Word has length 18 [2018-11-23 10:54:42,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:42,536 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 270 transitions. [2018-11-23 10:54:42,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:42,536 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 270 transitions. [2018-11-23 10:54:42,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 10:54:42,537 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:42,537 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:42,537 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:42,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:42,538 INFO L82 PathProgramCache]: Analyzing trace with hash 970929679, now seen corresponding path program 1 times [2018-11-23 10:54:42,538 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:42,538 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:54:42,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:42,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:42,981 INFO L256 TraceCheckUtils]: 0: Hoare triple {5004#true} call ULTIMATE.init(); {5004#true} is VALID [2018-11-23 10:54:42,982 INFO L273 TraceCheckUtils]: 1: Hoare triple {5004#true} assume true; {5004#true} is VALID [2018-11-23 10:54:42,982 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5004#true} {5004#true} #112#return; {5004#true} is VALID [2018-11-23 10:54:42,982 INFO L256 TraceCheckUtils]: 3: Hoare triple {5004#true} call #t~ret6 := main(); {5004#true} is VALID [2018-11-23 10:54:42,983 INFO L273 TraceCheckUtils]: 4: Hoare triple {5004#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;havoc ~cond~0; {5004#true} is VALID [2018-11-23 10:54:42,983 INFO L273 TraceCheckUtils]: 5: Hoare triple {5004#true} assume !false;~cond~0 := #t~nondet5;havoc #t~nondet5; {5004#true} is VALID [2018-11-23 10:54:42,983 INFO L273 TraceCheckUtils]: 6: Hoare triple {5004#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32; {5004#true} is VALID [2018-11-23 10:54:42,984 INFO L273 TraceCheckUtils]: 7: Hoare triple {5004#true} assume !(0bv32 != ~p1~0); {5004#true} is VALID [2018-11-23 10:54:42,984 INFO L273 TraceCheckUtils]: 8: Hoare triple {5004#true} assume !(0bv32 != ~p2~0); {5004#true} is VALID [2018-11-23 10:54:42,984 INFO L273 TraceCheckUtils]: 9: Hoare triple {5004#true} assume !(0bv32 != ~p3~0); {5004#true} is VALID [2018-11-23 10:54:42,986 INFO L273 TraceCheckUtils]: 10: Hoare triple {5004#true} assume !(0bv32 != ~p4~0); {5039#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:42,986 INFO L273 TraceCheckUtils]: 11: Hoare triple {5039#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {5039#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:42,988 INFO L273 TraceCheckUtils]: 12: Hoare triple {5039#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p1~0); {5039#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:42,988 INFO L273 TraceCheckUtils]: 13: Hoare triple {5039#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p2~0); {5039#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:42,989 INFO L273 TraceCheckUtils]: 14: Hoare triple {5039#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p3~0); {5039#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:42,989 INFO L273 TraceCheckUtils]: 15: Hoare triple {5039#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p4~0; {5005#false} is VALID [2018-11-23 10:54:42,990 INFO L273 TraceCheckUtils]: 16: Hoare triple {5005#false} assume 1bv32 != ~lk4~0; {5005#false} is VALID [2018-11-23 10:54:42,990 INFO L273 TraceCheckUtils]: 17: Hoare triple {5005#false} assume !false; {5005#false} is VALID [2018-11-23 10:54:42,991 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:42,991 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:42,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:42,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:42,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 10:54:42,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:42,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:43,008 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:43,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:43,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:43,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:43,009 INFO L87 Difference]: Start difference. First operand 200 states and 270 transitions. Second operand 3 states. [2018-11-23 10:54:43,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:43,730 INFO L93 Difference]: Finished difference Result 444 states and 592 transitions. [2018-11-23 10:54:43,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:43,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 10:54:43,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:43,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:43,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2018-11-23 10:54:43,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:43,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2018-11-23 10:54:43,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 92 transitions. [2018-11-23 10:54:44,297 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:44,303 INFO L225 Difference]: With dead ends: 444 [2018-11-23 10:54:44,303 INFO L226 Difference]: Without dead ends: 258 [2018-11-23 10:54:44,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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:44,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-11-23 10:54:44,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2018-11-23 10:54:44,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:44,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 258 states. Second operand 256 states. [2018-11-23 10:54:44,528 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand 256 states. [2018-11-23 10:54:44,528 INFO L87 Difference]: Start difference. First operand 258 states. Second operand 256 states. [2018-11-23 10:54:44,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:44,535 INFO L93 Difference]: Finished difference Result 258 states and 327 transitions. [2018-11-23 10:54:44,536 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 327 transitions. [2018-11-23 10:54:44,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:44,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:44,537 INFO L74 IsIncluded]: Start isIncluded. First operand 256 states. Second operand 258 states. [2018-11-23 10:54:44,537 INFO L87 Difference]: Start difference. First operand 256 states. Second operand 258 states. [2018-11-23 10:54:44,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:44,543 INFO L93 Difference]: Finished difference Result 258 states and 327 transitions. [2018-11-23 10:54:44,544 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 327 transitions. [2018-11-23 10:54:44,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:44,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:44,545 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:44,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:44,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-11-23 10:54:44,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 326 transitions. [2018-11-23 10:54:44,551 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 326 transitions. Word has length 18 [2018-11-23 10:54:44,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:44,551 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 326 transitions. [2018-11-23 10:54:44,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:44,551 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 326 transitions. [2018-11-23 10:54:44,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 10:54:44,552 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:44,553 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:44,553 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:44,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:44,553 INFO L82 PathProgramCache]: Analyzing trace with hash -645793370, now seen corresponding path program 1 times [2018-11-23 10:54:44,553 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:44,554 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:54:44,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:44,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:44,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:44,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:45,006 INFO L256 TraceCheckUtils]: 0: Hoare triple {6330#true} call ULTIMATE.init(); {6330#true} is VALID [2018-11-23 10:54:45,007 INFO L273 TraceCheckUtils]: 1: Hoare triple {6330#true} assume true; {6330#true} is VALID [2018-11-23 10:54:45,007 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6330#true} {6330#true} #112#return; {6330#true} is VALID [2018-11-23 10:54:45,007 INFO L256 TraceCheckUtils]: 3: Hoare triple {6330#true} call #t~ret6 := main(); {6330#true} is VALID [2018-11-23 10:54:45,007 INFO L273 TraceCheckUtils]: 4: Hoare triple {6330#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;havoc ~cond~0; {6330#true} is VALID [2018-11-23 10:54:45,008 INFO L273 TraceCheckUtils]: 5: Hoare triple {6330#true} assume !false;~cond~0 := #t~nondet5;havoc #t~nondet5; {6330#true} is VALID [2018-11-23 10:54:45,008 INFO L273 TraceCheckUtils]: 6: Hoare triple {6330#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32; {6330#true} is VALID [2018-11-23 10:54:45,008 INFO L273 TraceCheckUtils]: 7: Hoare triple {6330#true} assume !(0bv32 != ~p1~0); {6330#true} is VALID [2018-11-23 10:54:45,008 INFO L273 TraceCheckUtils]: 8: Hoare triple {6330#true} assume !(0bv32 != ~p2~0); {6330#true} is VALID [2018-11-23 10:54:45,009 INFO L273 TraceCheckUtils]: 9: Hoare triple {6330#true} assume !(0bv32 != ~p3~0); {6330#true} is VALID [2018-11-23 10:54:45,012 INFO L273 TraceCheckUtils]: 10: Hoare triple {6330#true} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {6365#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:45,012 INFO L273 TraceCheckUtils]: 11: Hoare triple {6365#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {6365#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:45,012 INFO L273 TraceCheckUtils]: 12: Hoare triple {6365#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p1~0); {6365#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:45,022 INFO L273 TraceCheckUtils]: 13: Hoare triple {6365#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p2~0); {6365#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:45,022 INFO L273 TraceCheckUtils]: 14: Hoare triple {6365#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p3~0); {6365#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:45,040 INFO L273 TraceCheckUtils]: 15: Hoare triple {6365#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p4~0); {6331#false} is VALID [2018-11-23 10:54:45,040 INFO L273 TraceCheckUtils]: 16: Hoare triple {6331#false} assume 0bv32 != ~p5~0; {6331#false} is VALID [2018-11-23 10:54:45,041 INFO L273 TraceCheckUtils]: 17: Hoare triple {6331#false} assume 1bv32 != ~lk5~0; {6331#false} is VALID [2018-11-23 10:54:45,041 INFO L273 TraceCheckUtils]: 18: Hoare triple {6331#false} assume !false; {6331#false} is VALID [2018-11-23 10:54:45,041 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:45,042 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:45,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:45,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:45,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 10:54:45,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:45,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:45,118 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:45,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:45,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:45,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:45,119 INFO L87 Difference]: Start difference. First operand 256 states and 326 transitions. Second operand 3 states. [2018-11-23 10:54:45,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:45,469 INFO L93 Difference]: Finished difference Result 384 states and 484 transitions. [2018-11-23 10:54:45,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:45,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 10:54:45,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:45,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:45,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2018-11-23 10:54:45,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:45,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2018-11-23 10:54:45,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 87 transitions. [2018-11-23 10:54:45,970 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:45,977 INFO L225 Difference]: With dead ends: 384 [2018-11-23 10:54:45,977 INFO L226 Difference]: Without dead ends: 266 [2018-11-23 10:54:45,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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:54:45,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-11-23 10:54:46,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2018-11-23 10:54:46,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:46,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 266 states. Second operand 264 states. [2018-11-23 10:54:46,219 INFO L74 IsIncluded]: Start isIncluded. First operand 266 states. Second operand 264 states. [2018-11-23 10:54:46,219 INFO L87 Difference]: Start difference. First operand 266 states. Second operand 264 states. [2018-11-23 10:54:46,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:46,228 INFO L93 Difference]: Finished difference Result 266 states and 327 transitions. [2018-11-23 10:54:46,228 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 327 transitions. [2018-11-23 10:54:46,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:46,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:46,229 INFO L74 IsIncluded]: Start isIncluded. First operand 264 states. Second operand 266 states. [2018-11-23 10:54:46,229 INFO L87 Difference]: Start difference. First operand 264 states. Second operand 266 states. [2018-11-23 10:54:46,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:46,238 INFO L93 Difference]: Finished difference Result 266 states and 327 transitions. [2018-11-23 10:54:46,238 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 327 transitions. [2018-11-23 10:54:46,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:46,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:46,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:46,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:46,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-11-23 10:54:46,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 326 transitions. [2018-11-23 10:54:46,248 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 326 transitions. Word has length 19 [2018-11-23 10:54:46,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:46,248 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 326 transitions. [2018-11-23 10:54:46,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:46,248 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 326 transitions. [2018-11-23 10:54:46,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 10:54:46,249 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:46,249 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:46,250 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:46,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:46,250 INFO L82 PathProgramCache]: Analyzing trace with hash 34265000, now seen corresponding path program 1 times [2018-11-23 10:54:46,250 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:46,250 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:54:46,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:46,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:46,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:46,660 INFO L256 TraceCheckUtils]: 0: Hoare triple {7623#true} call ULTIMATE.init(); {7623#true} is VALID [2018-11-23 10:54:46,660 INFO L273 TraceCheckUtils]: 1: Hoare triple {7623#true} assume true; {7623#true} is VALID [2018-11-23 10:54:46,661 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7623#true} {7623#true} #112#return; {7623#true} is VALID [2018-11-23 10:54:46,661 INFO L256 TraceCheckUtils]: 3: Hoare triple {7623#true} call #t~ret6 := main(); {7623#true} is VALID [2018-11-23 10:54:46,661 INFO L273 TraceCheckUtils]: 4: Hoare triple {7623#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;havoc ~cond~0; {7623#true} is VALID [2018-11-23 10:54:46,662 INFO L273 TraceCheckUtils]: 5: Hoare triple {7623#true} assume !false;~cond~0 := #t~nondet5;havoc #t~nondet5; {7623#true} is VALID [2018-11-23 10:54:46,662 INFO L273 TraceCheckUtils]: 6: Hoare triple {7623#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32; {7623#true} is VALID [2018-11-23 10:54:46,662 INFO L273 TraceCheckUtils]: 7: Hoare triple {7623#true} assume !(0bv32 != ~p1~0); {7623#true} is VALID [2018-11-23 10:54:46,662 INFO L273 TraceCheckUtils]: 8: Hoare triple {7623#true} assume !(0bv32 != ~p2~0); {7623#true} is VALID [2018-11-23 10:54:46,662 INFO L273 TraceCheckUtils]: 9: Hoare triple {7623#true} assume !(0bv32 != ~p3~0); {7623#true} is VALID [2018-11-23 10:54:46,663 INFO L273 TraceCheckUtils]: 10: Hoare triple {7623#true} assume !(0bv32 != ~p4~0); {7623#true} is VALID [2018-11-23 10:54:46,668 INFO L273 TraceCheckUtils]: 11: Hoare triple {7623#true} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {7661#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:46,668 INFO L273 TraceCheckUtils]: 12: Hoare triple {7661#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {7661#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:46,670 INFO L273 TraceCheckUtils]: 13: Hoare triple {7661#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {7661#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:46,670 INFO L273 TraceCheckUtils]: 14: Hoare triple {7661#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {7661#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:46,673 INFO L273 TraceCheckUtils]: 15: Hoare triple {7661#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {7661#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:46,673 INFO L273 TraceCheckUtils]: 16: Hoare triple {7661#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0; {7661#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:46,673 INFO L273 TraceCheckUtils]: 17: Hoare triple {7661#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk5~0; {7624#false} is VALID [2018-11-23 10:54:46,674 INFO L273 TraceCheckUtils]: 18: Hoare triple {7624#false} assume !false; {7624#false} is VALID [2018-11-23 10:54:46,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:54:46,675 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:46,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:46,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:46,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 10:54:46,677 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:46,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:46,699 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:46,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:46,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:46,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:46,700 INFO L87 Difference]: Start difference. First operand 264 states and 326 transitions. Second operand 3 states. [2018-11-23 10:54:47,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:47,154 INFO L93 Difference]: Finished difference Result 426 states and 519 transitions. [2018-11-23 10:54:47,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:47,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 10:54:47,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:47,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:47,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2018-11-23 10:54:47,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:47,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2018-11-23 10:54:47,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 53 transitions. [2018-11-23 10:54:47,553 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:47,563 INFO L225 Difference]: With dead ends: 426 [2018-11-23 10:54:47,563 INFO L226 Difference]: Without dead ends: 424 [2018-11-23 10:54:47,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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:47,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-11-23 10:54:47,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 392. [2018-11-23 10:54:47,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:47,924 INFO L82 GeneralOperation]: Start isEquivalent. First operand 424 states. Second operand 392 states. [2018-11-23 10:54:47,924 INFO L74 IsIncluded]: Start isIncluded. First operand 424 states. Second operand 392 states. [2018-11-23 10:54:47,924 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 392 states. [2018-11-23 10:54:47,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:47,941 INFO L93 Difference]: Finished difference Result 424 states and 502 transitions. [2018-11-23 10:54:47,941 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 502 transitions. [2018-11-23 10:54:47,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:47,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:47,942 INFO L74 IsIncluded]: Start isIncluded. First operand 392 states. Second operand 424 states. [2018-11-23 10:54:47,942 INFO L87 Difference]: Start difference. First operand 392 states. Second operand 424 states. [2018-11-23 10:54:47,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:47,957 INFO L93 Difference]: Finished difference Result 424 states and 502 transitions. [2018-11-23 10:54:47,957 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 502 transitions. [2018-11-23 10:54:47,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:47,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:47,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:47,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:47,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-11-23 10:54:47,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 470 transitions. [2018-11-23 10:54:47,974 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 470 transitions. Word has length 19 [2018-11-23 10:54:47,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:47,975 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 470 transitions. [2018-11-23 10:54:47,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:47,975 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 470 transitions. [2018-11-23 10:54:47,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 10:54:47,976 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:47,976 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:47,976 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:47,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:47,977 INFO L82 PathProgramCache]: Analyzing trace with hash -775081626, now seen corresponding path program 1 times [2018-11-23 10:54:47,977 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:47,977 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:54:48,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:48,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:48,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:48,374 INFO L256 TraceCheckUtils]: 0: Hoare triple {9409#true} call ULTIMATE.init(); {9409#true} is VALID [2018-11-23 10:54:48,374 INFO L273 TraceCheckUtils]: 1: Hoare triple {9409#true} assume true; {9409#true} is VALID [2018-11-23 10:54:48,374 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {9409#true} {9409#true} #112#return; {9409#true} is VALID [2018-11-23 10:54:48,374 INFO L256 TraceCheckUtils]: 3: Hoare triple {9409#true} call #t~ret6 := main(); {9409#true} is VALID [2018-11-23 10:54:48,375 INFO L273 TraceCheckUtils]: 4: Hoare triple {9409#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;havoc ~cond~0; {9409#true} is VALID [2018-11-23 10:54:48,375 INFO L273 TraceCheckUtils]: 5: Hoare triple {9409#true} assume !false;~cond~0 := #t~nondet5;havoc #t~nondet5; {9409#true} is VALID [2018-11-23 10:54:48,375 INFO L273 TraceCheckUtils]: 6: Hoare triple {9409#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32; {9409#true} is VALID [2018-11-23 10:54:48,375 INFO L273 TraceCheckUtils]: 7: Hoare triple {9409#true} assume !(0bv32 != ~p1~0); {9409#true} is VALID [2018-11-23 10:54:48,375 INFO L273 TraceCheckUtils]: 8: Hoare triple {9409#true} assume !(0bv32 != ~p2~0); {9409#true} is VALID [2018-11-23 10:54:48,376 INFO L273 TraceCheckUtils]: 9: Hoare triple {9409#true} assume !(0bv32 != ~p3~0); {9409#true} is VALID [2018-11-23 10:54:48,376 INFO L273 TraceCheckUtils]: 10: Hoare triple {9409#true} assume !(0bv32 != ~p4~0); {9409#true} is VALID [2018-11-23 10:54:48,376 INFO L273 TraceCheckUtils]: 11: Hoare triple {9409#true} assume !(0bv32 != ~p5~0); {9447#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:48,377 INFO L273 TraceCheckUtils]: 12: Hoare triple {9447#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p1~0); {9447#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:48,377 INFO L273 TraceCheckUtils]: 13: Hoare triple {9447#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p2~0); {9447#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:48,378 INFO L273 TraceCheckUtils]: 14: Hoare triple {9447#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p3~0); {9447#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:48,378 INFO L273 TraceCheckUtils]: 15: Hoare triple {9447#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p4~0); {9447#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:48,379 INFO L273 TraceCheckUtils]: 16: Hoare triple {9447#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p5~0; {9410#false} is VALID [2018-11-23 10:54:48,379 INFO L273 TraceCheckUtils]: 17: Hoare triple {9410#false} assume 1bv32 != ~lk5~0; {9410#false} is VALID [2018-11-23 10:54:48,379 INFO L273 TraceCheckUtils]: 18: Hoare triple {9410#false} assume !false; {9410#false} is VALID [2018-11-23 10:54:48,380 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:48,380 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:48,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:48,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:48,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 10:54:48,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:48,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:48,415 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:48,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:48,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:48,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:48,416 INFO L87 Difference]: Start difference. First operand 392 states and 470 transitions. Second operand 3 states. [2018-11-23 10:54:48,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:48,869 INFO L93 Difference]: Finished difference Result 856 states and 998 transitions. [2018-11-23 10:54:48,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:48,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 10:54:48,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:48,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:48,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2018-11-23 10:54:48,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:48,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2018-11-23 10:54:48,873 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 87 transitions. [2018-11-23 10:54:49,423 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:49,424 INFO L225 Difference]: With dead ends: 856 [2018-11-23 10:54:49,424 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 10:54:49,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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:49,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 10:54:49,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 10:54:49,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:49,426 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 10:54:49,426 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 10:54:49,426 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 10:54:49,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:49,427 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 10:54:49,427 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 10:54:49,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:49,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:49,427 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 10:54:49,428 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 10:54:49,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:49,428 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 10:54:49,428 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 10:54:49,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:49,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:49,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:49,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:49,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 10:54:49,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 10:54:49,429 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2018-11-23 10:54:49,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:49,429 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 10:54:49,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:49,429 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 10:54:49,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:49,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 10:54:49,661 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 10:54:49,661 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 10:54:49,661 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 10:54:49,661 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 10:54:49,661 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 10:54:49,661 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 10:54:49,662 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-23 10:54:49,662 INFO L451 ceAbstractionStarter]: At program point L89(lines 5 93) the Hoare annotation is: true [2018-11-23 10:54:49,662 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 93) no Hoare annotation was computed. [2018-11-23 10:54:49,662 INFO L448 ceAbstractionStarter]: For program point L73-1(lines 24 88) no Hoare annotation was computed. [2018-11-23 10:54:49,662 INFO L448 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2018-11-23 10:54:49,662 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 24 88) no Hoare annotation was computed. [2018-11-23 10:54:49,662 INFO L448 ceAbstractionStarter]: For program point L53-1(lines 24 88) no Hoare annotation was computed. [2018-11-23 10:54:49,662 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) no Hoare annotation was computed. [2018-11-23 10:54:49,662 INFO L448 ceAbstractionStarter]: For program point L49-1(lines 24 88) no Hoare annotation was computed. [2018-11-23 10:54:49,663 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 24 88) no Hoare annotation was computed. [2018-11-23 10:54:49,663 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 24 88) no Hoare annotation was computed. [2018-11-23 10:54:49,663 INFO L448 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2018-11-23 10:54:49,663 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2018-11-23 10:54:49,663 INFO L448 ceAbstractionStarter]: For program point L41-2(lines 24 88) no Hoare annotation was computed. [2018-11-23 10:54:49,663 INFO L451 ceAbstractionStarter]: At program point L83-1(lines 24 88) the Hoare annotation is: true [2018-11-23 10:54:49,663 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-23 10:54:49,663 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 93) no Hoare annotation was computed. [2018-11-23 10:54:49,663 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 24 88) no Hoare annotation was computed. [2018-11-23 10:54:49,663 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 93) the Hoare annotation is: true [2018-11-23 10:54:49,663 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. [2018-11-23 10:54:49,663 INFO L448 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2018-11-23 10:54:49,664 INFO L444 ceAbstractionStarter]: At program point L84-1(lines 5 93) the Hoare annotation is: false [2018-11-23 10:54:49,664 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 24 88) no Hoare annotation was computed. [2018-11-23 10:54:49,665 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 10:54:49,665 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 10:54:49,665 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 10:54:49,665 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2018-11-23 10:54:49,665 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 10:54:49,666 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 10:54:49,666 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2018-11-23 10:54:49,666 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2018-11-23 10:54:49,666 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 10:54:49,666 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-23 10:54:49,666 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-23 10:54:49,666 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 10:54:49,666 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2018-11-23 10:54:49,666 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2018-11-23 10:54:49,666 WARN L170 areAnnotationChecker]: L45-1 has no Hoare annotation [2018-11-23 10:54:49,666 WARN L170 areAnnotationChecker]: L45-1 has no Hoare annotation [2018-11-23 10:54:49,666 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2018-11-23 10:54:49,666 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2018-11-23 10:54:49,666 WARN L170 areAnnotationChecker]: L53-1 has no Hoare annotation [2018-11-23 10:54:49,667 WARN L170 areAnnotationChecker]: L53-1 has no Hoare annotation [2018-11-23 10:54:49,667 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2018-11-23 10:54:49,667 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2018-11-23 10:54:49,667 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2018-11-23 10:54:49,667 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2018-11-23 10:54:49,667 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2018-11-23 10:54:49,667 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2018-11-23 10:54:49,667 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-23 10:54:49,667 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 10:54:49,667 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2018-11-23 10:54:49,667 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2018-11-23 10:54:49,667 WARN L170 areAnnotationChecker]: L68-1 has no Hoare annotation [2018-11-23 10:54:49,667 WARN L170 areAnnotationChecker]: L68-1 has no Hoare annotation [2018-11-23 10:54:49,668 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2018-11-23 10:54:49,668 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2018-11-23 10:54:49,668 WARN L170 areAnnotationChecker]: L73-1 has no Hoare annotation [2018-11-23 10:54:49,668 WARN L170 areAnnotationChecker]: L73-1 has no Hoare annotation [2018-11-23 10:54:49,668 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2018-11-23 10:54:49,668 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2018-11-23 10:54:49,668 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2018-11-23 10:54:49,668 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2018-11-23 10:54:49,668 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2018-11-23 10:54:49,668 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2018-11-23 10:54:49,668 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 10:54:49,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:54:49 BoogieIcfgContainer [2018-11-23 10:54:49,674 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 10:54:49,674 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 10:54:49,674 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 10:54:49,675 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 10:54:49,675 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:54:34" (3/4) ... [2018-11-23 10:54:49,678 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 10:54:49,686 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 10:54:49,686 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 10:54:49,692 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 10:54:49,692 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 10:54:49,692 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 10:54:49,766 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c-witness.graphml [2018-11-23 10:54:49,770 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 10:54:49,771 INFO L168 Benchmark]: Toolchain (without parser) took 16164.80 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 873.5 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -488.9 MB). Peak memory consumption was 384.6 MB. Max. memory is 7.1 GB. [2018-11-23 10:54:49,773 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 10:54:49,774 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.46 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 10:54:49,774 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.34 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 10:54:49,781 INFO L168 Benchmark]: Boogie Preprocessor took 49.41 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 10:54:49,781 INFO L168 Benchmark]: RCFGBuilder took 790.14 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 768.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -801.7 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-23 10:54:49,782 INFO L168 Benchmark]: TraceAbstraction took 14868.85 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 105.4 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 288.8 MB). Peak memory consumption was 394.2 MB. Max. memory is 7.1 GB. [2018-11-23 10:54:49,782 INFO L168 Benchmark]: Witness Printer took 95.52 ms. Allocated memory is still 2.4 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2018-11-23 10:54:49,785 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 327.46 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 27.34 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.41 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 790.14 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 768.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -801.7 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14868.85 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 105.4 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 288.8 MB). Peak memory consumption was 394.2 MB. Max. memory is 7.1 GB. * Witness Printer took 95.52 ms. Allocated memory is still 2.4 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. SAFE Result, 14.8s OverallTime, 14 OverallIterations, 1 TraceHistogramMax, 8.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 654 SDtfs, 285 SDslu, 428 SDs, 0 SdLazy, 75 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 226 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=392occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 138 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 42 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 240 NumberOfCodeBlocks, 240 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 7384 SizeOfPredicates, 5 NumberOfNonLiveVariables, 489 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...