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_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:41:54,780 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:41:54,783 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:41:54,794 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:41:54,794 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:41:54,795 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:41:54,797 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:41:54,799 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:41:54,800 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:41:54,801 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:41:54,802 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:41:54,803 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:41:54,804 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:41:54,805 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:41:54,806 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:41:54,807 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:41:54,808 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:41:54,810 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:41:54,812 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:41:54,813 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:41:54,815 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:41:54,816 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:41:54,819 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:41:54,819 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:41:54,819 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:41:54,820 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:41:54,821 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:41:54,822 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:41:54,823 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:41:54,824 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:41:54,825 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:41:54,825 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:41:54,826 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:41:54,826 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:41:54,827 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:41:54,828 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:41:54,828 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:41:54,854 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:41:54,855 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:41:54,855 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:41:54,858 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:41:54,858 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:41:54,859 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:41:54,859 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:41:54,859 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:41:54,859 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:41:54,859 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:41:54,860 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:41:54,860 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:41:54,860 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:41:54,860 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:41:54,860 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:41:54,861 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:41:54,863 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:41:54,864 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:41:54,864 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:41:54,864 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:41:54,864 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:41:54,864 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:41:54,865 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:41:54,865 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:41:54,865 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:41:54,865 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:41:54,865 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:41:54,866 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:41:54,866 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:41:54,866 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:41:54,866 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:41:54,916 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:41:54,933 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:41:54,937 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:41:54,939 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:41:54,939 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:41:54,940 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 12:41:55,005 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f593012a/557ed0009b4c40d4b68e1600a7d0be62/FLAG054e692f2 [2018-11-23 12:41:55,433 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:41:55,434 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 12:41:55,443 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f593012a/557ed0009b4c40d4b68e1600a7d0be62/FLAG054e692f2 [2018-11-23 12:41:55,793 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f593012a/557ed0009b4c40d4b68e1600a7d0be62 [2018-11-23 12:41:55,803 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:41:55,805 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:41:55,805 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:41:55,806 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:41:55,810 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:41:55,811 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:41:55" (1/1) ... [2018-11-23 12:41:55,814 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59565e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:55, skipping insertion in model container [2018-11-23 12:41:55,815 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:41:55" (1/1) ... [2018-11-23 12:41:55,826 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:41:55,860 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:41:56,181 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:41:56,189 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:41:56,227 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:41:56,244 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:41:56,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:56 WrapperNode [2018-11-23 12:41:56,245 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:41:56,246 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:41:56,246 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:41:56,247 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:41:56,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:56" (1/1) ... [2018-11-23 12:41:56,267 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:56" (1/1) ... [2018-11-23 12:41:56,277 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:41:56,277 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:41:56,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:41:56,278 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:41:56,289 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:56" (1/1) ... [2018-11-23 12:41:56,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:56" (1/1) ... [2018-11-23 12:41:56,291 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:56" (1/1) ... [2018-11-23 12:41:56,292 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:56" (1/1) ... [2018-11-23 12:41:56,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:56" (1/1) ... [2018-11-23 12:41:56,347 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:56" (1/1) ... [2018-11-23 12:41:56,349 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:56" (1/1) ... [2018-11-23 12:41:56,355 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:41:56,359 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:41:56,359 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:41:56,360 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:41:56,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:56" (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 12:41:56,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:41:56,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:41:56,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:41:56,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:41:56,543 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:41:56,543 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:41:57,694 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:41:57,695 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 12:41:57,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:41:57 BoogieIcfgContainer [2018-11-23 12:41:57,695 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:41:57,696 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:41:57,696 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:41:57,700 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:41:57,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:41:55" (1/3) ... [2018-11-23 12:41:57,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d48232f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:41:57, skipping insertion in model container [2018-11-23 12:41:57,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:56" (2/3) ... [2018-11-23 12:41:57,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d48232f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:41:57, skipping insertion in model container [2018-11-23 12:41:57,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:41:57" (3/3) ... [2018-11-23 12:41:57,704 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 12:41:57,715 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:41:57,726 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:41:57,744 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:41:57,779 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:41:57,779 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:41:57,780 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:41:57,780 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:41:57,782 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:41:57,782 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:41:57,782 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:41:57,783 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:41:57,783 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:41:57,804 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-11-23 12:41:57,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:41:57,811 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:57,813 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:41:57,815 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:57,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:57,821 INFO L82 PathProgramCache]: Analyzing trace with hash 2062980600, now seen corresponding path program 1 times [2018-11-23 12:41:57,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:57,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:57,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:57,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:57,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:58,095 INFO L256 TraceCheckUtils]: 0: Hoare triple {56#true} call ULTIMATE.init(); {56#true} is VALID [2018-11-23 12:41:58,099 INFO L273 TraceCheckUtils]: 1: Hoare triple {56#true} assume true; {56#true} is VALID [2018-11-23 12:41:58,100 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {56#true} {56#true} #248#return; {56#true} is VALID [2018-11-23 12:41:58,100 INFO L256 TraceCheckUtils]: 3: Hoare triple {56#true} call #t~ret14 := main(); {56#true} is VALID [2018-11-23 12:41:58,101 INFO L273 TraceCheckUtils]: 4: Hoare triple {56#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {56#true} is VALID [2018-11-23 12:41:58,102 INFO L273 TraceCheckUtils]: 5: Hoare triple {56#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {56#true} is VALID [2018-11-23 12:41:58,102 INFO L273 TraceCheckUtils]: 6: Hoare triple {56#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {56#true} is VALID [2018-11-23 12:41:58,104 INFO L273 TraceCheckUtils]: 7: Hoare triple {56#true} assume 0 != ~p1~0;~lk1~0 := 1; {58#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:58,107 INFO L273 TraceCheckUtils]: 8: Hoare triple {58#(= main_~lk1~0 1)} assume 0 != ~p2~0;~lk2~0 := 1; {58#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:58,112 INFO L273 TraceCheckUtils]: 9: Hoare triple {58#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {58#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:58,113 INFO L273 TraceCheckUtils]: 10: Hoare triple {58#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {58#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:58,117 INFO L273 TraceCheckUtils]: 11: Hoare triple {58#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {58#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:58,118 INFO L273 TraceCheckUtils]: 12: Hoare triple {58#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {58#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:58,123 INFO L273 TraceCheckUtils]: 13: Hoare triple {58#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {58#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:58,124 INFO L273 TraceCheckUtils]: 14: Hoare triple {58#(= main_~lk1~0 1)} assume !(0 != ~p8~0); {58#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:58,129 INFO L273 TraceCheckUtils]: 15: Hoare triple {58#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {58#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:58,130 INFO L273 TraceCheckUtils]: 16: Hoare triple {58#(= main_~lk1~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {58#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:58,132 INFO L273 TraceCheckUtils]: 17: Hoare triple {58#(= main_~lk1~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {58#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:58,136 INFO L273 TraceCheckUtils]: 18: Hoare triple {58#(= main_~lk1~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {58#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:58,154 INFO L273 TraceCheckUtils]: 19: Hoare triple {58#(= main_~lk1~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {58#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:58,155 INFO L273 TraceCheckUtils]: 20: Hoare triple {58#(= main_~lk1~0 1)} assume 0 != ~p1~0; {58#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:58,156 INFO L273 TraceCheckUtils]: 21: Hoare triple {58#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {57#false} is VALID [2018-11-23 12:41:58,157 INFO L273 TraceCheckUtils]: 22: Hoare triple {57#false} assume !false; {57#false} is VALID [2018-11-23 12:41:58,162 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 12:41:58,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:58,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:58,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:41:58,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:58,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:58,326 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:58,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:58,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:58,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:58,340 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. [2018-11-23 12:41:59,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:59,397 INFO L93 Difference]: Finished difference Result 105 states and 186 transitions. [2018-11-23 12:41:59,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:59,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:41:59,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:59,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:59,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2018-11-23 12:41:59,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:59,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2018-11-23 12:41:59,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 186 transitions. [2018-11-23 12:41:59,792 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:59,810 INFO L225 Difference]: With dead ends: 105 [2018-11-23 12:41:59,810 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 12:41:59,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:41:59,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 12:41:59,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 62. [2018-11-23 12:41:59,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:59,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 62 states. [2018-11-23 12:41:59,866 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 62 states. [2018-11-23 12:41:59,867 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 62 states. [2018-11-23 12:41:59,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:59,877 INFO L93 Difference]: Finished difference Result 90 states and 164 transitions. [2018-11-23 12:41:59,877 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 164 transitions. [2018-11-23 12:41:59,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:59,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:59,879 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 90 states. [2018-11-23 12:41:59,879 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 90 states. [2018-11-23 12:41:59,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:59,889 INFO L93 Difference]: Finished difference Result 90 states and 164 transitions. [2018-11-23 12:41:59,889 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 164 transitions. [2018-11-23 12:41:59,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:59,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:59,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:59,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:59,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 12:41:59,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 113 transitions. [2018-11-23 12:41:59,898 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 113 transitions. Word has length 23 [2018-11-23 12:41:59,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:59,899 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 113 transitions. [2018-11-23 12:41:59,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:59,899 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 113 transitions. [2018-11-23 12:41:59,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:41:59,900 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:59,900 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:41:59,901 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:59,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:59,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1041912246, now seen corresponding path program 1 times [2018-11-23 12:41:59,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:59,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:59,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:59,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:59,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:00,017 INFO L256 TraceCheckUtils]: 0: Hoare triple {426#true} call ULTIMATE.init(); {426#true} is VALID [2018-11-23 12:42:00,017 INFO L273 TraceCheckUtils]: 1: Hoare triple {426#true} assume true; {426#true} is VALID [2018-11-23 12:42:00,018 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {426#true} {426#true} #248#return; {426#true} is VALID [2018-11-23 12:42:00,018 INFO L256 TraceCheckUtils]: 3: Hoare triple {426#true} call #t~ret14 := main(); {426#true} is VALID [2018-11-23 12:42:00,018 INFO L273 TraceCheckUtils]: 4: Hoare triple {426#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {426#true} is VALID [2018-11-23 12:42:00,019 INFO L273 TraceCheckUtils]: 5: Hoare triple {426#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {426#true} is VALID [2018-11-23 12:42:00,019 INFO L273 TraceCheckUtils]: 6: Hoare triple {426#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {426#true} is VALID [2018-11-23 12:42:00,028 INFO L273 TraceCheckUtils]: 7: Hoare triple {426#true} assume !(0 != ~p1~0); {428#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:00,030 INFO L273 TraceCheckUtils]: 8: Hoare triple {428#(= main_~p1~0 0)} assume 0 != ~p2~0;~lk2~0 := 1; {428#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:00,030 INFO L273 TraceCheckUtils]: 9: Hoare triple {428#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {428#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:00,033 INFO L273 TraceCheckUtils]: 10: Hoare triple {428#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {428#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:00,034 INFO L273 TraceCheckUtils]: 11: Hoare triple {428#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {428#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:00,035 INFO L273 TraceCheckUtils]: 12: Hoare triple {428#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {428#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:00,037 INFO L273 TraceCheckUtils]: 13: Hoare triple {428#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {428#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:00,039 INFO L273 TraceCheckUtils]: 14: Hoare triple {428#(= main_~p1~0 0)} assume !(0 != ~p8~0); {428#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:00,039 INFO L273 TraceCheckUtils]: 15: Hoare triple {428#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {428#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:00,042 INFO L273 TraceCheckUtils]: 16: Hoare triple {428#(= main_~p1~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {428#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:00,042 INFO L273 TraceCheckUtils]: 17: Hoare triple {428#(= main_~p1~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {428#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:00,044 INFO L273 TraceCheckUtils]: 18: Hoare triple {428#(= main_~p1~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {428#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:00,044 INFO L273 TraceCheckUtils]: 19: Hoare triple {428#(= main_~p1~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {428#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:00,046 INFO L273 TraceCheckUtils]: 20: Hoare triple {428#(= main_~p1~0 0)} assume 0 != ~p1~0; {427#false} is VALID [2018-11-23 12:42:00,046 INFO L273 TraceCheckUtils]: 21: Hoare triple {427#false} assume 1 != ~lk1~0; {427#false} is VALID [2018-11-23 12:42:00,046 INFO L273 TraceCheckUtils]: 22: Hoare triple {427#false} assume !false; {427#false} is VALID [2018-11-23 12:42:00,048 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 12:42:00,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:00,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:00,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:42:00,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:00,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:00,099 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:00,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:00,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:00,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:00,100 INFO L87 Difference]: Start difference. First operand 62 states and 113 transitions. Second operand 3 states. [2018-11-23 12:42:00,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:00,466 INFO L93 Difference]: Finished difference Result 147 states and 272 transitions. [2018-11-23 12:42:00,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:00,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:42:00,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:00,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:00,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2018-11-23 12:42:00,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:00,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2018-11-23 12:42:00,479 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 245 transitions. [2018-11-23 12:42:00,829 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 245 edges. 245 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:00,833 INFO L225 Difference]: With dead ends: 147 [2018-11-23 12:42:00,834 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 12:42:00,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:42:00,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 12:42:00,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-11-23 12:42:00,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:00,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 88 states. [2018-11-23 12:42:00,883 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 88 states. [2018-11-23 12:42:00,883 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 88 states. [2018-11-23 12:42:00,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:00,888 INFO L93 Difference]: Finished difference Result 90 states and 162 transitions. [2018-11-23 12:42:00,889 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 162 transitions. [2018-11-23 12:42:00,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:00,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:00,890 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 90 states. [2018-11-23 12:42:00,890 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 90 states. [2018-11-23 12:42:00,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:00,897 INFO L93 Difference]: Finished difference Result 90 states and 162 transitions. [2018-11-23 12:42:00,897 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 162 transitions. [2018-11-23 12:42:00,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:00,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:00,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:00,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:00,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 12:42:00,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 161 transitions. [2018-11-23 12:42:00,904 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 161 transitions. Word has length 23 [2018-11-23 12:42:00,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:00,904 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 161 transitions. [2018-11-23 12:42:00,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:00,905 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 161 transitions. [2018-11-23 12:42:00,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:42:00,906 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:00,906 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:00,906 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:00,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:00,907 INFO L82 PathProgramCache]: Analyzing trace with hash -471898432, now seen corresponding path program 1 times [2018-11-23 12:42:00,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:00,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:00,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:00,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:00,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:01,011 INFO L256 TraceCheckUtils]: 0: Hoare triple {863#true} call ULTIMATE.init(); {863#true} is VALID [2018-11-23 12:42:01,011 INFO L273 TraceCheckUtils]: 1: Hoare triple {863#true} assume true; {863#true} is VALID [2018-11-23 12:42:01,012 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {863#true} {863#true} #248#return; {863#true} is VALID [2018-11-23 12:42:01,012 INFO L256 TraceCheckUtils]: 3: Hoare triple {863#true} call #t~ret14 := main(); {863#true} is VALID [2018-11-23 12:42:01,012 INFO L273 TraceCheckUtils]: 4: Hoare triple {863#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {863#true} is VALID [2018-11-23 12:42:01,013 INFO L273 TraceCheckUtils]: 5: Hoare triple {863#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {863#true} is VALID [2018-11-23 12:42:01,013 INFO L273 TraceCheckUtils]: 6: Hoare triple {863#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {863#true} is VALID [2018-11-23 12:42:01,016 INFO L273 TraceCheckUtils]: 7: Hoare triple {863#true} assume 0 != ~p1~0;~lk1~0 := 1; {865#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:01,017 INFO L273 TraceCheckUtils]: 8: Hoare triple {865#(not (= main_~p1~0 0))} assume 0 != ~p2~0;~lk2~0 := 1; {865#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:01,017 INFO L273 TraceCheckUtils]: 9: Hoare triple {865#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {865#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:01,018 INFO L273 TraceCheckUtils]: 10: Hoare triple {865#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {865#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:01,019 INFO L273 TraceCheckUtils]: 11: Hoare triple {865#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {865#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:01,019 INFO L273 TraceCheckUtils]: 12: Hoare triple {865#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {865#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:01,020 INFO L273 TraceCheckUtils]: 13: Hoare triple {865#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {865#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:01,020 INFO L273 TraceCheckUtils]: 14: Hoare triple {865#(not (= main_~p1~0 0))} assume !(0 != ~p8~0); {865#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:01,021 INFO L273 TraceCheckUtils]: 15: Hoare triple {865#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {865#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:01,024 INFO L273 TraceCheckUtils]: 16: Hoare triple {865#(not (= main_~p1~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {865#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:01,026 INFO L273 TraceCheckUtils]: 17: Hoare triple {865#(not (= main_~p1~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {865#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:01,026 INFO L273 TraceCheckUtils]: 18: Hoare triple {865#(not (= main_~p1~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {865#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:01,028 INFO L273 TraceCheckUtils]: 19: Hoare triple {865#(not (= main_~p1~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {865#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:01,028 INFO L273 TraceCheckUtils]: 20: Hoare triple {865#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {864#false} is VALID [2018-11-23 12:42:01,028 INFO L273 TraceCheckUtils]: 21: Hoare triple {864#false} assume 0 != ~p2~0; {864#false} is VALID [2018-11-23 12:42:01,029 INFO L273 TraceCheckUtils]: 22: Hoare triple {864#false} assume 1 != ~lk2~0; {864#false} is VALID [2018-11-23 12:42:01,029 INFO L273 TraceCheckUtils]: 23: Hoare triple {864#false} assume !false; {864#false} is VALID [2018-11-23 12:42:01,031 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 12:42:01,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:01,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:01,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:42:01,032 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:01,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:01,094 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:01,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:01,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:01,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:01,095 INFO L87 Difference]: Start difference. First operand 88 states and 161 transitions. Second operand 3 states. [2018-11-23 12:42:01,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:01,383 INFO L93 Difference]: Finished difference Result 135 states and 243 transitions. [2018-11-23 12:42:01,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:01,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:42:01,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:01,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:01,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 240 transitions. [2018-11-23 12:42:01,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:01,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 240 transitions. [2018-11-23 12:42:01,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 240 transitions. [2018-11-23 12:42:01,658 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 240 edges. 240 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:01,661 INFO L225 Difference]: With dead ends: 135 [2018-11-23 12:42:01,662 INFO L226 Difference]: Without dead ends: 93 [2018-11-23 12:42:01,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:42:01,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-23 12:42:01,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-11-23 12:42:01,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:01,686 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 91 states. [2018-11-23 12:42:01,686 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 91 states. [2018-11-23 12:42:01,686 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 91 states. [2018-11-23 12:42:01,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:01,691 INFO L93 Difference]: Finished difference Result 93 states and 164 transitions. [2018-11-23 12:42:01,692 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 164 transitions. [2018-11-23 12:42:01,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:01,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:01,693 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 93 states. [2018-11-23 12:42:01,693 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 93 states. [2018-11-23 12:42:01,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:01,698 INFO L93 Difference]: Finished difference Result 93 states and 164 transitions. [2018-11-23 12:42:01,698 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 164 transitions. [2018-11-23 12:42:01,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:01,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:01,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:01,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:01,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-23 12:42:01,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 163 transitions. [2018-11-23 12:42:01,703 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 163 transitions. Word has length 24 [2018-11-23 12:42:01,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:01,704 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 163 transitions. [2018-11-23 12:42:01,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:01,704 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 163 transitions. [2018-11-23 12:42:01,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:42:01,705 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:01,705 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:01,706 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:01,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:01,706 INFO L82 PathProgramCache]: Analyzing trace with hash -2060246334, now seen corresponding path program 1 times [2018-11-23 12:42:01,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:01,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:01,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:01,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:01,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:01,784 INFO L256 TraceCheckUtils]: 0: Hoare triple {1299#true} call ULTIMATE.init(); {1299#true} is VALID [2018-11-23 12:42:01,785 INFO L273 TraceCheckUtils]: 1: Hoare triple {1299#true} assume true; {1299#true} is VALID [2018-11-23 12:42:01,785 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1299#true} {1299#true} #248#return; {1299#true} is VALID [2018-11-23 12:42:01,785 INFO L256 TraceCheckUtils]: 3: Hoare triple {1299#true} call #t~ret14 := main(); {1299#true} is VALID [2018-11-23 12:42:01,786 INFO L273 TraceCheckUtils]: 4: Hoare triple {1299#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {1299#true} is VALID [2018-11-23 12:42:01,786 INFO L273 TraceCheckUtils]: 5: Hoare triple {1299#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {1299#true} is VALID [2018-11-23 12:42:01,786 INFO L273 TraceCheckUtils]: 6: Hoare triple {1299#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {1299#true} is VALID [2018-11-23 12:42:01,786 INFO L273 TraceCheckUtils]: 7: Hoare triple {1299#true} assume !(0 != ~p1~0); {1299#true} is VALID [2018-11-23 12:42:01,787 INFO L273 TraceCheckUtils]: 8: Hoare triple {1299#true} assume 0 != ~p2~0;~lk2~0 := 1; {1301#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:01,788 INFO L273 TraceCheckUtils]: 9: Hoare triple {1301#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {1301#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:01,788 INFO L273 TraceCheckUtils]: 10: Hoare triple {1301#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {1301#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:01,791 INFO L273 TraceCheckUtils]: 11: Hoare triple {1301#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {1301#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:01,791 INFO L273 TraceCheckUtils]: 12: Hoare triple {1301#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {1301#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:01,792 INFO L273 TraceCheckUtils]: 13: Hoare triple {1301#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {1301#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:01,793 INFO L273 TraceCheckUtils]: 14: Hoare triple {1301#(= main_~lk2~0 1)} assume !(0 != ~p8~0); {1301#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:01,795 INFO L273 TraceCheckUtils]: 15: Hoare triple {1301#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {1301#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:01,795 INFO L273 TraceCheckUtils]: 16: Hoare triple {1301#(= main_~lk2~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {1301#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:01,797 INFO L273 TraceCheckUtils]: 17: Hoare triple {1301#(= main_~lk2~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {1301#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:01,797 INFO L273 TraceCheckUtils]: 18: Hoare triple {1301#(= main_~lk2~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {1301#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:01,800 INFO L273 TraceCheckUtils]: 19: Hoare triple {1301#(= main_~lk2~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {1301#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:01,800 INFO L273 TraceCheckUtils]: 20: Hoare triple {1301#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {1301#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:01,803 INFO L273 TraceCheckUtils]: 21: Hoare triple {1301#(= main_~lk2~0 1)} assume 0 != ~p2~0; {1301#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:01,803 INFO L273 TraceCheckUtils]: 22: Hoare triple {1301#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {1300#false} is VALID [2018-11-23 12:42:01,803 INFO L273 TraceCheckUtils]: 23: Hoare triple {1300#false} assume !false; {1300#false} is VALID [2018-11-23 12:42:01,804 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 12:42:01,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:01,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:01,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:42:01,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:01,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:01,839 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:01,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:01,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:01,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:01,840 INFO L87 Difference]: Start difference. First operand 91 states and 163 transitions. Second operand 3 states. [2018-11-23 12:42:02,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:02,026 INFO L93 Difference]: Finished difference Result 172 states and 312 transitions. [2018-11-23 12:42:02,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:02,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:42:02,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:02,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:02,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2018-11-23 12:42:02,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:02,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2018-11-23 12:42:02,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 162 transitions. [2018-11-23 12:42:02,318 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:02,322 INFO L225 Difference]: With dead ends: 172 [2018-11-23 12:42:02,322 INFO L226 Difference]: Without dead ends: 170 [2018-11-23 12:42:02,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:42:02,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-11-23 12:42:02,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 120. [2018-11-23 12:42:02,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:02,364 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand 120 states. [2018-11-23 12:42:02,364 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand 120 states. [2018-11-23 12:42:02,364 INFO L87 Difference]: Start difference. First operand 170 states. Second operand 120 states. [2018-11-23 12:42:02,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:02,374 INFO L93 Difference]: Finished difference Result 170 states and 309 transitions. [2018-11-23 12:42:02,374 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 309 transitions. [2018-11-23 12:42:02,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:02,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:02,376 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 170 states. [2018-11-23 12:42:02,378 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 170 states. [2018-11-23 12:42:02,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:02,388 INFO L93 Difference]: Finished difference Result 170 states and 309 transitions. [2018-11-23 12:42:02,389 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 309 transitions. [2018-11-23 12:42:02,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:02,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:02,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:02,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:02,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-23 12:42:02,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 216 transitions. [2018-11-23 12:42:02,395 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 216 transitions. Word has length 24 [2018-11-23 12:42:02,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:02,396 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 216 transitions. [2018-11-23 12:42:02,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:02,396 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 216 transitions. [2018-11-23 12:42:02,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:42:02,397 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:02,397 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:02,398 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:02,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:02,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1213652608, now seen corresponding path program 1 times [2018-11-23 12:42:02,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:02,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:02,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:02,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:02,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:02,585 INFO L256 TraceCheckUtils]: 0: Hoare triple {1956#true} call ULTIMATE.init(); {1956#true} is VALID [2018-11-23 12:42:02,585 INFO L273 TraceCheckUtils]: 1: Hoare triple {1956#true} assume true; {1956#true} is VALID [2018-11-23 12:42:02,586 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1956#true} {1956#true} #248#return; {1956#true} is VALID [2018-11-23 12:42:02,586 INFO L256 TraceCheckUtils]: 3: Hoare triple {1956#true} call #t~ret14 := main(); {1956#true} is VALID [2018-11-23 12:42:02,587 INFO L273 TraceCheckUtils]: 4: Hoare triple {1956#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {1956#true} is VALID [2018-11-23 12:42:02,587 INFO L273 TraceCheckUtils]: 5: Hoare triple {1956#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {1956#true} is VALID [2018-11-23 12:42:02,587 INFO L273 TraceCheckUtils]: 6: Hoare triple {1956#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {1956#true} is VALID [2018-11-23 12:42:02,588 INFO L273 TraceCheckUtils]: 7: Hoare triple {1956#true} assume !(0 != ~p1~0); {1956#true} is VALID [2018-11-23 12:42:02,590 INFO L273 TraceCheckUtils]: 8: Hoare triple {1956#true} assume !(0 != ~p2~0); {1958#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:02,590 INFO L273 TraceCheckUtils]: 9: Hoare triple {1958#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1958#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:02,591 INFO L273 TraceCheckUtils]: 10: Hoare triple {1958#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1958#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:02,591 INFO L273 TraceCheckUtils]: 11: Hoare triple {1958#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1958#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:02,597 INFO L273 TraceCheckUtils]: 12: Hoare triple {1958#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1958#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:02,598 INFO L273 TraceCheckUtils]: 13: Hoare triple {1958#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1958#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:02,598 INFO L273 TraceCheckUtils]: 14: Hoare triple {1958#(= main_~p2~0 0)} assume !(0 != ~p8~0); {1958#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:02,599 INFO L273 TraceCheckUtils]: 15: Hoare triple {1958#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {1958#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:02,600 INFO L273 TraceCheckUtils]: 16: Hoare triple {1958#(= main_~p2~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {1958#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:02,601 INFO L273 TraceCheckUtils]: 17: Hoare triple {1958#(= main_~p2~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {1958#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:02,601 INFO L273 TraceCheckUtils]: 18: Hoare triple {1958#(= main_~p2~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {1958#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:02,602 INFO L273 TraceCheckUtils]: 19: Hoare triple {1958#(= main_~p2~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {1958#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:02,605 INFO L273 TraceCheckUtils]: 20: Hoare triple {1958#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1958#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:02,606 INFO L273 TraceCheckUtils]: 21: Hoare triple {1958#(= main_~p2~0 0)} assume 0 != ~p2~0; {1957#false} is VALID [2018-11-23 12:42:02,606 INFO L273 TraceCheckUtils]: 22: Hoare triple {1957#false} assume 1 != ~lk2~0; {1957#false} is VALID [2018-11-23 12:42:02,607 INFO L273 TraceCheckUtils]: 23: Hoare triple {1957#false} assume !false; {1957#false} is VALID [2018-11-23 12:42:02,609 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 12:42:02,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:02,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:02,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:42:02,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:02,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:02,656 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:02,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:02,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:02,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:02,657 INFO L87 Difference]: Start difference. First operand 120 states and 216 transitions. Second operand 3 states. [2018-11-23 12:42:02,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:02,937 INFO L93 Difference]: Finished difference Result 284 states and 518 transitions. [2018-11-23 12:42:02,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:02,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:42:02,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:02,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:02,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 242 transitions. [2018-11-23 12:42:02,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:02,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 242 transitions. [2018-11-23 12:42:02,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 242 transitions. [2018-11-23 12:42:03,520 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 242 edges. 242 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:03,524 INFO L225 Difference]: With dead ends: 284 [2018-11-23 12:42:03,524 INFO L226 Difference]: Without dead ends: 172 [2018-11-23 12:42:03,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:42:03,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-23 12:42:03,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2018-11-23 12:42:03,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:03,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand 170 states. [2018-11-23 12:42:03,579 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand 170 states. [2018-11-23 12:42:03,579 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 170 states. [2018-11-23 12:42:03,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:03,586 INFO L93 Difference]: Finished difference Result 172 states and 307 transitions. [2018-11-23 12:42:03,586 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 307 transitions. [2018-11-23 12:42:03,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:03,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:03,587 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand 172 states. [2018-11-23 12:42:03,587 INFO L87 Difference]: Start difference. First operand 170 states. Second operand 172 states. [2018-11-23 12:42:03,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:03,594 INFO L93 Difference]: Finished difference Result 172 states and 307 transitions. [2018-11-23 12:42:03,595 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 307 transitions. [2018-11-23 12:42:03,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:03,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:03,596 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:03,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:03,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-11-23 12:42:03,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 306 transitions. [2018-11-23 12:42:03,602 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 306 transitions. Word has length 24 [2018-11-23 12:42:03,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:03,603 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 306 transitions. [2018-11-23 12:42:03,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:03,603 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 306 transitions. [2018-11-23 12:42:03,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:42:03,604 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:03,604 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:03,604 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:03,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:03,605 INFO L82 PathProgramCache]: Analyzing trace with hash 557085835, now seen corresponding path program 1 times [2018-11-23 12:42:03,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:03,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:03,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:03,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:03,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:03,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:03,721 INFO L256 TraceCheckUtils]: 0: Hoare triple {2783#true} call ULTIMATE.init(); {2783#true} is VALID [2018-11-23 12:42:03,721 INFO L273 TraceCheckUtils]: 1: Hoare triple {2783#true} assume true; {2783#true} is VALID [2018-11-23 12:42:03,721 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2783#true} {2783#true} #248#return; {2783#true} is VALID [2018-11-23 12:42:03,722 INFO L256 TraceCheckUtils]: 3: Hoare triple {2783#true} call #t~ret14 := main(); {2783#true} is VALID [2018-11-23 12:42:03,722 INFO L273 TraceCheckUtils]: 4: Hoare triple {2783#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {2783#true} is VALID [2018-11-23 12:42:03,722 INFO L273 TraceCheckUtils]: 5: Hoare triple {2783#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {2783#true} is VALID [2018-11-23 12:42:03,723 INFO L273 TraceCheckUtils]: 6: Hoare triple {2783#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {2783#true} is VALID [2018-11-23 12:42:03,723 INFO L273 TraceCheckUtils]: 7: Hoare triple {2783#true} assume !(0 != ~p1~0); {2783#true} is VALID [2018-11-23 12:42:03,741 INFO L273 TraceCheckUtils]: 8: Hoare triple {2783#true} assume 0 != ~p2~0;~lk2~0 := 1; {2785#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:03,742 INFO L273 TraceCheckUtils]: 9: Hoare triple {2785#(not (= main_~p2~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {2785#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:03,746 INFO L273 TraceCheckUtils]: 10: Hoare triple {2785#(not (= main_~p2~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {2785#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:03,747 INFO L273 TraceCheckUtils]: 11: Hoare triple {2785#(not (= main_~p2~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {2785#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:03,747 INFO L273 TraceCheckUtils]: 12: Hoare triple {2785#(not (= main_~p2~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {2785#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:03,748 INFO L273 TraceCheckUtils]: 13: Hoare triple {2785#(not (= main_~p2~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {2785#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:03,748 INFO L273 TraceCheckUtils]: 14: Hoare triple {2785#(not (= main_~p2~0 0))} assume !(0 != ~p8~0); {2785#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:03,749 INFO L273 TraceCheckUtils]: 15: Hoare triple {2785#(not (= main_~p2~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {2785#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:03,750 INFO L273 TraceCheckUtils]: 16: Hoare triple {2785#(not (= main_~p2~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {2785#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:03,761 INFO L273 TraceCheckUtils]: 17: Hoare triple {2785#(not (= main_~p2~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {2785#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:03,774 INFO L273 TraceCheckUtils]: 18: Hoare triple {2785#(not (= main_~p2~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {2785#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:03,776 INFO L273 TraceCheckUtils]: 19: Hoare triple {2785#(not (= main_~p2~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {2785#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:03,777 INFO L273 TraceCheckUtils]: 20: Hoare triple {2785#(not (= main_~p2~0 0))} assume !(0 != ~p1~0); {2785#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:03,782 INFO L273 TraceCheckUtils]: 21: Hoare triple {2785#(not (= main_~p2~0 0))} assume !(0 != ~p2~0); {2784#false} is VALID [2018-11-23 12:42:03,782 INFO L273 TraceCheckUtils]: 22: Hoare triple {2784#false} assume 0 != ~p3~0; {2784#false} is VALID [2018-11-23 12:42:03,782 INFO L273 TraceCheckUtils]: 23: Hoare triple {2784#false} assume 1 != ~lk3~0; {2784#false} is VALID [2018-11-23 12:42:03,783 INFO L273 TraceCheckUtils]: 24: Hoare triple {2784#false} assume !false; {2784#false} is VALID [2018-11-23 12:42:03,784 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 12:42:03,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:03,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:03,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:42:03,785 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:03,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:03,818 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:03,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:03,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:03,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:03,819 INFO L87 Difference]: Start difference. First operand 170 states and 306 transitions. Second operand 3 states. [2018-11-23 12:42:04,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:04,111 INFO L93 Difference]: Finished difference Result 255 states and 457 transitions. [2018-11-23 12:42:04,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:04,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:42:04,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:04,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:04,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 237 transitions. [2018-11-23 12:42:04,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:04,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 237 transitions. [2018-11-23 12:42:04,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 237 transitions. [2018-11-23 12:42:04,766 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 237 edges. 237 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:04,770 INFO L225 Difference]: With dead ends: 255 [2018-11-23 12:42:04,770 INFO L226 Difference]: Without dead ends: 174 [2018-11-23 12:42:04,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:42:04,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-23 12:42:04,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2018-11-23 12:42:04,815 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:04,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand 172 states. [2018-11-23 12:42:04,816 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand 172 states. [2018-11-23 12:42:04,816 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 172 states. [2018-11-23 12:42:04,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:04,823 INFO L93 Difference]: Finished difference Result 174 states and 307 transitions. [2018-11-23 12:42:04,823 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 307 transitions. [2018-11-23 12:42:04,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:04,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:04,824 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand 174 states. [2018-11-23 12:42:04,824 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 174 states. [2018-11-23 12:42:04,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:04,831 INFO L93 Difference]: Finished difference Result 174 states and 307 transitions. [2018-11-23 12:42:04,832 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 307 transitions. [2018-11-23 12:42:04,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:04,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:04,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:04,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:04,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-23 12:42:04,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 306 transitions. [2018-11-23 12:42:04,840 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 306 transitions. Word has length 25 [2018-11-23 12:42:04,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:04,840 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 306 transitions. [2018-11-23 12:42:04,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:04,840 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 306 transitions. [2018-11-23 12:42:04,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:42:04,841 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:04,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:04,842 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:04,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:04,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1031262067, now seen corresponding path program 1 times [2018-11-23 12:42:04,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:04,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:04,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:04,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:04,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:04,926 INFO L256 TraceCheckUtils]: 0: Hoare triple {3587#true} call ULTIMATE.init(); {3587#true} is VALID [2018-11-23 12:42:04,926 INFO L273 TraceCheckUtils]: 1: Hoare triple {3587#true} assume true; {3587#true} is VALID [2018-11-23 12:42:04,926 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3587#true} {3587#true} #248#return; {3587#true} is VALID [2018-11-23 12:42:04,927 INFO L256 TraceCheckUtils]: 3: Hoare triple {3587#true} call #t~ret14 := main(); {3587#true} is VALID [2018-11-23 12:42:04,927 INFO L273 TraceCheckUtils]: 4: Hoare triple {3587#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {3587#true} is VALID [2018-11-23 12:42:04,927 INFO L273 TraceCheckUtils]: 5: Hoare triple {3587#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {3587#true} is VALID [2018-11-23 12:42:04,927 INFO L273 TraceCheckUtils]: 6: Hoare triple {3587#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {3587#true} is VALID [2018-11-23 12:42:04,928 INFO L273 TraceCheckUtils]: 7: Hoare triple {3587#true} assume !(0 != ~p1~0); {3587#true} is VALID [2018-11-23 12:42:04,928 INFO L273 TraceCheckUtils]: 8: Hoare triple {3587#true} assume !(0 != ~p2~0); {3587#true} is VALID [2018-11-23 12:42:04,928 INFO L273 TraceCheckUtils]: 9: Hoare triple {3587#true} assume 0 != ~p3~0;~lk3~0 := 1; {3589#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:04,932 INFO L273 TraceCheckUtils]: 10: Hoare triple {3589#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {3589#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:04,932 INFO L273 TraceCheckUtils]: 11: Hoare triple {3589#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {3589#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:04,934 INFO L273 TraceCheckUtils]: 12: Hoare triple {3589#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {3589#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:04,934 INFO L273 TraceCheckUtils]: 13: Hoare triple {3589#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {3589#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:04,936 INFO L273 TraceCheckUtils]: 14: Hoare triple {3589#(= main_~lk3~0 1)} assume !(0 != ~p8~0); {3589#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:04,936 INFO L273 TraceCheckUtils]: 15: Hoare triple {3589#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {3589#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:04,938 INFO L273 TraceCheckUtils]: 16: Hoare triple {3589#(= main_~lk3~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {3589#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:04,938 INFO L273 TraceCheckUtils]: 17: Hoare triple {3589#(= main_~lk3~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {3589#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:04,940 INFO L273 TraceCheckUtils]: 18: Hoare triple {3589#(= main_~lk3~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {3589#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:04,940 INFO L273 TraceCheckUtils]: 19: Hoare triple {3589#(= main_~lk3~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {3589#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:04,942 INFO L273 TraceCheckUtils]: 20: Hoare triple {3589#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {3589#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:04,942 INFO L273 TraceCheckUtils]: 21: Hoare triple {3589#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {3589#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:04,944 INFO L273 TraceCheckUtils]: 22: Hoare triple {3589#(= main_~lk3~0 1)} assume 0 != ~p3~0; {3589#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:04,945 INFO L273 TraceCheckUtils]: 23: Hoare triple {3589#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {3588#false} is VALID [2018-11-23 12:42:04,945 INFO L273 TraceCheckUtils]: 24: Hoare triple {3588#false} assume !false; {3588#false} is VALID [2018-11-23 12:42:04,947 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 12:42:04,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:04,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:04,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:42:04,948 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:04,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:04,980 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:04,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:04,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:04,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:04,981 INFO L87 Difference]: Start difference. First operand 172 states and 306 transitions. Second operand 3 states. [2018-11-23 12:42:05,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:05,353 INFO L93 Difference]: Finished difference Result 324 states and 584 transitions. [2018-11-23 12:42:05,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:05,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:42:05,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:05,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:05,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2018-11-23 12:42:05,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:05,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2018-11-23 12:42:05,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 158 transitions. [2018-11-23 12:42:05,759 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:05,769 INFO L225 Difference]: With dead ends: 324 [2018-11-23 12:42:05,769 INFO L226 Difference]: Without dead ends: 322 [2018-11-23 12:42:05,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:42:05,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-11-23 12:42:05,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 232. [2018-11-23 12:42:05,810 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:05,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 322 states. Second operand 232 states. [2018-11-23 12:42:05,811 INFO L74 IsIncluded]: Start isIncluded. First operand 322 states. Second operand 232 states. [2018-11-23 12:42:05,811 INFO L87 Difference]: Start difference. First operand 322 states. Second operand 232 states. [2018-11-23 12:42:05,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:05,821 INFO L93 Difference]: Finished difference Result 322 states and 579 transitions. [2018-11-23 12:42:05,821 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 579 transitions. [2018-11-23 12:42:05,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:05,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:05,822 INFO L74 IsIncluded]: Start isIncluded. First operand 232 states. Second operand 322 states. [2018-11-23 12:42:05,822 INFO L87 Difference]: Start difference. First operand 232 states. Second operand 322 states. [2018-11-23 12:42:05,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:05,831 INFO L93 Difference]: Finished difference Result 322 states and 579 transitions. [2018-11-23 12:42:05,832 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 579 transitions. [2018-11-23 12:42:05,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:05,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:05,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:05,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:05,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-11-23 12:42:05,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 410 transitions. [2018-11-23 12:42:05,839 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 410 transitions. Word has length 25 [2018-11-23 12:42:05,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:05,840 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 410 transitions. [2018-11-23 12:42:05,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:05,840 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 410 transitions. [2018-11-23 12:42:05,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:42:05,841 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:05,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:05,841 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:05,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:05,842 INFO L82 PathProgramCache]: Analyzing trace with hash -2052330421, now seen corresponding path program 1 times [2018-11-23 12:42:05,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:05,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:05,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:05,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:05,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:06,066 INFO L256 TraceCheckUtils]: 0: Hoare triple {4818#true} call ULTIMATE.init(); {4818#true} is VALID [2018-11-23 12:42:06,066 INFO L273 TraceCheckUtils]: 1: Hoare triple {4818#true} assume true; {4818#true} is VALID [2018-11-23 12:42:06,067 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4818#true} {4818#true} #248#return; {4818#true} is VALID [2018-11-23 12:42:06,067 INFO L256 TraceCheckUtils]: 3: Hoare triple {4818#true} call #t~ret14 := main(); {4818#true} is VALID [2018-11-23 12:42:06,067 INFO L273 TraceCheckUtils]: 4: Hoare triple {4818#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {4818#true} is VALID [2018-11-23 12:42:06,068 INFO L273 TraceCheckUtils]: 5: Hoare triple {4818#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {4818#true} is VALID [2018-11-23 12:42:06,068 INFO L273 TraceCheckUtils]: 6: Hoare triple {4818#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {4818#true} is VALID [2018-11-23 12:42:06,068 INFO L273 TraceCheckUtils]: 7: Hoare triple {4818#true} assume !(0 != ~p1~0); {4818#true} is VALID [2018-11-23 12:42:06,068 INFO L273 TraceCheckUtils]: 8: Hoare triple {4818#true} assume !(0 != ~p2~0); {4818#true} is VALID [2018-11-23 12:42:06,079 INFO L273 TraceCheckUtils]: 9: Hoare triple {4818#true} assume !(0 != ~p3~0); {4820#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:06,091 INFO L273 TraceCheckUtils]: 10: Hoare triple {4820#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {4820#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:06,104 INFO L273 TraceCheckUtils]: 11: Hoare triple {4820#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {4820#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:06,117 INFO L273 TraceCheckUtils]: 12: Hoare triple {4820#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {4820#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:06,130 INFO L273 TraceCheckUtils]: 13: Hoare triple {4820#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {4820#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:06,142 INFO L273 TraceCheckUtils]: 14: Hoare triple {4820#(= main_~p3~0 0)} assume !(0 != ~p8~0); {4820#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:06,155 INFO L273 TraceCheckUtils]: 15: Hoare triple {4820#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {4820#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:06,170 INFO L273 TraceCheckUtils]: 16: Hoare triple {4820#(= main_~p3~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {4820#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:06,179 INFO L273 TraceCheckUtils]: 17: Hoare triple {4820#(= main_~p3~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {4820#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:06,191 INFO L273 TraceCheckUtils]: 18: Hoare triple {4820#(= main_~p3~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {4820#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:06,204 INFO L273 TraceCheckUtils]: 19: Hoare triple {4820#(= main_~p3~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {4820#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:06,218 INFO L273 TraceCheckUtils]: 20: Hoare triple {4820#(= main_~p3~0 0)} assume !(0 != ~p1~0); {4820#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:06,231 INFO L273 TraceCheckUtils]: 21: Hoare triple {4820#(= main_~p3~0 0)} assume !(0 != ~p2~0); {4820#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:06,243 INFO L273 TraceCheckUtils]: 22: Hoare triple {4820#(= main_~p3~0 0)} assume 0 != ~p3~0; {4819#false} is VALID [2018-11-23 12:42:06,244 INFO L273 TraceCheckUtils]: 23: Hoare triple {4819#false} assume 1 != ~lk3~0; {4819#false} is VALID [2018-11-23 12:42:06,244 INFO L273 TraceCheckUtils]: 24: Hoare triple {4819#false} assume !false; {4819#false} is VALID [2018-11-23 12:42:06,245 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 12:42:06,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:06,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:06,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:42:06,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:06,247 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:06,492 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:06,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:06,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:06,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:06,493 INFO L87 Difference]: Start difference. First operand 232 states and 410 transitions. Second operand 3 states. [2018-11-23 12:42:06,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:06,877 INFO L93 Difference]: Finished difference Result 552 states and 984 transitions. [2018-11-23 12:42:06,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:06,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:42:06,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:06,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:06,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 239 transitions. [2018-11-23 12:42:06,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:06,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 239 transitions. [2018-11-23 12:42:06,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 239 transitions. [2018-11-23 12:42:07,528 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 239 edges. 239 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:07,536 INFO L225 Difference]: With dead ends: 552 [2018-11-23 12:42:07,536 INFO L226 Difference]: Without dead ends: 330 [2018-11-23 12:42:07,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:42:07,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-11-23 12:42:07,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2018-11-23 12:42:07,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:07,586 INFO L82 GeneralOperation]: Start isEquivalent. First operand 330 states. Second operand 328 states. [2018-11-23 12:42:07,586 INFO L74 IsIncluded]: Start isIncluded. First operand 330 states. Second operand 328 states. [2018-11-23 12:42:07,587 INFO L87 Difference]: Start difference. First operand 330 states. Second operand 328 states. [2018-11-23 12:42:07,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:07,596 INFO L93 Difference]: Finished difference Result 330 states and 579 transitions. [2018-11-23 12:42:07,596 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 579 transitions. [2018-11-23 12:42:07,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:07,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:07,598 INFO L74 IsIncluded]: Start isIncluded. First operand 328 states. Second operand 330 states. [2018-11-23 12:42:07,598 INFO L87 Difference]: Start difference. First operand 328 states. Second operand 330 states. [2018-11-23 12:42:07,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:07,608 INFO L93 Difference]: Finished difference Result 330 states and 579 transitions. [2018-11-23 12:42:07,608 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 579 transitions. [2018-11-23 12:42:07,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:07,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:07,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:07,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:07,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-11-23 12:42:07,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 578 transitions. [2018-11-23 12:42:07,620 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 578 transitions. Word has length 25 [2018-11-23 12:42:07,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:07,620 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 578 transitions. [2018-11-23 12:42:07,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:07,620 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 578 transitions. [2018-11-23 12:42:07,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:42:07,621 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:07,621 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:07,622 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:07,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:07,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1904139915, now seen corresponding path program 1 times [2018-11-23 12:42:07,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:07,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:07,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:07,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:07,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:07,848 INFO L256 TraceCheckUtils]: 0: Hoare triple {6397#true} call ULTIMATE.init(); {6397#true} is VALID [2018-11-23 12:42:07,848 INFO L273 TraceCheckUtils]: 1: Hoare triple {6397#true} assume true; {6397#true} is VALID [2018-11-23 12:42:07,849 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6397#true} {6397#true} #248#return; {6397#true} is VALID [2018-11-23 12:42:07,849 INFO L256 TraceCheckUtils]: 3: Hoare triple {6397#true} call #t~ret14 := main(); {6397#true} is VALID [2018-11-23 12:42:07,849 INFO L273 TraceCheckUtils]: 4: Hoare triple {6397#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {6397#true} is VALID [2018-11-23 12:42:07,849 INFO L273 TraceCheckUtils]: 5: Hoare triple {6397#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {6397#true} is VALID [2018-11-23 12:42:07,850 INFO L273 TraceCheckUtils]: 6: Hoare triple {6397#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {6397#true} is VALID [2018-11-23 12:42:07,850 INFO L273 TraceCheckUtils]: 7: Hoare triple {6397#true} assume !(0 != ~p1~0); {6397#true} is VALID [2018-11-23 12:42:07,850 INFO L273 TraceCheckUtils]: 8: Hoare triple {6397#true} assume !(0 != ~p2~0); {6397#true} is VALID [2018-11-23 12:42:07,859 INFO L273 TraceCheckUtils]: 9: Hoare triple {6397#true} assume 0 != ~p3~0;~lk3~0 := 1; {6399#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:07,871 INFO L273 TraceCheckUtils]: 10: Hoare triple {6399#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {6399#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:07,888 INFO L273 TraceCheckUtils]: 11: Hoare triple {6399#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {6399#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:07,902 INFO L273 TraceCheckUtils]: 12: Hoare triple {6399#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {6399#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:07,911 INFO L273 TraceCheckUtils]: 13: Hoare triple {6399#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {6399#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:07,924 INFO L273 TraceCheckUtils]: 14: Hoare triple {6399#(not (= main_~p3~0 0))} assume !(0 != ~p8~0); {6399#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:07,936 INFO L273 TraceCheckUtils]: 15: Hoare triple {6399#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {6399#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:07,949 INFO L273 TraceCheckUtils]: 16: Hoare triple {6399#(not (= main_~p3~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {6399#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:07,960 INFO L273 TraceCheckUtils]: 17: Hoare triple {6399#(not (= main_~p3~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {6399#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:07,973 INFO L273 TraceCheckUtils]: 18: Hoare triple {6399#(not (= main_~p3~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {6399#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:07,986 INFO L273 TraceCheckUtils]: 19: Hoare triple {6399#(not (= main_~p3~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {6399#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:08,000 INFO L273 TraceCheckUtils]: 20: Hoare triple {6399#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {6399#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:08,009 INFO L273 TraceCheckUtils]: 21: Hoare triple {6399#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {6399#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:08,022 INFO L273 TraceCheckUtils]: 22: Hoare triple {6399#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {6398#false} is VALID [2018-11-23 12:42:08,022 INFO L273 TraceCheckUtils]: 23: Hoare triple {6398#false} assume 0 != ~p4~0; {6398#false} is VALID [2018-11-23 12:42:08,022 INFO L273 TraceCheckUtils]: 24: Hoare triple {6398#false} assume 1 != ~lk4~0; {6398#false} is VALID [2018-11-23 12:42:08,022 INFO L273 TraceCheckUtils]: 25: Hoare triple {6398#false} assume !false; {6398#false} is VALID [2018-11-23 12:42:08,023 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 12:42:08,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:08,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:08,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:42:08,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:08,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:08,150 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:08,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:08,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:08,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:08,151 INFO L87 Difference]: Start difference. First operand 328 states and 578 transitions. Second operand 3 states. [2018-11-23 12:42:08,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:08,641 INFO L93 Difference]: Finished difference Result 492 states and 864 transitions. [2018-11-23 12:42:08,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:08,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:42:08,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:08,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:08,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 234 transitions. [2018-11-23 12:42:08,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:08,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 234 transitions. [2018-11-23 12:42:08,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 234 transitions. [2018-11-23 12:42:09,514 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:09,522 INFO L225 Difference]: With dead ends: 492 [2018-11-23 12:42:09,523 INFO L226 Difference]: Without dead ends: 334 [2018-11-23 12:42:09,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:42:09,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-11-23 12:42:09,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2018-11-23 12:42:09,718 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:09,718 INFO L82 GeneralOperation]: Start isEquivalent. First operand 334 states. Second operand 332 states. [2018-11-23 12:42:09,718 INFO L74 IsIncluded]: Start isIncluded. First operand 334 states. Second operand 332 states. [2018-11-23 12:42:09,718 INFO L87 Difference]: Start difference. First operand 334 states. Second operand 332 states. [2018-11-23 12:42:09,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:09,727 INFO L93 Difference]: Finished difference Result 334 states and 579 transitions. [2018-11-23 12:42:09,728 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 579 transitions. [2018-11-23 12:42:09,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:09,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:09,729 INFO L74 IsIncluded]: Start isIncluded. First operand 332 states. Second operand 334 states. [2018-11-23 12:42:09,729 INFO L87 Difference]: Start difference. First operand 332 states. Second operand 334 states. [2018-11-23 12:42:09,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:09,740 INFO L93 Difference]: Finished difference Result 334 states and 579 transitions. [2018-11-23 12:42:09,740 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 579 transitions. [2018-11-23 12:42:09,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:09,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:09,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:09,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:09,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-11-23 12:42:09,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 578 transitions. [2018-11-23 12:42:09,752 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 578 transitions. Word has length 26 [2018-11-23 12:42:09,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:09,752 INFO L480 AbstractCegarLoop]: Abstraction has 332 states and 578 transitions. [2018-11-23 12:42:09,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:09,752 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 578 transitions. [2018-11-23 12:42:09,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:42:09,753 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:09,753 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:09,753 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:09,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:09,754 INFO L82 PathProgramCache]: Analyzing trace with hash 802479479, now seen corresponding path program 1 times [2018-11-23 12:42:09,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:09,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:09,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:09,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:09,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:09,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:10,002 INFO L256 TraceCheckUtils]: 0: Hoare triple {7928#true} call ULTIMATE.init(); {7928#true} is VALID [2018-11-23 12:42:10,002 INFO L273 TraceCheckUtils]: 1: Hoare triple {7928#true} assume true; {7928#true} is VALID [2018-11-23 12:42:10,003 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7928#true} {7928#true} #248#return; {7928#true} is VALID [2018-11-23 12:42:10,003 INFO L256 TraceCheckUtils]: 3: Hoare triple {7928#true} call #t~ret14 := main(); {7928#true} is VALID [2018-11-23 12:42:10,003 INFO L273 TraceCheckUtils]: 4: Hoare triple {7928#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {7928#true} is VALID [2018-11-23 12:42:10,004 INFO L273 TraceCheckUtils]: 5: Hoare triple {7928#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {7928#true} is VALID [2018-11-23 12:42:10,004 INFO L273 TraceCheckUtils]: 6: Hoare triple {7928#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {7928#true} is VALID [2018-11-23 12:42:10,004 INFO L273 TraceCheckUtils]: 7: Hoare triple {7928#true} assume !(0 != ~p1~0); {7928#true} is VALID [2018-11-23 12:42:10,004 INFO L273 TraceCheckUtils]: 8: Hoare triple {7928#true} assume !(0 != ~p2~0); {7928#true} is VALID [2018-11-23 12:42:10,005 INFO L273 TraceCheckUtils]: 9: Hoare triple {7928#true} assume !(0 != ~p3~0); {7928#true} is VALID [2018-11-23 12:42:10,017 INFO L273 TraceCheckUtils]: 10: Hoare triple {7928#true} assume 0 != ~p4~0;~lk4~0 := 1; {7930#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:10,030 INFO L273 TraceCheckUtils]: 11: Hoare triple {7930#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {7930#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:10,047 INFO L273 TraceCheckUtils]: 12: Hoare triple {7930#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {7930#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:10,056 INFO L273 TraceCheckUtils]: 13: Hoare triple {7930#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {7930#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:10,071 INFO L273 TraceCheckUtils]: 14: Hoare triple {7930#(= main_~lk4~0 1)} assume !(0 != ~p8~0); {7930#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:10,080 INFO L273 TraceCheckUtils]: 15: Hoare triple {7930#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {7930#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:10,092 INFO L273 TraceCheckUtils]: 16: Hoare triple {7930#(= main_~lk4~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {7930#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:10,112 INFO L273 TraceCheckUtils]: 17: Hoare triple {7930#(= main_~lk4~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {7930#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:10,121 INFO L273 TraceCheckUtils]: 18: Hoare triple {7930#(= main_~lk4~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {7930#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:10,137 INFO L273 TraceCheckUtils]: 19: Hoare triple {7930#(= main_~lk4~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {7930#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:10,146 INFO L273 TraceCheckUtils]: 20: Hoare triple {7930#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {7930#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:10,159 INFO L273 TraceCheckUtils]: 21: Hoare triple {7930#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {7930#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:10,179 INFO L273 TraceCheckUtils]: 22: Hoare triple {7930#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {7930#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:10,188 INFO L273 TraceCheckUtils]: 23: Hoare triple {7930#(= main_~lk4~0 1)} assume 0 != ~p4~0; {7930#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:10,201 INFO L273 TraceCheckUtils]: 24: Hoare triple {7930#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {7929#false} is VALID [2018-11-23 12:42:10,201 INFO L273 TraceCheckUtils]: 25: Hoare triple {7929#false} assume !false; {7929#false} is VALID [2018-11-23 12:42:10,202 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 12:42:10,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:10,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:10,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:42:10,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:10,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:10,304 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:10,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:10,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:10,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:10,305 INFO L87 Difference]: Start difference. First operand 332 states and 578 transitions. Second operand 3 states. [2018-11-23 12:42:11,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:11,115 INFO L93 Difference]: Finished difference Result 620 states and 1096 transitions. [2018-11-23 12:42:11,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:11,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:42:11,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:11,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:11,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2018-11-23 12:42:11,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:11,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2018-11-23 12:42:11,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 154 transitions. [2018-11-23 12:42:11,752 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:11,774 INFO L225 Difference]: With dead ends: 620 [2018-11-23 12:42:11,774 INFO L226 Difference]: Without dead ends: 618 [2018-11-23 12:42:11,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:42:11,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-11-23 12:42:11,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 456. [2018-11-23 12:42:11,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:11,926 INFO L82 GeneralOperation]: Start isEquivalent. First operand 618 states. Second operand 456 states. [2018-11-23 12:42:11,926 INFO L74 IsIncluded]: Start isIncluded. First operand 618 states. Second operand 456 states. [2018-11-23 12:42:11,926 INFO L87 Difference]: Start difference. First operand 618 states. Second operand 456 states. [2018-11-23 12:42:11,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:11,949 INFO L93 Difference]: Finished difference Result 618 states and 1087 transitions. [2018-11-23 12:42:11,950 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 1087 transitions. [2018-11-23 12:42:11,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:11,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:11,951 INFO L74 IsIncluded]: Start isIncluded. First operand 456 states. Second operand 618 states. [2018-11-23 12:42:11,952 INFO L87 Difference]: Start difference. First operand 456 states. Second operand 618 states. [2018-11-23 12:42:11,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:11,974 INFO L93 Difference]: Finished difference Result 618 states and 1087 transitions. [2018-11-23 12:42:11,974 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 1087 transitions. [2018-11-23 12:42:11,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:11,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:11,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:11,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:11,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-11-23 12:42:11,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 782 transitions. [2018-11-23 12:42:11,990 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 782 transitions. Word has length 26 [2018-11-23 12:42:11,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:11,991 INFO L480 AbstractCegarLoop]: Abstraction has 456 states and 782 transitions. [2018-11-23 12:42:11,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:11,991 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 782 transitions. [2018-11-23 12:42:11,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:42:11,992 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:11,992 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:11,993 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:11,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:11,993 INFO L82 PathProgramCache]: Analyzing trace with hash -218588875, now seen corresponding path program 1 times [2018-11-23 12:42:11,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:11,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:11,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:11,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:11,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:12,161 INFO L256 TraceCheckUtils]: 0: Hoare triple {10283#true} call ULTIMATE.init(); {10283#true} is VALID [2018-11-23 12:42:12,161 INFO L273 TraceCheckUtils]: 1: Hoare triple {10283#true} assume true; {10283#true} is VALID [2018-11-23 12:42:12,161 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {10283#true} {10283#true} #248#return; {10283#true} is VALID [2018-11-23 12:42:12,162 INFO L256 TraceCheckUtils]: 3: Hoare triple {10283#true} call #t~ret14 := main(); {10283#true} is VALID [2018-11-23 12:42:12,162 INFO L273 TraceCheckUtils]: 4: Hoare triple {10283#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {10283#true} is VALID [2018-11-23 12:42:12,162 INFO L273 TraceCheckUtils]: 5: Hoare triple {10283#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {10283#true} is VALID [2018-11-23 12:42:12,162 INFO L273 TraceCheckUtils]: 6: Hoare triple {10283#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {10283#true} is VALID [2018-11-23 12:42:12,162 INFO L273 TraceCheckUtils]: 7: Hoare triple {10283#true} assume !(0 != ~p1~0); {10283#true} is VALID [2018-11-23 12:42:12,162 INFO L273 TraceCheckUtils]: 8: Hoare triple {10283#true} assume !(0 != ~p2~0); {10283#true} is VALID [2018-11-23 12:42:12,163 INFO L273 TraceCheckUtils]: 9: Hoare triple {10283#true} assume !(0 != ~p3~0); {10283#true} is VALID [2018-11-23 12:42:12,165 INFO L273 TraceCheckUtils]: 10: Hoare triple {10283#true} assume !(0 != ~p4~0); {10285#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:12,167 INFO L273 TraceCheckUtils]: 11: Hoare triple {10285#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {10285#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:12,167 INFO L273 TraceCheckUtils]: 12: Hoare triple {10285#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {10285#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:12,169 INFO L273 TraceCheckUtils]: 13: Hoare triple {10285#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {10285#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:12,169 INFO L273 TraceCheckUtils]: 14: Hoare triple {10285#(= main_~p4~0 0)} assume !(0 != ~p8~0); {10285#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:12,171 INFO L273 TraceCheckUtils]: 15: Hoare triple {10285#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {10285#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:12,171 INFO L273 TraceCheckUtils]: 16: Hoare triple {10285#(= main_~p4~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {10285#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:12,173 INFO L273 TraceCheckUtils]: 17: Hoare triple {10285#(= main_~p4~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {10285#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:12,173 INFO L273 TraceCheckUtils]: 18: Hoare triple {10285#(= main_~p4~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {10285#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:12,175 INFO L273 TraceCheckUtils]: 19: Hoare triple {10285#(= main_~p4~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {10285#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:12,175 INFO L273 TraceCheckUtils]: 20: Hoare triple {10285#(= main_~p4~0 0)} assume !(0 != ~p1~0); {10285#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:12,175 INFO L273 TraceCheckUtils]: 21: Hoare triple {10285#(= main_~p4~0 0)} assume !(0 != ~p2~0); {10285#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:12,176 INFO L273 TraceCheckUtils]: 22: Hoare triple {10285#(= main_~p4~0 0)} assume !(0 != ~p3~0); {10285#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:12,177 INFO L273 TraceCheckUtils]: 23: Hoare triple {10285#(= main_~p4~0 0)} assume 0 != ~p4~0; {10284#false} is VALID [2018-11-23 12:42:12,177 INFO L273 TraceCheckUtils]: 24: Hoare triple {10284#false} assume 1 != ~lk4~0; {10284#false} is VALID [2018-11-23 12:42:12,177 INFO L273 TraceCheckUtils]: 25: Hoare triple {10284#false} assume !false; {10284#false} is VALID [2018-11-23 12:42:12,178 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 12:42:12,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:12,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:12,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:42:12,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:12,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:12,229 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:12,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:12,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:12,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:12,230 INFO L87 Difference]: Start difference. First operand 456 states and 782 transitions. Second operand 3 states. [2018-11-23 12:42:12,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:12,511 INFO L93 Difference]: Finished difference Result 1084 states and 1872 transitions. [2018-11-23 12:42:12,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:12,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:42:12,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:12,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:12,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 236 transitions. [2018-11-23 12:42:12,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:12,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 236 transitions. [2018-11-23 12:42:12,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 236 transitions. [2018-11-23 12:42:12,719 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 236 edges. 236 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:12,740 INFO L225 Difference]: With dead ends: 1084 [2018-11-23 12:42:12,740 INFO L226 Difference]: Without dead ends: 642 [2018-11-23 12:42:12,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:42:12,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2018-11-23 12:42:13,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 640. [2018-11-23 12:42:13,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:13,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 642 states. Second operand 640 states. [2018-11-23 12:42:13,023 INFO L74 IsIncluded]: Start isIncluded. First operand 642 states. Second operand 640 states. [2018-11-23 12:42:13,024 INFO L87 Difference]: Start difference. First operand 642 states. Second operand 640 states. [2018-11-23 12:42:13,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:13,047 INFO L93 Difference]: Finished difference Result 642 states and 1095 transitions. [2018-11-23 12:42:13,047 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1095 transitions. [2018-11-23 12:42:13,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:13,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:13,049 INFO L74 IsIncluded]: Start isIncluded. First operand 640 states. Second operand 642 states. [2018-11-23 12:42:13,049 INFO L87 Difference]: Start difference. First operand 640 states. Second operand 642 states. [2018-11-23 12:42:13,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:13,073 INFO L93 Difference]: Finished difference Result 642 states and 1095 transitions. [2018-11-23 12:42:13,074 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1095 transitions. [2018-11-23 12:42:13,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:13,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:13,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:13,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:13,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-11-23 12:42:13,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1094 transitions. [2018-11-23 12:42:13,098 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1094 transitions. Word has length 26 [2018-11-23 12:42:13,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:13,099 INFO L480 AbstractCegarLoop]: Abstraction has 640 states and 1094 transitions. [2018-11-23 12:42:13,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:13,099 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1094 transitions. [2018-11-23 12:42:13,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:42:13,100 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:13,100 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:13,100 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:13,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:13,101 INFO L82 PathProgramCache]: Analyzing trace with hash -892726496, now seen corresponding path program 1 times [2018-11-23 12:42:13,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:13,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:13,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:13,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:13,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:13,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:13,211 INFO L256 TraceCheckUtils]: 0: Hoare triple {13350#true} call ULTIMATE.init(); {13350#true} is VALID [2018-11-23 12:42:13,211 INFO L273 TraceCheckUtils]: 1: Hoare triple {13350#true} assume true; {13350#true} is VALID [2018-11-23 12:42:13,211 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {13350#true} {13350#true} #248#return; {13350#true} is VALID [2018-11-23 12:42:13,212 INFO L256 TraceCheckUtils]: 3: Hoare triple {13350#true} call #t~ret14 := main(); {13350#true} is VALID [2018-11-23 12:42:13,212 INFO L273 TraceCheckUtils]: 4: Hoare triple {13350#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {13350#true} is VALID [2018-11-23 12:42:13,212 INFO L273 TraceCheckUtils]: 5: Hoare triple {13350#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {13350#true} is VALID [2018-11-23 12:42:13,212 INFO L273 TraceCheckUtils]: 6: Hoare triple {13350#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {13350#true} is VALID [2018-11-23 12:42:13,212 INFO L273 TraceCheckUtils]: 7: Hoare triple {13350#true} assume !(0 != ~p1~0); {13350#true} is VALID [2018-11-23 12:42:13,212 INFO L273 TraceCheckUtils]: 8: Hoare triple {13350#true} assume !(0 != ~p2~0); {13350#true} is VALID [2018-11-23 12:42:13,213 INFO L273 TraceCheckUtils]: 9: Hoare triple {13350#true} assume !(0 != ~p3~0); {13350#true} is VALID [2018-11-23 12:42:13,213 INFO L273 TraceCheckUtils]: 10: Hoare triple {13350#true} assume 0 != ~p4~0;~lk4~0 := 1; {13352#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:13,213 INFO L273 TraceCheckUtils]: 11: Hoare triple {13352#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {13352#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:13,214 INFO L273 TraceCheckUtils]: 12: Hoare triple {13352#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {13352#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:13,214 INFO L273 TraceCheckUtils]: 13: Hoare triple {13352#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {13352#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:13,214 INFO L273 TraceCheckUtils]: 14: Hoare triple {13352#(not (= main_~p4~0 0))} assume !(0 != ~p8~0); {13352#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:13,215 INFO L273 TraceCheckUtils]: 15: Hoare triple {13352#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {13352#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:13,215 INFO L273 TraceCheckUtils]: 16: Hoare triple {13352#(not (= main_~p4~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {13352#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:13,215 INFO L273 TraceCheckUtils]: 17: Hoare triple {13352#(not (= main_~p4~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {13352#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:13,216 INFO L273 TraceCheckUtils]: 18: Hoare triple {13352#(not (= main_~p4~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {13352#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:13,216 INFO L273 TraceCheckUtils]: 19: Hoare triple {13352#(not (= main_~p4~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {13352#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:13,217 INFO L273 TraceCheckUtils]: 20: Hoare triple {13352#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {13352#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:13,220 INFO L273 TraceCheckUtils]: 21: Hoare triple {13352#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {13352#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:13,220 INFO L273 TraceCheckUtils]: 22: Hoare triple {13352#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {13352#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:13,221 INFO L273 TraceCheckUtils]: 23: Hoare triple {13352#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {13351#false} is VALID [2018-11-23 12:42:13,221 INFO L273 TraceCheckUtils]: 24: Hoare triple {13351#false} assume 0 != ~p5~0; {13351#false} is VALID [2018-11-23 12:42:13,221 INFO L273 TraceCheckUtils]: 25: Hoare triple {13351#false} assume 1 != ~lk5~0; {13351#false} is VALID [2018-11-23 12:42:13,221 INFO L273 TraceCheckUtils]: 26: Hoare triple {13351#false} assume !false; {13351#false} is VALID [2018-11-23 12:42:13,222 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 12:42:13,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:13,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:13,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:42:13,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:13,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:13,247 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:13,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:13,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:13,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:13,248 INFO L87 Difference]: Start difference. First operand 640 states and 1094 transitions. Second operand 3 states. [2018-11-23 12:42:13,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:13,613 INFO L93 Difference]: Finished difference Result 960 states and 1636 transitions. [2018-11-23 12:42:13,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:13,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:42:13,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:13,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:13,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 231 transitions. [2018-11-23 12:42:13,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:13,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 231 transitions. [2018-11-23 12:42:13,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 231 transitions. [2018-11-23 12:42:13,878 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 231 edges. 231 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:13,903 INFO L225 Difference]: With dead ends: 960 [2018-11-23 12:42:13,903 INFO L226 Difference]: Without dead ends: 650 [2018-11-23 12:42:13,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:42:13,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-11-23 12:42:14,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 648. [2018-11-23 12:42:14,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:14,060 INFO L82 GeneralOperation]: Start isEquivalent. First operand 650 states. Second operand 648 states. [2018-11-23 12:42:14,061 INFO L74 IsIncluded]: Start isIncluded. First operand 650 states. Second operand 648 states. [2018-11-23 12:42:14,061 INFO L87 Difference]: Start difference. First operand 650 states. Second operand 648 states. [2018-11-23 12:42:14,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:14,080 INFO L93 Difference]: Finished difference Result 650 states and 1095 transitions. [2018-11-23 12:42:14,080 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1095 transitions. [2018-11-23 12:42:14,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:14,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:14,081 INFO L74 IsIncluded]: Start isIncluded. First operand 648 states. Second operand 650 states. [2018-11-23 12:42:14,082 INFO L87 Difference]: Start difference. First operand 648 states. Second operand 650 states. [2018-11-23 12:42:14,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:14,104 INFO L93 Difference]: Finished difference Result 650 states and 1095 transitions. [2018-11-23 12:42:14,104 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1095 transitions. [2018-11-23 12:42:14,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:14,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:14,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:14,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:14,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2018-11-23 12:42:14,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1094 transitions. [2018-11-23 12:42:14,129 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1094 transitions. Word has length 27 [2018-11-23 12:42:14,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:14,129 INFO L480 AbstractCegarLoop]: Abstraction has 648 states and 1094 transitions. [2018-11-23 12:42:14,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:14,129 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1094 transitions. [2018-11-23 12:42:14,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:42:14,130 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:14,130 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:14,130 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:14,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:14,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1813892898, now seen corresponding path program 1 times [2018-11-23 12:42:14,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:14,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:14,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:14,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:14,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:14,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:14,223 INFO L256 TraceCheckUtils]: 0: Hoare triple {16317#true} call ULTIMATE.init(); {16317#true} is VALID [2018-11-23 12:42:14,223 INFO L273 TraceCheckUtils]: 1: Hoare triple {16317#true} assume true; {16317#true} is VALID [2018-11-23 12:42:14,223 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {16317#true} {16317#true} #248#return; {16317#true} is VALID [2018-11-23 12:42:14,223 INFO L256 TraceCheckUtils]: 3: Hoare triple {16317#true} call #t~ret14 := main(); {16317#true} is VALID [2018-11-23 12:42:14,224 INFO L273 TraceCheckUtils]: 4: Hoare triple {16317#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {16317#true} is VALID [2018-11-23 12:42:14,224 INFO L273 TraceCheckUtils]: 5: Hoare triple {16317#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {16317#true} is VALID [2018-11-23 12:42:14,224 INFO L273 TraceCheckUtils]: 6: Hoare triple {16317#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {16317#true} is VALID [2018-11-23 12:42:14,224 INFO L273 TraceCheckUtils]: 7: Hoare triple {16317#true} assume !(0 != ~p1~0); {16317#true} is VALID [2018-11-23 12:42:14,224 INFO L273 TraceCheckUtils]: 8: Hoare triple {16317#true} assume !(0 != ~p2~0); {16317#true} is VALID [2018-11-23 12:42:14,224 INFO L273 TraceCheckUtils]: 9: Hoare triple {16317#true} assume !(0 != ~p3~0); {16317#true} is VALID [2018-11-23 12:42:14,225 INFO L273 TraceCheckUtils]: 10: Hoare triple {16317#true} assume !(0 != ~p4~0); {16317#true} is VALID [2018-11-23 12:42:14,226 INFO L273 TraceCheckUtils]: 11: Hoare triple {16317#true} assume 0 != ~p5~0;~lk5~0 := 1; {16319#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:14,227 INFO L273 TraceCheckUtils]: 12: Hoare triple {16319#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {16319#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:14,227 INFO L273 TraceCheckUtils]: 13: Hoare triple {16319#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {16319#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:14,229 INFO L273 TraceCheckUtils]: 14: Hoare triple {16319#(= main_~lk5~0 1)} assume !(0 != ~p8~0); {16319#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:14,229 INFO L273 TraceCheckUtils]: 15: Hoare triple {16319#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {16319#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:14,232 INFO L273 TraceCheckUtils]: 16: Hoare triple {16319#(= main_~lk5~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {16319#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:14,232 INFO L273 TraceCheckUtils]: 17: Hoare triple {16319#(= main_~lk5~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {16319#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:14,235 INFO L273 TraceCheckUtils]: 18: Hoare triple {16319#(= main_~lk5~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {16319#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:14,235 INFO L273 TraceCheckUtils]: 19: Hoare triple {16319#(= main_~lk5~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {16319#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:14,237 INFO L273 TraceCheckUtils]: 20: Hoare triple {16319#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {16319#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:14,237 INFO L273 TraceCheckUtils]: 21: Hoare triple {16319#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {16319#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:14,237 INFO L273 TraceCheckUtils]: 22: Hoare triple {16319#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {16319#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:14,238 INFO L273 TraceCheckUtils]: 23: Hoare triple {16319#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {16319#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:14,238 INFO L273 TraceCheckUtils]: 24: Hoare triple {16319#(= main_~lk5~0 1)} assume 0 != ~p5~0; {16319#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:14,238 INFO L273 TraceCheckUtils]: 25: Hoare triple {16319#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {16318#false} is VALID [2018-11-23 12:42:14,239 INFO L273 TraceCheckUtils]: 26: Hoare triple {16318#false} assume !false; {16318#false} is VALID [2018-11-23 12:42:14,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:42:14,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:14,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:14,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:42:14,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:14,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:14,263 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:14,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:14,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:14,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:14,264 INFO L87 Difference]: Start difference. First operand 648 states and 1094 transitions. Second operand 3 states. [2018-11-23 12:42:14,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:14,688 INFO L93 Difference]: Finished difference Result 1196 states and 2056 transitions. [2018-11-23 12:42:14,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:14,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:42:14,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:14,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:14,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2018-11-23 12:42:14,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:14,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2018-11-23 12:42:14,692 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 150 transitions. [2018-11-23 12:42:14,844 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:14,897 INFO L225 Difference]: With dead ends: 1196 [2018-11-23 12:42:14,897 INFO L226 Difference]: Without dead ends: 1194 [2018-11-23 12:42:14,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:42:14,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2018-11-23 12:42:15,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 904. [2018-11-23 12:42:15,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:15,316 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1194 states. Second operand 904 states. [2018-11-23 12:42:15,316 INFO L74 IsIncluded]: Start isIncluded. First operand 1194 states. Second operand 904 states. [2018-11-23 12:42:15,316 INFO L87 Difference]: Start difference. First operand 1194 states. Second operand 904 states. [2018-11-23 12:42:15,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:15,365 INFO L93 Difference]: Finished difference Result 1194 states and 2039 transitions. [2018-11-23 12:42:15,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 2039 transitions. [2018-11-23 12:42:15,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:15,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:15,367 INFO L74 IsIncluded]: Start isIncluded. First operand 904 states. Second operand 1194 states. [2018-11-23 12:42:15,367 INFO L87 Difference]: Start difference. First operand 904 states. Second operand 1194 states. [2018-11-23 12:42:15,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:15,420 INFO L93 Difference]: Finished difference Result 1194 states and 2039 transitions. [2018-11-23 12:42:15,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 2039 transitions. [2018-11-23 12:42:15,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:15,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:15,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:15,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:15,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-11-23 12:42:15,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1494 transitions. [2018-11-23 12:42:15,453 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1494 transitions. Word has length 27 [2018-11-23 12:42:15,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:15,453 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 1494 transitions. [2018-11-23 12:42:15,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:15,453 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1494 transitions. [2018-11-23 12:42:15,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:42:15,454 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:15,454 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:15,454 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:15,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:15,455 INFO L82 PathProgramCache]: Analyzing trace with hash 792824544, now seen corresponding path program 1 times [2018-11-23 12:42:15,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:15,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:15,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:15,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:15,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:15,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:15,557 INFO L256 TraceCheckUtils]: 0: Hoare triple {20872#true} call ULTIMATE.init(); {20872#true} is VALID [2018-11-23 12:42:15,557 INFO L273 TraceCheckUtils]: 1: Hoare triple {20872#true} assume true; {20872#true} is VALID [2018-11-23 12:42:15,558 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {20872#true} {20872#true} #248#return; {20872#true} is VALID [2018-11-23 12:42:15,558 INFO L256 TraceCheckUtils]: 3: Hoare triple {20872#true} call #t~ret14 := main(); {20872#true} is VALID [2018-11-23 12:42:15,558 INFO L273 TraceCheckUtils]: 4: Hoare triple {20872#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {20872#true} is VALID [2018-11-23 12:42:15,559 INFO L273 TraceCheckUtils]: 5: Hoare triple {20872#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {20872#true} is VALID [2018-11-23 12:42:15,559 INFO L273 TraceCheckUtils]: 6: Hoare triple {20872#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {20872#true} is VALID [2018-11-23 12:42:15,559 INFO L273 TraceCheckUtils]: 7: Hoare triple {20872#true} assume !(0 != ~p1~0); {20872#true} is VALID [2018-11-23 12:42:15,559 INFO L273 TraceCheckUtils]: 8: Hoare triple {20872#true} assume !(0 != ~p2~0); {20872#true} is VALID [2018-11-23 12:42:15,559 INFO L273 TraceCheckUtils]: 9: Hoare triple {20872#true} assume !(0 != ~p3~0); {20872#true} is VALID [2018-11-23 12:42:15,559 INFO L273 TraceCheckUtils]: 10: Hoare triple {20872#true} assume !(0 != ~p4~0); {20872#true} is VALID [2018-11-23 12:42:15,561 INFO L273 TraceCheckUtils]: 11: Hoare triple {20872#true} assume !(0 != ~p5~0); {20874#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:15,561 INFO L273 TraceCheckUtils]: 12: Hoare triple {20874#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {20874#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:15,563 INFO L273 TraceCheckUtils]: 13: Hoare triple {20874#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {20874#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:15,566 INFO L273 TraceCheckUtils]: 14: Hoare triple {20874#(= main_~p5~0 0)} assume !(0 != ~p8~0); {20874#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:15,566 INFO L273 TraceCheckUtils]: 15: Hoare triple {20874#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {20874#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:15,568 INFO L273 TraceCheckUtils]: 16: Hoare triple {20874#(= main_~p5~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {20874#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:15,568 INFO L273 TraceCheckUtils]: 17: Hoare triple {20874#(= main_~p5~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {20874#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:15,569 INFO L273 TraceCheckUtils]: 18: Hoare triple {20874#(= main_~p5~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {20874#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:15,569 INFO L273 TraceCheckUtils]: 19: Hoare triple {20874#(= main_~p5~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {20874#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:15,569 INFO L273 TraceCheckUtils]: 20: Hoare triple {20874#(= main_~p5~0 0)} assume !(0 != ~p1~0); {20874#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:15,570 INFO L273 TraceCheckUtils]: 21: Hoare triple {20874#(= main_~p5~0 0)} assume !(0 != ~p2~0); {20874#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:15,570 INFO L273 TraceCheckUtils]: 22: Hoare triple {20874#(= main_~p5~0 0)} assume !(0 != ~p3~0); {20874#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:15,571 INFO L273 TraceCheckUtils]: 23: Hoare triple {20874#(= main_~p5~0 0)} assume !(0 != ~p4~0); {20874#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:15,580 INFO L273 TraceCheckUtils]: 24: Hoare triple {20874#(= main_~p5~0 0)} assume 0 != ~p5~0; {20873#false} is VALID [2018-11-23 12:42:15,580 INFO L273 TraceCheckUtils]: 25: Hoare triple {20873#false} assume 1 != ~lk5~0; {20873#false} is VALID [2018-11-23 12:42:15,580 INFO L273 TraceCheckUtils]: 26: Hoare triple {20873#false} assume !false; {20873#false} is VALID [2018-11-23 12:42:15,581 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 12:42:15,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:15,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:15,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:42:15,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:15,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:15,609 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:15,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:15,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:15,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:15,610 INFO L87 Difference]: Start difference. First operand 904 states and 1494 transitions. Second operand 3 states. [2018-11-23 12:42:16,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:16,253 INFO L93 Difference]: Finished difference Result 2140 states and 3560 transitions. [2018-11-23 12:42:16,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:16,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:42:16,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:16,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:16,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 233 transitions. [2018-11-23 12:42:16,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:16,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 233 transitions. [2018-11-23 12:42:16,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 233 transitions. [2018-11-23 12:42:16,468 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 233 edges. 233 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:16,529 INFO L225 Difference]: With dead ends: 2140 [2018-11-23 12:42:16,530 INFO L226 Difference]: Without dead ends: 1258 [2018-11-23 12:42:16,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:42:16,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2018-11-23 12:42:17,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1256. [2018-11-23 12:42:17,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:17,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1258 states. Second operand 1256 states. [2018-11-23 12:42:17,653 INFO L74 IsIncluded]: Start isIncluded. First operand 1258 states. Second operand 1256 states. [2018-11-23 12:42:17,653 INFO L87 Difference]: Start difference. First operand 1258 states. Second operand 1256 states. [2018-11-23 12:42:17,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:17,710 INFO L93 Difference]: Finished difference Result 1258 states and 2071 transitions. [2018-11-23 12:42:17,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 2071 transitions. [2018-11-23 12:42:17,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:17,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:17,712 INFO L74 IsIncluded]: Start isIncluded. First operand 1256 states. Second operand 1258 states. [2018-11-23 12:42:17,712 INFO L87 Difference]: Start difference. First operand 1256 states. Second operand 1258 states. [2018-11-23 12:42:17,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:17,774 INFO L93 Difference]: Finished difference Result 1258 states and 2071 transitions. [2018-11-23 12:42:17,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 2071 transitions. [2018-11-23 12:42:17,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:17,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:17,776 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:17,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:17,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2018-11-23 12:42:17,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 2070 transitions. [2018-11-23 12:42:17,830 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 2070 transitions. Word has length 27 [2018-11-23 12:42:17,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:17,830 INFO L480 AbstractCegarLoop]: Abstraction has 1256 states and 2070 transitions. [2018-11-23 12:42:17,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:17,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 2070 transitions. [2018-11-23 12:42:17,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:42:17,832 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:17,832 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:17,832 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:17,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:17,832 INFO L82 PathProgramCache]: Analyzing trace with hash 396318762, now seen corresponding path program 1 times [2018-11-23 12:42:17,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:17,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:17,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:17,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:17,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:17,935 INFO L256 TraceCheckUtils]: 0: Hoare triple {26883#true} call ULTIMATE.init(); {26883#true} is VALID [2018-11-23 12:42:17,935 INFO L273 TraceCheckUtils]: 1: Hoare triple {26883#true} assume true; {26883#true} is VALID [2018-11-23 12:42:17,935 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {26883#true} {26883#true} #248#return; {26883#true} is VALID [2018-11-23 12:42:17,936 INFO L256 TraceCheckUtils]: 3: Hoare triple {26883#true} call #t~ret14 := main(); {26883#true} is VALID [2018-11-23 12:42:17,936 INFO L273 TraceCheckUtils]: 4: Hoare triple {26883#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {26883#true} is VALID [2018-11-23 12:42:17,936 INFO L273 TraceCheckUtils]: 5: Hoare triple {26883#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {26883#true} is VALID [2018-11-23 12:42:17,936 INFO L273 TraceCheckUtils]: 6: Hoare triple {26883#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {26883#true} is VALID [2018-11-23 12:42:17,936 INFO L273 TraceCheckUtils]: 7: Hoare triple {26883#true} assume !(0 != ~p1~0); {26883#true} is VALID [2018-11-23 12:42:17,936 INFO L273 TraceCheckUtils]: 8: Hoare triple {26883#true} assume !(0 != ~p2~0); {26883#true} is VALID [2018-11-23 12:42:17,936 INFO L273 TraceCheckUtils]: 9: Hoare triple {26883#true} assume !(0 != ~p3~0); {26883#true} is VALID [2018-11-23 12:42:17,937 INFO L273 TraceCheckUtils]: 10: Hoare triple {26883#true} assume !(0 != ~p4~0); {26883#true} is VALID [2018-11-23 12:42:17,937 INFO L273 TraceCheckUtils]: 11: Hoare triple {26883#true} assume 0 != ~p5~0;~lk5~0 := 1; {26885#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:17,942 INFO L273 TraceCheckUtils]: 12: Hoare triple {26885#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {26885#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:17,943 INFO L273 TraceCheckUtils]: 13: Hoare triple {26885#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {26885#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:17,943 INFO L273 TraceCheckUtils]: 14: Hoare triple {26885#(not (= main_~p5~0 0))} assume !(0 != ~p8~0); {26885#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:17,943 INFO L273 TraceCheckUtils]: 15: Hoare triple {26885#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {26885#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:17,944 INFO L273 TraceCheckUtils]: 16: Hoare triple {26885#(not (= main_~p5~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {26885#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:17,944 INFO L273 TraceCheckUtils]: 17: Hoare triple {26885#(not (= main_~p5~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {26885#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:17,944 INFO L273 TraceCheckUtils]: 18: Hoare triple {26885#(not (= main_~p5~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {26885#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:17,945 INFO L273 TraceCheckUtils]: 19: Hoare triple {26885#(not (= main_~p5~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {26885#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:17,945 INFO L273 TraceCheckUtils]: 20: Hoare triple {26885#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {26885#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:17,945 INFO L273 TraceCheckUtils]: 21: Hoare triple {26885#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {26885#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:17,951 INFO L273 TraceCheckUtils]: 22: Hoare triple {26885#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {26885#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:17,951 INFO L273 TraceCheckUtils]: 23: Hoare triple {26885#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {26885#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:17,952 INFO L273 TraceCheckUtils]: 24: Hoare triple {26885#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {26884#false} is VALID [2018-11-23 12:42:17,952 INFO L273 TraceCheckUtils]: 25: Hoare triple {26884#false} assume 0 != ~p6~0; {26884#false} is VALID [2018-11-23 12:42:17,952 INFO L273 TraceCheckUtils]: 26: Hoare triple {26884#false} assume 1 != ~lk6~0; {26884#false} is VALID [2018-11-23 12:42:17,952 INFO L273 TraceCheckUtils]: 27: Hoare triple {26884#false} assume !false; {26884#false} is VALID [2018-11-23 12:42:17,953 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 12:42:17,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:17,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:17,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 12:42:17,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:17,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:18,005 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:18,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:18,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:18,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:18,006 INFO L87 Difference]: Start difference. First operand 1256 states and 2070 transitions. Second operand 3 states. [2018-11-23 12:42:18,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:18,442 INFO L93 Difference]: Finished difference Result 1884 states and 3096 transitions. [2018-11-23 12:42:18,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:18,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 12:42:18,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:18,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:18,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 228 transitions. [2018-11-23 12:42:18,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:18,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 228 transitions. [2018-11-23 12:42:18,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 228 transitions. [2018-11-23 12:42:18,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:18,743 INFO L225 Difference]: With dead ends: 1884 [2018-11-23 12:42:18,743 INFO L226 Difference]: Without dead ends: 1274 [2018-11-23 12:42:18,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:42:18,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2018-11-23 12:42:19,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1272. [2018-11-23 12:42:19,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:19,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1274 states. Second operand 1272 states. [2018-11-23 12:42:19,404 INFO L74 IsIncluded]: Start isIncluded. First operand 1274 states. Second operand 1272 states. [2018-11-23 12:42:19,404 INFO L87 Difference]: Start difference. First operand 1274 states. Second operand 1272 states. [2018-11-23 12:42:19,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:19,459 INFO L93 Difference]: Finished difference Result 1274 states and 2071 transitions. [2018-11-23 12:42:19,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 2071 transitions. [2018-11-23 12:42:19,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:19,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:19,460 INFO L74 IsIncluded]: Start isIncluded. First operand 1272 states. Second operand 1274 states. [2018-11-23 12:42:19,460 INFO L87 Difference]: Start difference. First operand 1272 states. Second operand 1274 states. [2018-11-23 12:42:19,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:19,520 INFO L93 Difference]: Finished difference Result 1274 states and 2071 transitions. [2018-11-23 12:42:19,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 2071 transitions. [2018-11-23 12:42:19,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:19,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:19,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:19,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:19,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2018-11-23 12:42:19,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 2070 transitions. [2018-11-23 12:42:19,572 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 2070 transitions. Word has length 28 [2018-11-23 12:42:19,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:19,572 INFO L480 AbstractCegarLoop]: Abstraction has 1272 states and 2070 transitions. [2018-11-23 12:42:19,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:19,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 2070 transitions. [2018-11-23 12:42:19,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:42:19,574 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:19,574 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:19,574 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:19,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:19,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1192029140, now seen corresponding path program 1 times [2018-11-23 12:42:19,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:19,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:19,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:19,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:19,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:19,651 INFO L256 TraceCheckUtils]: 0: Hoare triple {32686#true} call ULTIMATE.init(); {32686#true} is VALID [2018-11-23 12:42:19,651 INFO L273 TraceCheckUtils]: 1: Hoare triple {32686#true} assume true; {32686#true} is VALID [2018-11-23 12:42:19,651 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {32686#true} {32686#true} #248#return; {32686#true} is VALID [2018-11-23 12:42:19,652 INFO L256 TraceCheckUtils]: 3: Hoare triple {32686#true} call #t~ret14 := main(); {32686#true} is VALID [2018-11-23 12:42:19,652 INFO L273 TraceCheckUtils]: 4: Hoare triple {32686#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {32686#true} is VALID [2018-11-23 12:42:19,652 INFO L273 TraceCheckUtils]: 5: Hoare triple {32686#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {32686#true} is VALID [2018-11-23 12:42:19,652 INFO L273 TraceCheckUtils]: 6: Hoare triple {32686#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {32686#true} is VALID [2018-11-23 12:42:19,653 INFO L273 TraceCheckUtils]: 7: Hoare triple {32686#true} assume !(0 != ~p1~0); {32686#true} is VALID [2018-11-23 12:42:19,653 INFO L273 TraceCheckUtils]: 8: Hoare triple {32686#true} assume !(0 != ~p2~0); {32686#true} is VALID [2018-11-23 12:42:19,653 INFO L273 TraceCheckUtils]: 9: Hoare triple {32686#true} assume !(0 != ~p3~0); {32686#true} is VALID [2018-11-23 12:42:19,653 INFO L273 TraceCheckUtils]: 10: Hoare triple {32686#true} assume !(0 != ~p4~0); {32686#true} is VALID [2018-11-23 12:42:19,653 INFO L273 TraceCheckUtils]: 11: Hoare triple {32686#true} assume !(0 != ~p5~0); {32686#true} is VALID [2018-11-23 12:42:19,659 INFO L273 TraceCheckUtils]: 12: Hoare triple {32686#true} assume 0 != ~p6~0;~lk6~0 := 1; {32688#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:19,660 INFO L273 TraceCheckUtils]: 13: Hoare triple {32688#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {32688#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:19,660 INFO L273 TraceCheckUtils]: 14: Hoare triple {32688#(= main_~lk6~0 1)} assume !(0 != ~p8~0); {32688#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:19,660 INFO L273 TraceCheckUtils]: 15: Hoare triple {32688#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {32688#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:19,661 INFO L273 TraceCheckUtils]: 16: Hoare triple {32688#(= main_~lk6~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {32688#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:19,661 INFO L273 TraceCheckUtils]: 17: Hoare triple {32688#(= main_~lk6~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {32688#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:19,661 INFO L273 TraceCheckUtils]: 18: Hoare triple {32688#(= main_~lk6~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {32688#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:19,662 INFO L273 TraceCheckUtils]: 19: Hoare triple {32688#(= main_~lk6~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {32688#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:19,662 INFO L273 TraceCheckUtils]: 20: Hoare triple {32688#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {32688#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:19,662 INFO L273 TraceCheckUtils]: 21: Hoare triple {32688#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {32688#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:19,663 INFO L273 TraceCheckUtils]: 22: Hoare triple {32688#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {32688#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:19,663 INFO L273 TraceCheckUtils]: 23: Hoare triple {32688#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {32688#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:19,664 INFO L273 TraceCheckUtils]: 24: Hoare triple {32688#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {32688#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:19,664 INFO L273 TraceCheckUtils]: 25: Hoare triple {32688#(= main_~lk6~0 1)} assume 0 != ~p6~0; {32688#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:19,665 INFO L273 TraceCheckUtils]: 26: Hoare triple {32688#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {32687#false} is VALID [2018-11-23 12:42:19,665 INFO L273 TraceCheckUtils]: 27: Hoare triple {32687#false} assume !false; {32687#false} is VALID [2018-11-23 12:42:19,666 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 12:42:19,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:19,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:19,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 12:42:19,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:19,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:19,697 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:19,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:19,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:19,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:19,697 INFO L87 Difference]: Start difference. First operand 1272 states and 2070 transitions. Second operand 3 states. [2018-11-23 12:42:20,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:20,601 INFO L93 Difference]: Finished difference Result 2316 states and 3848 transitions. [2018-11-23 12:42:20,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:20,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 12:42:20,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:20,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:20,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2018-11-23 12:42:20,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:20,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2018-11-23 12:42:20,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 146 transitions. [2018-11-23 12:42:20,747 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:20,942 INFO L225 Difference]: With dead ends: 2316 [2018-11-23 12:42:20,942 INFO L226 Difference]: Without dead ends: 2314 [2018-11-23 12:42:20,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:42:20,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2018-11-23 12:42:21,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 1800. [2018-11-23 12:42:21,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:21,257 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2314 states. Second operand 1800 states. [2018-11-23 12:42:21,258 INFO L74 IsIncluded]: Start isIncluded. First operand 2314 states. Second operand 1800 states. [2018-11-23 12:42:21,258 INFO L87 Difference]: Start difference. First operand 2314 states. Second operand 1800 states. [2018-11-23 12:42:21,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:21,413 INFO L93 Difference]: Finished difference Result 2314 states and 3815 transitions. [2018-11-23 12:42:21,414 INFO L276 IsEmpty]: Start isEmpty. Operand 2314 states and 3815 transitions. [2018-11-23 12:42:21,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:21,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:21,416 INFO L74 IsIncluded]: Start isIncluded. First operand 1800 states. Second operand 2314 states. [2018-11-23 12:42:21,416 INFO L87 Difference]: Start difference. First operand 1800 states. Second operand 2314 states. [2018-11-23 12:42:21,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:21,564 INFO L93 Difference]: Finished difference Result 2314 states and 3815 transitions. [2018-11-23 12:42:21,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2314 states and 3815 transitions. [2018-11-23 12:42:21,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:21,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:21,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:21,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:21,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1800 states. [2018-11-23 12:42:21,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2854 transitions. [2018-11-23 12:42:21,666 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2854 transitions. Word has length 28 [2018-11-23 12:42:21,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:21,666 INFO L480 AbstractCegarLoop]: Abstraction has 1800 states and 2854 transitions. [2018-11-23 12:42:21,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:21,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2854 transitions. [2018-11-23 12:42:21,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:42:21,668 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:21,668 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:21,668 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:21,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:21,668 INFO L82 PathProgramCache]: Analyzing trace with hash 2081869802, now seen corresponding path program 1 times [2018-11-23 12:42:21,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:21,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:21,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:21,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:21,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:21,903 INFO L256 TraceCheckUtils]: 0: Hoare triple {41545#true} call ULTIMATE.init(); {41545#true} is VALID [2018-11-23 12:42:21,904 INFO L273 TraceCheckUtils]: 1: Hoare triple {41545#true} assume true; {41545#true} is VALID [2018-11-23 12:42:21,904 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {41545#true} {41545#true} #248#return; {41545#true} is VALID [2018-11-23 12:42:21,904 INFO L256 TraceCheckUtils]: 3: Hoare triple {41545#true} call #t~ret14 := main(); {41545#true} is VALID [2018-11-23 12:42:21,904 INFO L273 TraceCheckUtils]: 4: Hoare triple {41545#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {41545#true} is VALID [2018-11-23 12:42:21,905 INFO L273 TraceCheckUtils]: 5: Hoare triple {41545#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {41545#true} is VALID [2018-11-23 12:42:21,905 INFO L273 TraceCheckUtils]: 6: Hoare triple {41545#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {41545#true} is VALID [2018-11-23 12:42:21,905 INFO L273 TraceCheckUtils]: 7: Hoare triple {41545#true} assume !(0 != ~p1~0); {41545#true} is VALID [2018-11-23 12:42:21,905 INFO L273 TraceCheckUtils]: 8: Hoare triple {41545#true} assume !(0 != ~p2~0); {41545#true} is VALID [2018-11-23 12:42:21,905 INFO L273 TraceCheckUtils]: 9: Hoare triple {41545#true} assume !(0 != ~p3~0); {41545#true} is VALID [2018-11-23 12:42:21,906 INFO L273 TraceCheckUtils]: 10: Hoare triple {41545#true} assume !(0 != ~p4~0); {41545#true} is VALID [2018-11-23 12:42:21,906 INFO L273 TraceCheckUtils]: 11: Hoare triple {41545#true} assume !(0 != ~p5~0); {41545#true} is VALID [2018-11-23 12:42:21,918 INFO L273 TraceCheckUtils]: 12: Hoare triple {41545#true} assume !(0 != ~p6~0); {41547#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:21,933 INFO L273 TraceCheckUtils]: 13: Hoare triple {41547#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {41547#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:21,942 INFO L273 TraceCheckUtils]: 14: Hoare triple {41547#(= main_~p6~0 0)} assume !(0 != ~p8~0); {41547#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:21,954 INFO L273 TraceCheckUtils]: 15: Hoare triple {41547#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {41547#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:21,967 INFO L273 TraceCheckUtils]: 16: Hoare triple {41547#(= main_~p6~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {41547#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:21,980 INFO L273 TraceCheckUtils]: 17: Hoare triple {41547#(= main_~p6~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {41547#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:21,993 INFO L273 TraceCheckUtils]: 18: Hoare triple {41547#(= main_~p6~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {41547#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:22,005 INFO L273 TraceCheckUtils]: 19: Hoare triple {41547#(= main_~p6~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {41547#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:22,018 INFO L273 TraceCheckUtils]: 20: Hoare triple {41547#(= main_~p6~0 0)} assume !(0 != ~p1~0); {41547#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:22,031 INFO L273 TraceCheckUtils]: 21: Hoare triple {41547#(= main_~p6~0 0)} assume !(0 != ~p2~0); {41547#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:22,044 INFO L273 TraceCheckUtils]: 22: Hoare triple {41547#(= main_~p6~0 0)} assume !(0 != ~p3~0); {41547#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:22,063 INFO L273 TraceCheckUtils]: 23: Hoare triple {41547#(= main_~p6~0 0)} assume !(0 != ~p4~0); {41547#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:22,072 INFO L273 TraceCheckUtils]: 24: Hoare triple {41547#(= main_~p6~0 0)} assume !(0 != ~p5~0); {41547#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:22,084 INFO L273 TraceCheckUtils]: 25: Hoare triple {41547#(= main_~p6~0 0)} assume 0 != ~p6~0; {41546#false} is VALID [2018-11-23 12:42:22,085 INFO L273 TraceCheckUtils]: 26: Hoare triple {41546#false} assume 1 != ~lk6~0; {41546#false} is VALID [2018-11-23 12:42:22,085 INFO L273 TraceCheckUtils]: 27: Hoare triple {41546#false} assume !false; {41546#false} is VALID [2018-11-23 12:42:22,086 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 12:42:22,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:22,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:22,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 12:42:22,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:22,087 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:22,334 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:22,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:22,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:22,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:22,335 INFO L87 Difference]: Start difference. First operand 1800 states and 2854 transitions. Second operand 3 states. [2018-11-23 12:42:24,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:24,369 INFO L93 Difference]: Finished difference Result 4236 states and 6760 transitions. [2018-11-23 12:42:24,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:24,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 12:42:24,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:24,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:24,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2018-11-23 12:42:24,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:24,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2018-11-23 12:42:24,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 230 transitions. [2018-11-23 12:42:24,574 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 230 edges. 230 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:24,836 INFO L225 Difference]: With dead ends: 4236 [2018-11-23 12:42:24,836 INFO L226 Difference]: Without dead ends: 2474 [2018-11-23 12:42:24,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:42:24,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2018-11-23 12:42:25,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2472. [2018-11-23 12:42:25,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:25,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2474 states. Second operand 2472 states. [2018-11-23 12:42:25,669 INFO L74 IsIncluded]: Start isIncluded. First operand 2474 states. Second operand 2472 states. [2018-11-23 12:42:25,669 INFO L87 Difference]: Start difference. First operand 2474 states. Second operand 2472 states. [2018-11-23 12:42:25,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:25,946 INFO L93 Difference]: Finished difference Result 2474 states and 3911 transitions. [2018-11-23 12:42:25,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 3911 transitions. [2018-11-23 12:42:25,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:25,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:25,949 INFO L74 IsIncluded]: Start isIncluded. First operand 2472 states. Second operand 2474 states. [2018-11-23 12:42:25,949 INFO L87 Difference]: Start difference. First operand 2472 states. Second operand 2474 states. [2018-11-23 12:42:26,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:26,170 INFO L93 Difference]: Finished difference Result 2474 states and 3911 transitions. [2018-11-23 12:42:26,170 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 3911 transitions. [2018-11-23 12:42:26,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:26,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:26,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:26,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:26,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2018-11-23 12:42:26,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3910 transitions. [2018-11-23 12:42:26,404 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3910 transitions. Word has length 28 [2018-11-23 12:42:26,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:26,404 INFO L480 AbstractCegarLoop]: Abstraction has 2472 states and 3910 transitions. [2018-11-23 12:42:26,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:26,404 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3910 transitions. [2018-11-23 12:42:26,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 12:42:26,406 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:26,406 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:26,406 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:26,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:26,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1702016437, now seen corresponding path program 1 times [2018-11-23 12:42:26,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:26,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:26,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:26,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:26,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:26,584 INFO L256 TraceCheckUtils]: 0: Hoare triple {53380#true} call ULTIMATE.init(); {53380#true} is VALID [2018-11-23 12:42:26,584 INFO L273 TraceCheckUtils]: 1: Hoare triple {53380#true} assume true; {53380#true} is VALID [2018-11-23 12:42:26,584 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {53380#true} {53380#true} #248#return; {53380#true} is VALID [2018-11-23 12:42:26,585 INFO L256 TraceCheckUtils]: 3: Hoare triple {53380#true} call #t~ret14 := main(); {53380#true} is VALID [2018-11-23 12:42:26,585 INFO L273 TraceCheckUtils]: 4: Hoare triple {53380#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {53380#true} is VALID [2018-11-23 12:42:26,585 INFO L273 TraceCheckUtils]: 5: Hoare triple {53380#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {53380#true} is VALID [2018-11-23 12:42:26,585 INFO L273 TraceCheckUtils]: 6: Hoare triple {53380#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {53380#true} is VALID [2018-11-23 12:42:26,585 INFO L273 TraceCheckUtils]: 7: Hoare triple {53380#true} assume !(0 != ~p1~0); {53380#true} is VALID [2018-11-23 12:42:26,585 INFO L273 TraceCheckUtils]: 8: Hoare triple {53380#true} assume !(0 != ~p2~0); {53380#true} is VALID [2018-11-23 12:42:26,585 INFO L273 TraceCheckUtils]: 9: Hoare triple {53380#true} assume !(0 != ~p3~0); {53380#true} is VALID [2018-11-23 12:42:26,586 INFO L273 TraceCheckUtils]: 10: Hoare triple {53380#true} assume !(0 != ~p4~0); {53380#true} is VALID [2018-11-23 12:42:26,586 INFO L273 TraceCheckUtils]: 11: Hoare triple {53380#true} assume !(0 != ~p5~0); {53380#true} is VALID [2018-11-23 12:42:26,586 INFO L273 TraceCheckUtils]: 12: Hoare triple {53380#true} assume 0 != ~p6~0;~lk6~0 := 1; {53382#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:42:26,588 INFO L273 TraceCheckUtils]: 13: Hoare triple {53382#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {53382#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:42:26,588 INFO L273 TraceCheckUtils]: 14: Hoare triple {53382#(not (= main_~p6~0 0))} assume !(0 != ~p8~0); {53382#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:42:26,588 INFO L273 TraceCheckUtils]: 15: Hoare triple {53382#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {53382#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:42:26,589 INFO L273 TraceCheckUtils]: 16: Hoare triple {53382#(not (= main_~p6~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {53382#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:42:26,589 INFO L273 TraceCheckUtils]: 17: Hoare triple {53382#(not (= main_~p6~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {53382#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:42:26,589 INFO L273 TraceCheckUtils]: 18: Hoare triple {53382#(not (= main_~p6~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {53382#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:42:26,590 INFO L273 TraceCheckUtils]: 19: Hoare triple {53382#(not (= main_~p6~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {53382#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:42:26,590 INFO L273 TraceCheckUtils]: 20: Hoare triple {53382#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {53382#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:42:26,590 INFO L273 TraceCheckUtils]: 21: Hoare triple {53382#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {53382#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:42:26,591 INFO L273 TraceCheckUtils]: 22: Hoare triple {53382#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {53382#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:42:26,591 INFO L273 TraceCheckUtils]: 23: Hoare triple {53382#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {53382#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:42:26,591 INFO L273 TraceCheckUtils]: 24: Hoare triple {53382#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {53382#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:42:26,592 INFO L273 TraceCheckUtils]: 25: Hoare triple {53382#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {53381#false} is VALID [2018-11-23 12:42:26,592 INFO L273 TraceCheckUtils]: 26: Hoare triple {53381#false} assume 0 != ~p7~0; {53381#false} is VALID [2018-11-23 12:42:26,592 INFO L273 TraceCheckUtils]: 27: Hoare triple {53381#false} assume 1 != ~lk7~0; {53381#false} is VALID [2018-11-23 12:42:26,593 INFO L273 TraceCheckUtils]: 28: Hoare triple {53381#false} assume !false; {53381#false} is VALID [2018-11-23 12:42:26,594 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 12:42:26,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:26,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:26,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 12:42:26,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:26,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:26,618 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:26,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:26,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:26,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:26,620 INFO L87 Difference]: Start difference. First operand 2472 states and 3910 transitions. Second operand 3 states. [2018-11-23 12:42:27,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:27,940 INFO L93 Difference]: Finished difference Result 3708 states and 5848 transitions. [2018-11-23 12:42:27,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:27,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 12:42:27,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:27,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:27,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2018-11-23 12:42:27,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:27,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2018-11-23 12:42:27,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 225 transitions. [2018-11-23 12:42:28,144 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:28,408 INFO L225 Difference]: With dead ends: 3708 [2018-11-23 12:42:28,408 INFO L226 Difference]: Without dead ends: 2506 [2018-11-23 12:42:28,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:42:28,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2018-11-23 12:42:29,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2504. [2018-11-23 12:42:29,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:29,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2506 states. Second operand 2504 states. [2018-11-23 12:42:29,143 INFO L74 IsIncluded]: Start isIncluded. First operand 2506 states. Second operand 2504 states. [2018-11-23 12:42:29,143 INFO L87 Difference]: Start difference. First operand 2506 states. Second operand 2504 states. [2018-11-23 12:42:29,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:29,321 INFO L93 Difference]: Finished difference Result 2506 states and 3911 transitions. [2018-11-23 12:42:29,321 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 3911 transitions. [2018-11-23 12:42:29,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:29,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:29,324 INFO L74 IsIncluded]: Start isIncluded. First operand 2504 states. Second operand 2506 states. [2018-11-23 12:42:29,324 INFO L87 Difference]: Start difference. First operand 2504 states. Second operand 2506 states. [2018-11-23 12:42:29,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:29,500 INFO L93 Difference]: Finished difference Result 2506 states and 3911 transitions. [2018-11-23 12:42:29,500 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 3911 transitions. [2018-11-23 12:42:29,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:29,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:29,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:29,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:29,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2504 states. [2018-11-23 12:42:29,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3910 transitions. [2018-11-23 12:42:29,695 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3910 transitions. Word has length 29 [2018-11-23 12:42:29,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:29,695 INFO L480 AbstractCegarLoop]: Abstraction has 2504 states and 3910 transitions. [2018-11-23 12:42:29,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:29,695 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3910 transitions. [2018-11-23 12:42:29,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 12:42:29,697 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:29,697 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:29,697 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:29,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:29,698 INFO L82 PathProgramCache]: Analyzing trace with hash 113668535, now seen corresponding path program 1 times [2018-11-23 12:42:29,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:29,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:29,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:29,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:29,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:29,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:29,936 INFO L256 TraceCheckUtils]: 0: Hoare triple {64783#true} call ULTIMATE.init(); {64783#true} is VALID [2018-11-23 12:42:29,936 INFO L273 TraceCheckUtils]: 1: Hoare triple {64783#true} assume true; {64783#true} is VALID [2018-11-23 12:42:29,936 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {64783#true} {64783#true} #248#return; {64783#true} is VALID [2018-11-23 12:42:29,937 INFO L256 TraceCheckUtils]: 3: Hoare triple {64783#true} call #t~ret14 := main(); {64783#true} is VALID [2018-11-23 12:42:29,937 INFO L273 TraceCheckUtils]: 4: Hoare triple {64783#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {64783#true} is VALID [2018-11-23 12:42:29,937 INFO L273 TraceCheckUtils]: 5: Hoare triple {64783#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {64783#true} is VALID [2018-11-23 12:42:29,937 INFO L273 TraceCheckUtils]: 6: Hoare triple {64783#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {64783#true} is VALID [2018-11-23 12:42:29,937 INFO L273 TraceCheckUtils]: 7: Hoare triple {64783#true} assume !(0 != ~p1~0); {64783#true} is VALID [2018-11-23 12:42:29,938 INFO L273 TraceCheckUtils]: 8: Hoare triple {64783#true} assume !(0 != ~p2~0); {64783#true} is VALID [2018-11-23 12:42:29,938 INFO L273 TraceCheckUtils]: 9: Hoare triple {64783#true} assume !(0 != ~p3~0); {64783#true} is VALID [2018-11-23 12:42:29,938 INFO L273 TraceCheckUtils]: 10: Hoare triple {64783#true} assume !(0 != ~p4~0); {64783#true} is VALID [2018-11-23 12:42:29,938 INFO L273 TraceCheckUtils]: 11: Hoare triple {64783#true} assume !(0 != ~p5~0); {64783#true} is VALID [2018-11-23 12:42:29,938 INFO L273 TraceCheckUtils]: 12: Hoare triple {64783#true} assume !(0 != ~p6~0); {64783#true} is VALID [2018-11-23 12:42:29,951 INFO L273 TraceCheckUtils]: 13: Hoare triple {64783#true} assume 0 != ~p7~0;~lk7~0 := 1; {64785#(= main_~lk7~0 1)} is VALID [2018-11-23 12:42:29,964 INFO L273 TraceCheckUtils]: 14: Hoare triple {64785#(= main_~lk7~0 1)} assume !(0 != ~p8~0); {64785#(= main_~lk7~0 1)} is VALID [2018-11-23 12:42:29,976 INFO L273 TraceCheckUtils]: 15: Hoare triple {64785#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {64785#(= main_~lk7~0 1)} is VALID [2018-11-23 12:42:29,989 INFO L273 TraceCheckUtils]: 16: Hoare triple {64785#(= main_~lk7~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {64785#(= main_~lk7~0 1)} is VALID [2018-11-23 12:42:30,002 INFO L273 TraceCheckUtils]: 17: Hoare triple {64785#(= main_~lk7~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {64785#(= main_~lk7~0 1)} is VALID [2018-11-23 12:42:30,014 INFO L273 TraceCheckUtils]: 18: Hoare triple {64785#(= main_~lk7~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {64785#(= main_~lk7~0 1)} is VALID [2018-11-23 12:42:30,027 INFO L273 TraceCheckUtils]: 19: Hoare triple {64785#(= main_~lk7~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {64785#(= main_~lk7~0 1)} is VALID [2018-11-23 12:42:30,034 INFO L273 TraceCheckUtils]: 20: Hoare triple {64785#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {64785#(= main_~lk7~0 1)} is VALID [2018-11-23 12:42:30,045 INFO L273 TraceCheckUtils]: 21: Hoare triple {64785#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {64785#(= main_~lk7~0 1)} is VALID [2018-11-23 12:42:30,057 INFO L273 TraceCheckUtils]: 22: Hoare triple {64785#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {64785#(= main_~lk7~0 1)} is VALID [2018-11-23 12:42:30,063 INFO L273 TraceCheckUtils]: 23: Hoare triple {64785#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {64785#(= main_~lk7~0 1)} is VALID [2018-11-23 12:42:30,064 INFO L273 TraceCheckUtils]: 24: Hoare triple {64785#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {64785#(= main_~lk7~0 1)} is VALID [2018-11-23 12:42:30,066 INFO L273 TraceCheckUtils]: 25: Hoare triple {64785#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {64785#(= main_~lk7~0 1)} is VALID [2018-11-23 12:42:30,066 INFO L273 TraceCheckUtils]: 26: Hoare triple {64785#(= main_~lk7~0 1)} assume 0 != ~p7~0; {64785#(= main_~lk7~0 1)} is VALID [2018-11-23 12:42:30,068 INFO L273 TraceCheckUtils]: 27: Hoare triple {64785#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {64784#false} is VALID [2018-11-23 12:42:30,068 INFO L273 TraceCheckUtils]: 28: Hoare triple {64784#false} assume !false; {64784#false} is VALID [2018-11-23 12:42:30,068 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 12:42:30,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:30,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:30,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 12:42:30,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:30,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:30,098 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:30,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:30,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:30,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:30,099 INFO L87 Difference]: Start difference. First operand 2504 states and 3910 transitions. Second operand 3 states. [2018-11-23 12:42:32,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:32,070 INFO L93 Difference]: Finished difference Result 4492 states and 7176 transitions. [2018-11-23 12:42:32,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:32,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 12:42:32,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:32,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:32,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 142 transitions. [2018-11-23 12:42:32,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:32,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 142 transitions. [2018-11-23 12:42:32,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 142 transitions. [2018-11-23 12:42:32,215 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:33,095 INFO L225 Difference]: With dead ends: 4492 [2018-11-23 12:42:33,095 INFO L226 Difference]: Without dead ends: 4490 [2018-11-23 12:42:33,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:42:33,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2018-11-23 12:42:33,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 3592. [2018-11-23 12:42:33,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:33,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4490 states. Second operand 3592 states. [2018-11-23 12:42:33,884 INFO L74 IsIncluded]: Start isIncluded. First operand 4490 states. Second operand 3592 states. [2018-11-23 12:42:33,884 INFO L87 Difference]: Start difference. First operand 4490 states. Second operand 3592 states. [2018-11-23 12:42:34,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:34,634 INFO L93 Difference]: Finished difference Result 4490 states and 7111 transitions. [2018-11-23 12:42:34,634 INFO L276 IsEmpty]: Start isEmpty. Operand 4490 states and 7111 transitions. [2018-11-23 12:42:34,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:34,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:34,639 INFO L74 IsIncluded]: Start isIncluded. First operand 3592 states. Second operand 4490 states. [2018-11-23 12:42:34,639 INFO L87 Difference]: Start difference. First operand 3592 states. Second operand 4490 states. [2018-11-23 12:42:35,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:35,396 INFO L93 Difference]: Finished difference Result 4490 states and 7111 transitions. [2018-11-23 12:42:35,397 INFO L276 IsEmpty]: Start isEmpty. Operand 4490 states and 7111 transitions. [2018-11-23 12:42:35,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:35,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:35,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:35,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:35,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3592 states. [2018-11-23 12:42:35,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 3592 states and 5446 transitions. [2018-11-23 12:42:35,936 INFO L78 Accepts]: Start accepts. Automaton has 3592 states and 5446 transitions. Word has length 29 [2018-11-23 12:42:35,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:35,937 INFO L480 AbstractCegarLoop]: Abstraction has 3592 states and 5446 transitions. [2018-11-23 12:42:35,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:35,937 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 5446 transitions. [2018-11-23 12:42:35,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 12:42:35,939 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:35,939 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:35,940 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:35,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:35,940 INFO L82 PathProgramCache]: Analyzing trace with hash -907399819, now seen corresponding path program 1 times [2018-11-23 12:42:35,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:35,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:35,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:35,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:35,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:35,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:36,067 INFO L256 TraceCheckUtils]: 0: Hoare triple {82058#true} call ULTIMATE.init(); {82058#true} is VALID [2018-11-23 12:42:36,067 INFO L273 TraceCheckUtils]: 1: Hoare triple {82058#true} assume true; {82058#true} is VALID [2018-11-23 12:42:36,067 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {82058#true} {82058#true} #248#return; {82058#true} is VALID [2018-11-23 12:42:36,068 INFO L256 TraceCheckUtils]: 3: Hoare triple {82058#true} call #t~ret14 := main(); {82058#true} is VALID [2018-11-23 12:42:36,068 INFO L273 TraceCheckUtils]: 4: Hoare triple {82058#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {82058#true} is VALID [2018-11-23 12:42:36,068 INFO L273 TraceCheckUtils]: 5: Hoare triple {82058#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {82058#true} is VALID [2018-11-23 12:42:36,068 INFO L273 TraceCheckUtils]: 6: Hoare triple {82058#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {82058#true} is VALID [2018-11-23 12:42:36,068 INFO L273 TraceCheckUtils]: 7: Hoare triple {82058#true} assume !(0 != ~p1~0); {82058#true} is VALID [2018-11-23 12:42:36,068 INFO L273 TraceCheckUtils]: 8: Hoare triple {82058#true} assume !(0 != ~p2~0); {82058#true} is VALID [2018-11-23 12:42:36,069 INFO L273 TraceCheckUtils]: 9: Hoare triple {82058#true} assume !(0 != ~p3~0); {82058#true} is VALID [2018-11-23 12:42:36,069 INFO L273 TraceCheckUtils]: 10: Hoare triple {82058#true} assume !(0 != ~p4~0); {82058#true} is VALID [2018-11-23 12:42:36,069 INFO L273 TraceCheckUtils]: 11: Hoare triple {82058#true} assume !(0 != ~p5~0); {82058#true} is VALID [2018-11-23 12:42:36,069 INFO L273 TraceCheckUtils]: 12: Hoare triple {82058#true} assume !(0 != ~p6~0); {82058#true} is VALID [2018-11-23 12:42:36,071 INFO L273 TraceCheckUtils]: 13: Hoare triple {82058#true} assume !(0 != ~p7~0); {82060#(= main_~p7~0 0)} is VALID [2018-11-23 12:42:36,071 INFO L273 TraceCheckUtils]: 14: Hoare triple {82060#(= main_~p7~0 0)} assume !(0 != ~p8~0); {82060#(= main_~p7~0 0)} is VALID [2018-11-23 12:42:36,073 INFO L273 TraceCheckUtils]: 15: Hoare triple {82060#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {82060#(= main_~p7~0 0)} is VALID [2018-11-23 12:42:36,075 INFO L273 TraceCheckUtils]: 16: Hoare triple {82060#(= main_~p7~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {82060#(= main_~p7~0 0)} is VALID [2018-11-23 12:42:36,081 INFO L273 TraceCheckUtils]: 17: Hoare triple {82060#(= main_~p7~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {82060#(= main_~p7~0 0)} is VALID [2018-11-23 12:42:36,090 INFO L273 TraceCheckUtils]: 18: Hoare triple {82060#(= main_~p7~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {82060#(= main_~p7~0 0)} is VALID [2018-11-23 12:42:36,097 INFO L273 TraceCheckUtils]: 19: Hoare triple {82060#(= main_~p7~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {82060#(= main_~p7~0 0)} is VALID [2018-11-23 12:42:36,098 INFO L273 TraceCheckUtils]: 20: Hoare triple {82060#(= main_~p7~0 0)} assume !(0 != ~p1~0); {82060#(= main_~p7~0 0)} is VALID [2018-11-23 12:42:36,102 INFO L273 TraceCheckUtils]: 21: Hoare triple {82060#(= main_~p7~0 0)} assume !(0 != ~p2~0); {82060#(= main_~p7~0 0)} is VALID [2018-11-23 12:42:36,102 INFO L273 TraceCheckUtils]: 22: Hoare triple {82060#(= main_~p7~0 0)} assume !(0 != ~p3~0); {82060#(= main_~p7~0 0)} is VALID [2018-11-23 12:42:36,102 INFO L273 TraceCheckUtils]: 23: Hoare triple {82060#(= main_~p7~0 0)} assume !(0 != ~p4~0); {82060#(= main_~p7~0 0)} is VALID [2018-11-23 12:42:36,103 INFO L273 TraceCheckUtils]: 24: Hoare triple {82060#(= main_~p7~0 0)} assume !(0 != ~p5~0); {82060#(= main_~p7~0 0)} is VALID [2018-11-23 12:42:36,103 INFO L273 TraceCheckUtils]: 25: Hoare triple {82060#(= main_~p7~0 0)} assume !(0 != ~p6~0); {82060#(= main_~p7~0 0)} is VALID [2018-11-23 12:42:36,103 INFO L273 TraceCheckUtils]: 26: Hoare triple {82060#(= main_~p7~0 0)} assume 0 != ~p7~0; {82059#false} is VALID [2018-11-23 12:42:36,103 INFO L273 TraceCheckUtils]: 27: Hoare triple {82059#false} assume 1 != ~lk7~0; {82059#false} is VALID [2018-11-23 12:42:36,103 INFO L273 TraceCheckUtils]: 28: Hoare triple {82059#false} assume !false; {82059#false} is VALID [2018-11-23 12:42:36,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:42:36,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:36,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:36,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 12:42:36,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:36,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:36,129 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:36,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:36,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:36,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:36,130 INFO L87 Difference]: Start difference. First operand 3592 states and 5446 transitions. Second operand 3 states. [2018-11-23 12:42:39,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:39,901 INFO L93 Difference]: Finished difference Result 8396 states and 12808 transitions. [2018-11-23 12:42:39,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:39,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 12:42:39,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:39,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:39,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2018-11-23 12:42:39,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:39,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2018-11-23 12:42:39,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 227 transitions. [2018-11-23 12:42:40,111 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:41,087 INFO L225 Difference]: With dead ends: 8396 [2018-11-23 12:42:41,087 INFO L226 Difference]: Without dead ends: 4874 [2018-11-23 12:42:41,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:42:41,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2018-11-23 12:42:42,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 4872. [2018-11-23 12:42:42,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:42,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4874 states. Second operand 4872 states. [2018-11-23 12:42:42,233 INFO L74 IsIncluded]: Start isIncluded. First operand 4874 states. Second operand 4872 states. [2018-11-23 12:42:42,233 INFO L87 Difference]: Start difference. First operand 4874 states. Second operand 4872 states. [2018-11-23 12:42:43,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:43,099 INFO L93 Difference]: Finished difference Result 4874 states and 7367 transitions. [2018-11-23 12:42:43,099 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states and 7367 transitions. [2018-11-23 12:42:43,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:43,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:43,104 INFO L74 IsIncluded]: Start isIncluded. First operand 4872 states. Second operand 4874 states. [2018-11-23 12:42:43,104 INFO L87 Difference]: Start difference. First operand 4872 states. Second operand 4874 states. [2018-11-23 12:42:43,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:43,860 INFO L93 Difference]: Finished difference Result 4874 states and 7367 transitions. [2018-11-23 12:42:43,860 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states and 7367 transitions. [2018-11-23 12:42:43,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:43,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:43,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:43,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:43,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4872 states. [2018-11-23 12:42:44,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 7366 transitions. [2018-11-23 12:42:44,776 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 7366 transitions. Word has length 29 [2018-11-23 12:42:44,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:44,776 INFO L480 AbstractCegarLoop]: Abstraction has 4872 states and 7366 transitions. [2018-11-23 12:42:44,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:44,776 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 7366 transitions. [2018-11-23 12:42:44,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:42:44,779 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:44,779 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:44,779 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:44,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:44,780 INFO L82 PathProgramCache]: Analyzing trace with hash -771028257, now seen corresponding path program 1 times [2018-11-23 12:42:44,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:44,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:44,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:44,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:44,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:44,898 INFO L256 TraceCheckUtils]: 0: Hoare triple {105413#true} call ULTIMATE.init(); {105413#true} is VALID [2018-11-23 12:42:44,898 INFO L273 TraceCheckUtils]: 1: Hoare triple {105413#true} assume true; {105413#true} is VALID [2018-11-23 12:42:44,899 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {105413#true} {105413#true} #248#return; {105413#true} is VALID [2018-11-23 12:42:44,899 INFO L256 TraceCheckUtils]: 3: Hoare triple {105413#true} call #t~ret14 := main(); {105413#true} is VALID [2018-11-23 12:42:44,899 INFO L273 TraceCheckUtils]: 4: Hoare triple {105413#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {105413#true} is VALID [2018-11-23 12:42:44,899 INFO L273 TraceCheckUtils]: 5: Hoare triple {105413#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {105413#true} is VALID [2018-11-23 12:42:44,899 INFO L273 TraceCheckUtils]: 6: Hoare triple {105413#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {105413#true} is VALID [2018-11-23 12:42:44,899 INFO L273 TraceCheckUtils]: 7: Hoare triple {105413#true} assume !(0 != ~p1~0); {105413#true} is VALID [2018-11-23 12:42:44,899 INFO L273 TraceCheckUtils]: 8: Hoare triple {105413#true} assume !(0 != ~p2~0); {105413#true} is VALID [2018-11-23 12:42:44,900 INFO L273 TraceCheckUtils]: 9: Hoare triple {105413#true} assume !(0 != ~p3~0); {105413#true} is VALID [2018-11-23 12:42:44,900 INFO L273 TraceCheckUtils]: 10: Hoare triple {105413#true} assume !(0 != ~p4~0); {105413#true} is VALID [2018-11-23 12:42:44,900 INFO L273 TraceCheckUtils]: 11: Hoare triple {105413#true} assume !(0 != ~p5~0); {105413#true} is VALID [2018-11-23 12:42:44,900 INFO L273 TraceCheckUtils]: 12: Hoare triple {105413#true} assume !(0 != ~p6~0); {105413#true} is VALID [2018-11-23 12:42:44,900 INFO L273 TraceCheckUtils]: 13: Hoare triple {105413#true} assume 0 != ~p7~0;~lk7~0 := 1; {105415#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:42:44,904 INFO L273 TraceCheckUtils]: 14: Hoare triple {105415#(not (= main_~p7~0 0))} assume !(0 != ~p8~0); {105415#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:42:44,904 INFO L273 TraceCheckUtils]: 15: Hoare triple {105415#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {105415#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:42:44,906 INFO L273 TraceCheckUtils]: 16: Hoare triple {105415#(not (= main_~p7~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {105415#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:42:44,906 INFO L273 TraceCheckUtils]: 17: Hoare triple {105415#(not (= main_~p7~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {105415#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:42:44,909 INFO L273 TraceCheckUtils]: 18: Hoare triple {105415#(not (= main_~p7~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {105415#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:42:44,909 INFO L273 TraceCheckUtils]: 19: Hoare triple {105415#(not (= main_~p7~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {105415#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:42:44,909 INFO L273 TraceCheckUtils]: 20: Hoare triple {105415#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {105415#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:42:44,910 INFO L273 TraceCheckUtils]: 21: Hoare triple {105415#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {105415#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:42:44,910 INFO L273 TraceCheckUtils]: 22: Hoare triple {105415#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {105415#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:42:44,910 INFO L273 TraceCheckUtils]: 23: Hoare triple {105415#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {105415#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:42:44,911 INFO L273 TraceCheckUtils]: 24: Hoare triple {105415#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {105415#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:42:44,911 INFO L273 TraceCheckUtils]: 25: Hoare triple {105415#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {105415#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:42:44,911 INFO L273 TraceCheckUtils]: 26: Hoare triple {105415#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {105414#false} is VALID [2018-11-23 12:42:44,911 INFO L273 TraceCheckUtils]: 27: Hoare triple {105414#false} assume 0 != ~p8~0; {105414#false} is VALID [2018-11-23 12:42:44,912 INFO L273 TraceCheckUtils]: 28: Hoare triple {105414#false} assume 1 != ~lk8~0; {105414#false} is VALID [2018-11-23 12:42:44,912 INFO L273 TraceCheckUtils]: 29: Hoare triple {105414#false} assume !false; {105414#false} is VALID [2018-11-23 12:42:44,913 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 12:42:44,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:44,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:44,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 12:42:44,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:44,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:44,939 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:44,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:44,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:44,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:44,940 INFO L87 Difference]: Start difference. First operand 4872 states and 7366 transitions. Second operand 3 states. [2018-11-23 12:42:48,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:48,818 INFO L93 Difference]: Finished difference Result 7308 states and 11016 transitions. [2018-11-23 12:42:48,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:48,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 12:42:48,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:48,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:48,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 222 transitions. [2018-11-23 12:42:48,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:48,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 222 transitions. [2018-11-23 12:42:48,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 222 transitions. [2018-11-23 12:42:49,020 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:50,040 INFO L225 Difference]: With dead ends: 7308 [2018-11-23 12:42:50,040 INFO L226 Difference]: Without dead ends: 4938 [2018-11-23 12:42:50,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:42:50,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4938 states. [2018-11-23 12:42:51,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4938 to 4936. [2018-11-23 12:42:51,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:51,690 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4938 states. Second operand 4936 states. [2018-11-23 12:42:51,690 INFO L74 IsIncluded]: Start isIncluded. First operand 4938 states. Second operand 4936 states. [2018-11-23 12:42:51,690 INFO L87 Difference]: Start difference. First operand 4938 states. Second operand 4936 states. [2018-11-23 12:42:52,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:52,552 INFO L93 Difference]: Finished difference Result 4938 states and 7367 transitions. [2018-11-23 12:42:52,552 INFO L276 IsEmpty]: Start isEmpty. Operand 4938 states and 7367 transitions. [2018-11-23 12:42:52,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:52,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:52,557 INFO L74 IsIncluded]: Start isIncluded. First operand 4936 states. Second operand 4938 states. [2018-11-23 12:42:52,558 INFO L87 Difference]: Start difference. First operand 4936 states. Second operand 4938 states. [2018-11-23 12:42:53,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:53,299 INFO L93 Difference]: Finished difference Result 4938 states and 7367 transitions. [2018-11-23 12:42:53,299 INFO L276 IsEmpty]: Start isEmpty. Operand 4938 states and 7367 transitions. [2018-11-23 12:42:53,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:53,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:53,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:53,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:53,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4936 states. [2018-11-23 12:42:54,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4936 states to 4936 states and 7366 transitions. [2018-11-23 12:42:54,182 INFO L78 Accepts]: Start accepts. Automaton has 4936 states and 7366 transitions. Word has length 30 [2018-11-23 12:42:54,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:54,183 INFO L480 AbstractCegarLoop]: Abstraction has 4936 states and 7366 transitions. [2018-11-23 12:42:54,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:54,183 INFO L276 IsEmpty]: Start isEmpty. Operand 4936 states and 7366 transitions. [2018-11-23 12:42:54,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:42:54,185 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:54,185 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:54,185 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:54,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:54,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1935591137, now seen corresponding path program 1 times [2018-11-23 12:42:54,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:54,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:54,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:54,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:54,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:54,320 INFO L256 TraceCheckUtils]: 0: Hoare triple {127872#true} call ULTIMATE.init(); {127872#true} is VALID [2018-11-23 12:42:54,320 INFO L273 TraceCheckUtils]: 1: Hoare triple {127872#true} assume true; {127872#true} is VALID [2018-11-23 12:42:54,321 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {127872#true} {127872#true} #248#return; {127872#true} is VALID [2018-11-23 12:42:54,321 INFO L256 TraceCheckUtils]: 3: Hoare triple {127872#true} call #t~ret14 := main(); {127872#true} is VALID [2018-11-23 12:42:54,321 INFO L273 TraceCheckUtils]: 4: Hoare triple {127872#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {127872#true} is VALID [2018-11-23 12:42:54,321 INFO L273 TraceCheckUtils]: 5: Hoare triple {127872#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {127872#true} is VALID [2018-11-23 12:42:54,321 INFO L273 TraceCheckUtils]: 6: Hoare triple {127872#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {127872#true} is VALID [2018-11-23 12:42:54,321 INFO L273 TraceCheckUtils]: 7: Hoare triple {127872#true} assume !(0 != ~p1~0); {127872#true} is VALID [2018-11-23 12:42:54,321 INFO L273 TraceCheckUtils]: 8: Hoare triple {127872#true} assume !(0 != ~p2~0); {127872#true} is VALID [2018-11-23 12:42:54,321 INFO L273 TraceCheckUtils]: 9: Hoare triple {127872#true} assume !(0 != ~p3~0); {127872#true} is VALID [2018-11-23 12:42:54,322 INFO L273 TraceCheckUtils]: 10: Hoare triple {127872#true} assume !(0 != ~p4~0); {127872#true} is VALID [2018-11-23 12:42:54,322 INFO L273 TraceCheckUtils]: 11: Hoare triple {127872#true} assume !(0 != ~p5~0); {127872#true} is VALID [2018-11-23 12:42:54,322 INFO L273 TraceCheckUtils]: 12: Hoare triple {127872#true} assume !(0 != ~p6~0); {127872#true} is VALID [2018-11-23 12:42:54,322 INFO L273 TraceCheckUtils]: 13: Hoare triple {127872#true} assume !(0 != ~p7~0); {127872#true} is VALID [2018-11-23 12:42:54,322 INFO L273 TraceCheckUtils]: 14: Hoare triple {127872#true} assume !(0 != ~p8~0); {127874#(= main_~p8~0 0)} is VALID [2018-11-23 12:42:54,324 INFO L273 TraceCheckUtils]: 15: Hoare triple {127874#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {127874#(= main_~p8~0 0)} is VALID [2018-11-23 12:42:54,324 INFO L273 TraceCheckUtils]: 16: Hoare triple {127874#(= main_~p8~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {127874#(= main_~p8~0 0)} is VALID [2018-11-23 12:42:54,324 INFO L273 TraceCheckUtils]: 17: Hoare triple {127874#(= main_~p8~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {127874#(= main_~p8~0 0)} is VALID [2018-11-23 12:42:54,325 INFO L273 TraceCheckUtils]: 18: Hoare triple {127874#(= main_~p8~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {127874#(= main_~p8~0 0)} is VALID [2018-11-23 12:42:54,325 INFO L273 TraceCheckUtils]: 19: Hoare triple {127874#(= main_~p8~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {127874#(= main_~p8~0 0)} is VALID [2018-11-23 12:42:54,325 INFO L273 TraceCheckUtils]: 20: Hoare triple {127874#(= main_~p8~0 0)} assume !(0 != ~p1~0); {127874#(= main_~p8~0 0)} is VALID [2018-11-23 12:42:54,326 INFO L273 TraceCheckUtils]: 21: Hoare triple {127874#(= main_~p8~0 0)} assume !(0 != ~p2~0); {127874#(= main_~p8~0 0)} is VALID [2018-11-23 12:42:54,326 INFO L273 TraceCheckUtils]: 22: Hoare triple {127874#(= main_~p8~0 0)} assume !(0 != ~p3~0); {127874#(= main_~p8~0 0)} is VALID [2018-11-23 12:42:54,328 INFO L273 TraceCheckUtils]: 23: Hoare triple {127874#(= main_~p8~0 0)} assume !(0 != ~p4~0); {127874#(= main_~p8~0 0)} is VALID [2018-11-23 12:42:54,328 INFO L273 TraceCheckUtils]: 24: Hoare triple {127874#(= main_~p8~0 0)} assume !(0 != ~p5~0); {127874#(= main_~p8~0 0)} is VALID [2018-11-23 12:42:54,329 INFO L273 TraceCheckUtils]: 25: Hoare triple {127874#(= main_~p8~0 0)} assume !(0 != ~p6~0); {127874#(= main_~p8~0 0)} is VALID [2018-11-23 12:42:54,329 INFO L273 TraceCheckUtils]: 26: Hoare triple {127874#(= main_~p8~0 0)} assume !(0 != ~p7~0); {127874#(= main_~p8~0 0)} is VALID [2018-11-23 12:42:54,330 INFO L273 TraceCheckUtils]: 27: Hoare triple {127874#(= main_~p8~0 0)} assume 0 != ~p8~0; {127873#false} is VALID [2018-11-23 12:42:54,330 INFO L273 TraceCheckUtils]: 28: Hoare triple {127873#false} assume 1 != ~lk8~0; {127873#false} is VALID [2018-11-23 12:42:54,330 INFO L273 TraceCheckUtils]: 29: Hoare triple {127873#false} assume !false; {127873#false} is VALID [2018-11-23 12:42:54,331 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 12:42:54,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:54,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:54,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 12:42:54,331 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:54,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:54,354 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:54,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:54,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:54,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:54,355 INFO L87 Difference]: Start difference. First operand 4936 states and 7366 transitions. Second operand 3 states. [2018-11-23 12:43:05,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:05,769 INFO L93 Difference]: Finished difference Result 14412 states and 21320 transitions. [2018-11-23 12:43:05,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:05,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 12:43:05,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:05,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:05,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2018-11-23 12:43:05,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:05,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2018-11-23 12:43:05,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 225 transitions. [2018-11-23 12:43:06,015 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:10,402 INFO L225 Difference]: With dead ends: 14412 [2018-11-23 12:43:10,402 INFO L226 Difference]: Without dead ends: 9610 [2018-11-23 12:43:10,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:43:10,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9610 states. [2018-11-23 12:43:13,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9610 to 9608. [2018-11-23 12:43:13,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:13,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9610 states. Second operand 9608 states. [2018-11-23 12:43:13,474 INFO L74 IsIncluded]: Start isIncluded. First operand 9610 states. Second operand 9608 states. [2018-11-23 12:43:13,474 INFO L87 Difference]: Start difference. First operand 9610 states. Second operand 9608 states. [2018-11-23 12:43:16,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:16,886 INFO L93 Difference]: Finished difference Result 9610 states and 13959 transitions. [2018-11-23 12:43:16,887 INFO L276 IsEmpty]: Start isEmpty. Operand 9610 states and 13959 transitions. [2018-11-23 12:43:16,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:16,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:16,893 INFO L74 IsIncluded]: Start isIncluded. First operand 9608 states. Second operand 9610 states. [2018-11-23 12:43:16,893 INFO L87 Difference]: Start difference. First operand 9608 states. Second operand 9610 states. [2018-11-23 12:43:20,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:20,344 INFO L93 Difference]: Finished difference Result 9610 states and 13959 transitions. [2018-11-23 12:43:20,344 INFO L276 IsEmpty]: Start isEmpty. Operand 9610 states and 13959 transitions. [2018-11-23 12:43:20,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:20,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:20,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:20,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:20,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9608 states. [2018-11-23 12:43:24,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 13958 transitions. [2018-11-23 12:43:24,095 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 13958 transitions. Word has length 30 [2018-11-23 12:43:24,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:24,095 INFO L480 AbstractCegarLoop]: Abstraction has 9608 states and 13958 transitions. [2018-11-23 12:43:24,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:24,095 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 13958 transitions. [2018-11-23 12:43:24,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:43:24,098 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:24,099 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:43:24,099 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:24,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:24,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1338307805, now seen corresponding path program 1 times [2018-11-23 12:43:24,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:24,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:24,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:24,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:24,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:24,318 INFO L256 TraceCheckUtils]: 0: Hoare triple {171771#true} call ULTIMATE.init(); {171771#true} is VALID [2018-11-23 12:43:24,319 INFO L273 TraceCheckUtils]: 1: Hoare triple {171771#true} assume true; {171771#true} is VALID [2018-11-23 12:43:24,319 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {171771#true} {171771#true} #248#return; {171771#true} is VALID [2018-11-23 12:43:24,319 INFO L256 TraceCheckUtils]: 3: Hoare triple {171771#true} call #t~ret14 := main(); {171771#true} is VALID [2018-11-23 12:43:24,319 INFO L273 TraceCheckUtils]: 4: Hoare triple {171771#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {171771#true} is VALID [2018-11-23 12:43:24,320 INFO L273 TraceCheckUtils]: 5: Hoare triple {171771#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {171771#true} is VALID [2018-11-23 12:43:24,320 INFO L273 TraceCheckUtils]: 6: Hoare triple {171771#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {171771#true} is VALID [2018-11-23 12:43:24,320 INFO L273 TraceCheckUtils]: 7: Hoare triple {171771#true} assume !(0 != ~p1~0); {171771#true} is VALID [2018-11-23 12:43:24,320 INFO L273 TraceCheckUtils]: 8: Hoare triple {171771#true} assume !(0 != ~p2~0); {171771#true} is VALID [2018-11-23 12:43:24,320 INFO L273 TraceCheckUtils]: 9: Hoare triple {171771#true} assume !(0 != ~p3~0); {171771#true} is VALID [2018-11-23 12:43:24,320 INFO L273 TraceCheckUtils]: 10: Hoare triple {171771#true} assume !(0 != ~p4~0); {171771#true} is VALID [2018-11-23 12:43:24,321 INFO L273 TraceCheckUtils]: 11: Hoare triple {171771#true} assume !(0 != ~p5~0); {171771#true} is VALID [2018-11-23 12:43:24,321 INFO L273 TraceCheckUtils]: 12: Hoare triple {171771#true} assume !(0 != ~p6~0); {171771#true} is VALID [2018-11-23 12:43:24,321 INFO L273 TraceCheckUtils]: 13: Hoare triple {171771#true} assume !(0 != ~p7~0); {171771#true} is VALID [2018-11-23 12:43:24,333 INFO L273 TraceCheckUtils]: 14: Hoare triple {171771#true} assume 0 != ~p8~0;~lk8~0 := 1; {171773#(= main_~lk8~0 1)} is VALID [2018-11-23 12:43:24,347 INFO L273 TraceCheckUtils]: 15: Hoare triple {171773#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {171773#(= main_~lk8~0 1)} is VALID [2018-11-23 12:43:24,356 INFO L273 TraceCheckUtils]: 16: Hoare triple {171773#(= main_~lk8~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {171773#(= main_~lk8~0 1)} is VALID [2018-11-23 12:43:24,356 INFO L273 TraceCheckUtils]: 17: Hoare triple {171773#(= main_~lk8~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {171773#(= main_~lk8~0 1)} is VALID [2018-11-23 12:43:24,358 INFO L273 TraceCheckUtils]: 18: Hoare triple {171773#(= main_~lk8~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {171773#(= main_~lk8~0 1)} is VALID [2018-11-23 12:43:24,358 INFO L273 TraceCheckUtils]: 19: Hoare triple {171773#(= main_~lk8~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {171773#(= main_~lk8~0 1)} is VALID [2018-11-23 12:43:24,360 INFO L273 TraceCheckUtils]: 20: Hoare triple {171773#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {171773#(= main_~lk8~0 1)} is VALID [2018-11-23 12:43:24,360 INFO L273 TraceCheckUtils]: 21: Hoare triple {171773#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {171773#(= main_~lk8~0 1)} is VALID [2018-11-23 12:43:24,363 INFO L273 TraceCheckUtils]: 22: Hoare triple {171773#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {171773#(= main_~lk8~0 1)} is VALID [2018-11-23 12:43:24,363 INFO L273 TraceCheckUtils]: 23: Hoare triple {171773#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {171773#(= main_~lk8~0 1)} is VALID [2018-11-23 12:43:24,365 INFO L273 TraceCheckUtils]: 24: Hoare triple {171773#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {171773#(= main_~lk8~0 1)} is VALID [2018-11-23 12:43:24,365 INFO L273 TraceCheckUtils]: 25: Hoare triple {171773#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {171773#(= main_~lk8~0 1)} is VALID [2018-11-23 12:43:24,367 INFO L273 TraceCheckUtils]: 26: Hoare triple {171773#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {171773#(= main_~lk8~0 1)} is VALID [2018-11-23 12:43:24,367 INFO L273 TraceCheckUtils]: 27: Hoare triple {171773#(= main_~lk8~0 1)} assume 0 != ~p8~0; {171773#(= main_~lk8~0 1)} is VALID [2018-11-23 12:43:24,367 INFO L273 TraceCheckUtils]: 28: Hoare triple {171773#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {171772#false} is VALID [2018-11-23 12:43:24,367 INFO L273 TraceCheckUtils]: 29: Hoare triple {171772#false} assume !false; {171772#false} is VALID [2018-11-23 12:43:24,368 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 12:43:24,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:24,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:24,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 12:43:24,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:24,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:24,395 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:24,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:24,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:24,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:24,396 INFO L87 Difference]: Start difference. First operand 9608 states and 13958 transitions. Second operand 3 states. [2018-11-23 12:43:35,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:35,238 INFO L93 Difference]: Finished difference Result 11148 states and 16776 transitions. [2018-11-23 12:43:35,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:35,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 12:43:35,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:35,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:35,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2018-11-23 12:43:35,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:35,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2018-11-23 12:43:35,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 135 transitions. [2018-11-23 12:43:35,553 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:40,656 INFO L225 Difference]: With dead ends: 11148 [2018-11-23 12:43:40,656 INFO L226 Difference]: Without dead ends: 11146 [2018-11-23 12:43:40,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:43:40,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11146 states. [2018-11-23 12:43:43,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11146 to 9608. [2018-11-23 12:43:43,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:43,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11146 states. Second operand 9608 states. [2018-11-23 12:43:43,155 INFO L74 IsIncluded]: Start isIncluded. First operand 11146 states. Second operand 9608 states. [2018-11-23 12:43:43,155 INFO L87 Difference]: Start difference. First operand 11146 states. Second operand 9608 states. [2018-11-23 12:43:47,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:47,803 INFO L93 Difference]: Finished difference Result 11146 states and 16647 transitions. [2018-11-23 12:43:47,803 INFO L276 IsEmpty]: Start isEmpty. Operand 11146 states and 16647 transitions. [2018-11-23 12:43:47,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:47,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:47,812 INFO L74 IsIncluded]: Start isIncluded. First operand 9608 states. Second operand 11146 states. [2018-11-23 12:43:47,812 INFO L87 Difference]: Start difference. First operand 9608 states. Second operand 11146 states. [2018-11-23 12:43:52,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:52,462 INFO L93 Difference]: Finished difference Result 11146 states and 16647 transitions. [2018-11-23 12:43:52,462 INFO L276 IsEmpty]: Start isEmpty. Operand 11146 states and 16647 transitions. [2018-11-23 12:43:52,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:52,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:52,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:52,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:52,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9608 states. [2018-11-23 12:43:56,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 13830 transitions. [2018-11-23 12:43:56,357 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 13830 transitions. Word has length 30 [2018-11-23 12:43:56,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:56,357 INFO L480 AbstractCegarLoop]: Abstraction has 9608 states and 13830 transitions. [2018-11-23 12:43:56,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:56,357 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 13830 transitions. [2018-11-23 12:43:56,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:43:56,361 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:56,361 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:43:56,361 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:56,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:56,361 INFO L82 PathProgramCache]: Analyzing trace with hash -126002102, now seen corresponding path program 1 times [2018-11-23 12:43:56,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:56,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:56,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:56,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:56,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:56,433 INFO L256 TraceCheckUtils]: 0: Hoare triple {215478#true} call ULTIMATE.init(); {215478#true} is VALID [2018-11-23 12:43:56,433 INFO L273 TraceCheckUtils]: 1: Hoare triple {215478#true} assume true; {215478#true} is VALID [2018-11-23 12:43:56,433 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {215478#true} {215478#true} #248#return; {215478#true} is VALID [2018-11-23 12:43:56,433 INFO L256 TraceCheckUtils]: 3: Hoare triple {215478#true} call #t~ret14 := main(); {215478#true} is VALID [2018-11-23 12:43:56,434 INFO L273 TraceCheckUtils]: 4: Hoare triple {215478#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {215478#true} is VALID [2018-11-23 12:43:56,434 INFO L273 TraceCheckUtils]: 5: Hoare triple {215478#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {215478#true} is VALID [2018-11-23 12:43:56,434 INFO L273 TraceCheckUtils]: 6: Hoare triple {215478#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {215478#true} is VALID [2018-11-23 12:43:56,434 INFO L273 TraceCheckUtils]: 7: Hoare triple {215478#true} assume !(0 != ~p1~0); {215478#true} is VALID [2018-11-23 12:43:56,434 INFO L273 TraceCheckUtils]: 8: Hoare triple {215478#true} assume !(0 != ~p2~0); {215478#true} is VALID [2018-11-23 12:43:56,434 INFO L273 TraceCheckUtils]: 9: Hoare triple {215478#true} assume !(0 != ~p3~0); {215478#true} is VALID [2018-11-23 12:43:56,434 INFO L273 TraceCheckUtils]: 10: Hoare triple {215478#true} assume !(0 != ~p4~0); {215478#true} is VALID [2018-11-23 12:43:56,435 INFO L273 TraceCheckUtils]: 11: Hoare triple {215478#true} assume !(0 != ~p5~0); {215478#true} is VALID [2018-11-23 12:43:56,435 INFO L273 TraceCheckUtils]: 12: Hoare triple {215478#true} assume !(0 != ~p6~0); {215478#true} is VALID [2018-11-23 12:43:56,435 INFO L273 TraceCheckUtils]: 13: Hoare triple {215478#true} assume !(0 != ~p7~0); {215478#true} is VALID [2018-11-23 12:43:56,435 INFO L273 TraceCheckUtils]: 14: Hoare triple {215478#true} assume !(0 != ~p8~0); {215478#true} is VALID [2018-11-23 12:43:56,436 INFO L273 TraceCheckUtils]: 15: Hoare triple {215478#true} assume 0 != ~p9~0;~lk9~0 := 1; {215480#(= main_~lk9~0 1)} is VALID [2018-11-23 12:43:56,436 INFO L273 TraceCheckUtils]: 16: Hoare triple {215480#(= main_~lk9~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {215480#(= main_~lk9~0 1)} is VALID [2018-11-23 12:43:56,438 INFO L273 TraceCheckUtils]: 17: Hoare triple {215480#(= main_~lk9~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {215480#(= main_~lk9~0 1)} is VALID [2018-11-23 12:43:56,438 INFO L273 TraceCheckUtils]: 18: Hoare triple {215480#(= main_~lk9~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {215480#(= main_~lk9~0 1)} is VALID [2018-11-23 12:43:56,440 INFO L273 TraceCheckUtils]: 19: Hoare triple {215480#(= main_~lk9~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {215480#(= main_~lk9~0 1)} is VALID [2018-11-23 12:43:56,440 INFO L273 TraceCheckUtils]: 20: Hoare triple {215480#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {215480#(= main_~lk9~0 1)} is VALID [2018-11-23 12:43:56,441 INFO L273 TraceCheckUtils]: 21: Hoare triple {215480#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {215480#(= main_~lk9~0 1)} is VALID [2018-11-23 12:43:56,441 INFO L273 TraceCheckUtils]: 22: Hoare triple {215480#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {215480#(= main_~lk9~0 1)} is VALID [2018-11-23 12:43:56,441 INFO L273 TraceCheckUtils]: 23: Hoare triple {215480#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {215480#(= main_~lk9~0 1)} is VALID [2018-11-23 12:43:56,442 INFO L273 TraceCheckUtils]: 24: Hoare triple {215480#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {215480#(= main_~lk9~0 1)} is VALID [2018-11-23 12:43:56,442 INFO L273 TraceCheckUtils]: 25: Hoare triple {215480#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {215480#(= main_~lk9~0 1)} is VALID [2018-11-23 12:43:56,442 INFO L273 TraceCheckUtils]: 26: Hoare triple {215480#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {215480#(= main_~lk9~0 1)} is VALID [2018-11-23 12:43:56,444 INFO L273 TraceCheckUtils]: 27: Hoare triple {215480#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {215480#(= main_~lk9~0 1)} is VALID [2018-11-23 12:43:56,444 INFO L273 TraceCheckUtils]: 28: Hoare triple {215480#(= main_~lk9~0 1)} assume 0 != ~p9~0; {215480#(= main_~lk9~0 1)} is VALID [2018-11-23 12:43:56,449 INFO L273 TraceCheckUtils]: 29: Hoare triple {215480#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {215479#false} is VALID [2018-11-23 12:43:56,449 INFO L273 TraceCheckUtils]: 30: Hoare triple {215479#false} assume !false; {215479#false} is VALID [2018-11-23 12:43:56,449 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 12:43:56,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:56,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:56,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 12:43:56,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:56,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:56,585 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:56,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:56,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:56,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:56,586 INFO L87 Difference]: Start difference. First operand 9608 states and 13830 transitions. Second operand 3 states. [2018-11-23 12:44:16,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:44:16,468 INFO L93 Difference]: Finished difference Result 16780 states and 24712 transitions. [2018-11-23 12:44:16,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:44:16,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 12:44:16,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:44:16,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:44:16,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2018-11-23 12:44:16,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:44:16,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2018-11-23 12:44:16,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 134 transitions. [2018-11-23 12:44:16,661 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:44:29,273 INFO L225 Difference]: With dead ends: 16780 [2018-11-23 12:44:29,273 INFO L226 Difference]: Without dead ends: 16778 [2018-11-23 12:44:29,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:44:29,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16778 states. [2018-11-23 12:44:34,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16778 to 14216. [2018-11-23 12:44:34,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:44:34,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16778 states. Second operand 14216 states. [2018-11-23 12:44:34,118 INFO L74 IsIncluded]: Start isIncluded. First operand 16778 states. Second operand 14216 states. [2018-11-23 12:44:34,118 INFO L87 Difference]: Start difference. First operand 16778 states. Second operand 14216 states. [2018-11-23 12:44:46,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:44:46,749 INFO L93 Difference]: Finished difference Result 16778 states and 24455 transitions. [2018-11-23 12:44:46,749 INFO L276 IsEmpty]: Start isEmpty. Operand 16778 states and 24455 transitions. [2018-11-23 12:44:46,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:44:46,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:44:46,760 INFO L74 IsIncluded]: Start isIncluded. First operand 14216 states. Second operand 16778 states. [2018-11-23 12:44:46,760 INFO L87 Difference]: Start difference. First operand 14216 states. Second operand 16778 states. [2018-11-23 12:45:00,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:45:00,536 INFO L93 Difference]: Finished difference Result 16778 states and 24455 transitions. [2018-11-23 12:45:00,536 INFO L276 IsEmpty]: Start isEmpty. Operand 16778 states and 24455 transitions. [2018-11-23 12:45:00,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:45:00,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:45:00,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:45:00,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:45:00,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2018-11-23 12:45:10,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 19846 transitions. [2018-11-23 12:45:10,539 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 19846 transitions. Word has length 31 [2018-11-23 12:45:10,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:45:10,539 INFO L480 AbstractCegarLoop]: Abstraction has 14216 states and 19846 transitions. [2018-11-23 12:45:10,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:45:10,539 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 19846 transitions. [2018-11-23 12:45:10,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:45:10,545 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:45:10,546 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:45:10,546 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:45:10,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:45:10,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1147070456, now seen corresponding path program 1 times [2018-11-23 12:45:10,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:45:10,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:45:10,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:45:10,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:45:10,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:45:10,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:45:10,593 INFO L256 TraceCheckUtils]: 0: Hoare triple {280817#true} call ULTIMATE.init(); {280817#true} is VALID [2018-11-23 12:45:10,593 INFO L273 TraceCheckUtils]: 1: Hoare triple {280817#true} assume true; {280817#true} is VALID [2018-11-23 12:45:10,593 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {280817#true} {280817#true} #248#return; {280817#true} is VALID [2018-11-23 12:45:10,593 INFO L256 TraceCheckUtils]: 3: Hoare triple {280817#true} call #t~ret14 := main(); {280817#true} is VALID [2018-11-23 12:45:10,593 INFO L273 TraceCheckUtils]: 4: Hoare triple {280817#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {280817#true} is VALID [2018-11-23 12:45:10,594 INFO L273 TraceCheckUtils]: 5: Hoare triple {280817#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {280817#true} is VALID [2018-11-23 12:45:10,594 INFO L273 TraceCheckUtils]: 6: Hoare triple {280817#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {280817#true} is VALID [2018-11-23 12:45:10,594 INFO L273 TraceCheckUtils]: 7: Hoare triple {280817#true} assume !(0 != ~p1~0); {280817#true} is VALID [2018-11-23 12:45:10,594 INFO L273 TraceCheckUtils]: 8: Hoare triple {280817#true} assume !(0 != ~p2~0); {280817#true} is VALID [2018-11-23 12:45:10,594 INFO L273 TraceCheckUtils]: 9: Hoare triple {280817#true} assume !(0 != ~p3~0); {280817#true} is VALID [2018-11-23 12:45:10,594 INFO L273 TraceCheckUtils]: 10: Hoare triple {280817#true} assume !(0 != ~p4~0); {280817#true} is VALID [2018-11-23 12:45:10,594 INFO L273 TraceCheckUtils]: 11: Hoare triple {280817#true} assume !(0 != ~p5~0); {280817#true} is VALID [2018-11-23 12:45:10,595 INFO L273 TraceCheckUtils]: 12: Hoare triple {280817#true} assume !(0 != ~p6~0); {280817#true} is VALID [2018-11-23 12:45:10,595 INFO L273 TraceCheckUtils]: 13: Hoare triple {280817#true} assume !(0 != ~p7~0); {280817#true} is VALID [2018-11-23 12:45:10,595 INFO L273 TraceCheckUtils]: 14: Hoare triple {280817#true} assume !(0 != ~p8~0); {280817#true} is VALID [2018-11-23 12:45:10,596 INFO L273 TraceCheckUtils]: 15: Hoare triple {280817#true} assume !(0 != ~p9~0); {280819#(= main_~p9~0 0)} is VALID [2018-11-23 12:45:10,597 INFO L273 TraceCheckUtils]: 16: Hoare triple {280819#(= main_~p9~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {280819#(= main_~p9~0 0)} is VALID [2018-11-23 12:45:10,602 INFO L273 TraceCheckUtils]: 17: Hoare triple {280819#(= main_~p9~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {280819#(= main_~p9~0 0)} is VALID [2018-11-23 12:45:10,620 INFO L273 TraceCheckUtils]: 18: Hoare triple {280819#(= main_~p9~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {280819#(= main_~p9~0 0)} is VALID [2018-11-23 12:45:10,626 INFO L273 TraceCheckUtils]: 19: Hoare triple {280819#(= main_~p9~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {280819#(= main_~p9~0 0)} is VALID [2018-11-23 12:45:10,629 INFO L273 TraceCheckUtils]: 20: Hoare triple {280819#(= main_~p9~0 0)} assume !(0 != ~p1~0); {280819#(= main_~p9~0 0)} is VALID [2018-11-23 12:45:10,629 INFO L273 TraceCheckUtils]: 21: Hoare triple {280819#(= main_~p9~0 0)} assume !(0 != ~p2~0); {280819#(= main_~p9~0 0)} is VALID [2018-11-23 12:45:10,631 INFO L273 TraceCheckUtils]: 22: Hoare triple {280819#(= main_~p9~0 0)} assume !(0 != ~p3~0); {280819#(= main_~p9~0 0)} is VALID [2018-11-23 12:45:10,631 INFO L273 TraceCheckUtils]: 23: Hoare triple {280819#(= main_~p9~0 0)} assume !(0 != ~p4~0); {280819#(= main_~p9~0 0)} is VALID [2018-11-23 12:45:10,631 INFO L273 TraceCheckUtils]: 24: Hoare triple {280819#(= main_~p9~0 0)} assume !(0 != ~p5~0); {280819#(= main_~p9~0 0)} is VALID [2018-11-23 12:45:10,632 INFO L273 TraceCheckUtils]: 25: Hoare triple {280819#(= main_~p9~0 0)} assume !(0 != ~p6~0); {280819#(= main_~p9~0 0)} is VALID [2018-11-23 12:45:10,632 INFO L273 TraceCheckUtils]: 26: Hoare triple {280819#(= main_~p9~0 0)} assume !(0 != ~p7~0); {280819#(= main_~p9~0 0)} is VALID [2018-11-23 12:45:10,632 INFO L273 TraceCheckUtils]: 27: Hoare triple {280819#(= main_~p9~0 0)} assume !(0 != ~p8~0); {280819#(= main_~p9~0 0)} is VALID [2018-11-23 12:45:10,633 INFO L273 TraceCheckUtils]: 28: Hoare triple {280819#(= main_~p9~0 0)} assume 0 != ~p9~0; {280818#false} is VALID [2018-11-23 12:45:10,633 INFO L273 TraceCheckUtils]: 29: Hoare triple {280818#false} assume 1 != ~lk9~0; {280818#false} is VALID [2018-11-23 12:45:10,633 INFO L273 TraceCheckUtils]: 30: Hoare triple {280818#false} assume !false; {280818#false} is VALID [2018-11-23 12:45:10,633 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 12:45:10,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:45:10,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:45:10,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 12:45:10,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:45:10,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:45:10,658 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:45:10,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:45:10,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:45:10,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:45:10,659 INFO L87 Difference]: Start difference. First operand 14216 states and 19846 transitions. Second operand 3 states.