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/ssh-simplified/s3_srvr_1b_true-unreach-call_false-termination.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:39:40,900 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:39:40,902 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:39:40,915 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:39:40,916 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:39:40,916 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:39:40,918 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:39:40,919 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:39:40,921 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:39:40,922 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:39:40,923 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:39:40,923 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:39:40,924 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:39:40,925 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:39:40,926 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:39:40,927 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:39:40,928 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:39:40,930 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:39:40,932 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:39:40,939 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:39:40,940 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:39:40,941 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:39:40,949 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:39:40,949 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:39:40,949 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:39:40,950 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:39:40,951 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:39:40,952 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:39:40,953 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:39:40,954 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:39:40,954 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:39:40,954 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:39:40,955 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:39:40,955 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:39:40,956 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:39:40,956 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:39:40,957 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:39:40,986 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:39:40,986 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:39:40,988 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:39:40,988 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:39:40,988 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:39:40,989 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:39:40,989 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:39:40,990 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:39:40,990 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:39:40,990 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:39:40,990 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:39:40,990 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:39:40,990 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:39:40,991 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:39:40,991 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:39:40,991 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:39:40,991 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:39:40,991 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:39:40,993 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:39:40,993 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:39:40,993 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:39:40,993 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:39:40,994 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:39:40,994 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:39:40,994 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:39:40,995 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:39:40,995 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:39:40,995 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:39:40,995 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:39:40,995 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:39:40,995 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:39:41,054 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:39:41,071 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:39:41,075 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:39:41,077 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:39:41,077 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:39:41,078 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_1b_true-unreach-call_false-termination.cil.c [2018-11-23 12:39:41,141 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/549948999/c1680f9776324971bb083733c4422d80/FLAGee0edf0e1 [2018-11-23 12:39:41,617 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:39:41,618 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_1b_true-unreach-call_false-termination.cil.c [2018-11-23 12:39:41,626 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/549948999/c1680f9776324971bb083733c4422d80/FLAGee0edf0e1 [2018-11-23 12:39:41,983 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/549948999/c1680f9776324971bb083733c4422d80 [2018-11-23 12:39:41,995 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:39:41,997 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:39:41,998 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:39:41,998 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:39:42,001 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:39:42,003 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:39:41" (1/1) ... [2018-11-23 12:39:42,006 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75e12a6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:42, skipping insertion in model container [2018-11-23 12:39:42,006 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:39:41" (1/1) ... [2018-11-23 12:39:42,016 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:39:42,049 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:39:42,296 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:39:42,301 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:39:42,334 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:39:42,351 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:39:42,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:42 WrapperNode [2018-11-23 12:39:42,352 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:39:42,353 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:39:42,353 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:39:42,353 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:39:42,362 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:39:42" (1/1) ... [2018-11-23 12:39:42,368 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:39:42" (1/1) ... [2018-11-23 12:39:42,373 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:39:42,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:39:42,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:39:42,374 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:39:42,382 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:42" (1/1) ... [2018-11-23 12:39:42,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:42" (1/1) ... [2018-11-23 12:39:42,383 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:42" (1/1) ... [2018-11-23 12:39:42,383 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:42" (1/1) ... [2018-11-23 12:39:42,388 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:42" (1/1) ... [2018-11-23 12:39:42,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:42" (1/1) ... [2018-11-23 12:39:42,396 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:42" (1/1) ... [2018-11-23 12:39:42,397 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:39:42,398 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:39:42,398 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:39:42,398 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:39:42,399 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:42" (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:39:42,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:39:42,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:39:42,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:39:42,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:39:42,527 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:39:42,527 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:39:43,080 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:39:43,080 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 12:39:43,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:39:43 BoogieIcfgContainer [2018-11-23 12:39:43,081 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:39:43,082 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:39:43,082 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:39:43,085 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:39:43,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:39:41" (1/3) ... [2018-11-23 12:39:43,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15f863cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:39:43, skipping insertion in model container [2018-11-23 12:39:43,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:42" (2/3) ... [2018-11-23 12:39:43,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15f863cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:39:43, skipping insertion in model container [2018-11-23 12:39:43,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:39:43" (3/3) ... [2018-11-23 12:39:43,089 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1b_true-unreach-call_false-termination.cil.c [2018-11-23 12:39:43,099 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:39:43,106 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:39:43,120 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:39:43,152 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:39:43,153 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:39:43,153 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:39:43,153 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:39:43,153 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:39:43,154 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:39:43,154 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:39:43,154 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:39:43,154 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:39:43,172 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-23 12:39:43,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 12:39:43,178 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:39:43,179 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:39:43,181 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:39:43,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:39:43,187 INFO L82 PathProgramCache]: Analyzing trace with hash -2134687016, now seen corresponding path program 1 times [2018-11-23 12:39:43,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:39:43,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:39:43,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:39:43,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:39:43,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:39:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:39:43,355 INFO L256 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {31#true} is VALID [2018-11-23 12:39:43,359 INFO L273 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2018-11-23 12:39:43,360 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #105#return; {31#true} is VALID [2018-11-23 12:39:43,361 INFO L256 TraceCheckUtils]: 3: Hoare triple {31#true} call #t~ret2 := main(); {31#true} is VALID [2018-11-23 12:39:43,363 INFO L273 TraceCheckUtils]: 4: Hoare triple {31#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~s__hit~0 := #t~nondet0;havoc #t~nondet0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {33#(<= main_~blastFlag~0 0)} is VALID [2018-11-23 12:39:43,363 INFO L273 TraceCheckUtils]: 5: Hoare triple {33#(<= main_~blastFlag~0 0)} assume !false; {33#(<= main_~blastFlag~0 0)} is VALID [2018-11-23 12:39:43,364 INFO L273 TraceCheckUtils]: 6: Hoare triple {33#(<= main_~blastFlag~0 0)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {32#false} is VALID [2018-11-23 12:39:43,365 INFO L273 TraceCheckUtils]: 7: Hoare triple {32#false} assume !false; {32#false} is VALID [2018-11-23 12:39:43,367 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:39:43,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:39:43,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:39:43,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-23 12:39:43,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:39:43,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:39:43,435 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:39:43,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:39:43,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:39:43,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:39:43,449 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. [2018-11-23 12:39:43,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:39:43,977 INFO L93 Difference]: Finished difference Result 70 states and 116 transitions. [2018-11-23 12:39:43,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:39:43,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-23 12:39:43,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:39:43,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:39:43,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2018-11-23 12:39:43,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:39:43,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2018-11-23 12:39:43,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 116 transitions. [2018-11-23 12:39:44,492 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:39:44,511 INFO L225 Difference]: With dead ends: 70 [2018-11-23 12:39:44,514 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 12:39:44,518 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:39:44,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 12:39:44,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-23 12:39:44,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:39:44,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 39 states. [2018-11-23 12:39:44,612 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-23 12:39:44,613 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-23 12:39:44,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:39:44,618 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-11-23 12:39:44,619 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2018-11-23 12:39:44,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:39:44,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:39:44,620 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-23 12:39:44,620 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-23 12:39:44,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:39:44,625 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-11-23 12:39:44,626 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2018-11-23 12:39:44,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:39:44,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:39:44,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:39:44,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:39:44,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:39:44,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2018-11-23 12:39:44,633 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 8 [2018-11-23 12:39:44,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:39:44,633 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2018-11-23 12:39:44,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:39:44,634 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2018-11-23 12:39:44,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:39:44,635 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:39:44,635 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:39:44,635 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:39:44,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:39:44,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1966827798, now seen corresponding path program 1 times [2018-11-23 12:39:44,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:39:44,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:39:44,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:39:44,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:39:44,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:39:44,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:39:44,698 INFO L256 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {262#true} is VALID [2018-11-23 12:39:44,698 INFO L273 TraceCheckUtils]: 1: Hoare triple {262#true} assume true; {262#true} is VALID [2018-11-23 12:39:44,698 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {262#true} {262#true} #105#return; {262#true} is VALID [2018-11-23 12:39:44,699 INFO L256 TraceCheckUtils]: 3: Hoare triple {262#true} call #t~ret2 := main(); {262#true} is VALID [2018-11-23 12:39:44,699 INFO L273 TraceCheckUtils]: 4: Hoare triple {262#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~s__hit~0 := #t~nondet0;havoc #t~nondet0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {262#true} is VALID [2018-11-23 12:39:44,699 INFO L273 TraceCheckUtils]: 5: Hoare triple {262#true} assume !false; {262#true} is VALID [2018-11-23 12:39:44,700 INFO L273 TraceCheckUtils]: 6: Hoare triple {262#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {262#true} is VALID [2018-11-23 12:39:44,700 INFO L273 TraceCheckUtils]: 7: Hoare triple {262#true} assume 8466 == ~s__state~0; {262#true} is VALID [2018-11-23 12:39:44,700 INFO L273 TraceCheckUtils]: 8: Hoare triple {262#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 2; {262#true} is VALID [2018-11-23 12:39:44,701 INFO L273 TraceCheckUtils]: 9: Hoare triple {262#true} assume 0 != ~s__hit~0;~s__state~0 := 8656; {264#(<= 8656 main_~s__state~0)} is VALID [2018-11-23 12:39:44,702 INFO L273 TraceCheckUtils]: 10: Hoare triple {264#(<= 8656 main_~s__state~0)} assume !false; {264#(<= 8656 main_~s__state~0)} is VALID [2018-11-23 12:39:44,705 INFO L273 TraceCheckUtils]: 11: Hoare triple {264#(<= 8656 main_~s__state~0)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {263#false} is VALID [2018-11-23 12:39:44,705 INFO L273 TraceCheckUtils]: 12: Hoare triple {263#false} assume !false; {263#false} is VALID [2018-11-23 12:39:44,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:39:44,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:39:44,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:39:44,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 12:39:44,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:39:44,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:39:44,762 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:39:44,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:39:44,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:39:44,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:39:44,764 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand 3 states. [2018-11-23 12:39:45,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:39:45,017 INFO L93 Difference]: Finished difference Result 87 states and 125 transitions. [2018-11-23 12:39:45,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:39:45,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 12:39:45,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:39:45,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:39:45,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2018-11-23 12:39:45,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:39:45,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2018-11-23 12:39:45,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 72 transitions. [2018-11-23 12:39:45,186 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:39:45,190 INFO L225 Difference]: With dead ends: 87 [2018-11-23 12:39:45,190 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 12:39:45,191 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:39:45,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 12:39:45,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2018-11-23 12:39:45,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:39:45,237 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 49 states. [2018-11-23 12:39:45,237 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 49 states. [2018-11-23 12:39:45,238 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 49 states. [2018-11-23 12:39:45,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:39:45,242 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2018-11-23 12:39:45,242 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2018-11-23 12:39:45,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:39:45,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:39:45,244 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 53 states. [2018-11-23 12:39:45,244 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 53 states. [2018-11-23 12:39:45,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:39:45,248 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2018-11-23 12:39:45,248 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2018-11-23 12:39:45,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:39:45,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:39:45,249 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:39:45,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:39:45,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:39:45,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2018-11-23 12:39:45,253 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 13 [2018-11-23 12:39:45,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:39:45,253 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2018-11-23 12:39:45,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:39:45,254 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2018-11-23 12:39:45,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:39:45,254 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:39:45,255 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:39:45,255 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:39:45,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:39:45,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1966887380, now seen corresponding path program 1 times [2018-11-23 12:39:45,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:39:45,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:39:45,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:39:45,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:39:45,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:39:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:39:45,337 INFO L256 TraceCheckUtils]: 0: Hoare triple {555#true} call ULTIMATE.init(); {555#true} is VALID [2018-11-23 12:39:45,337 INFO L273 TraceCheckUtils]: 1: Hoare triple {555#true} assume true; {555#true} is VALID [2018-11-23 12:39:45,338 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {555#true} {555#true} #105#return; {555#true} is VALID [2018-11-23 12:39:45,338 INFO L256 TraceCheckUtils]: 3: Hoare triple {555#true} call #t~ret2 := main(); {555#true} is VALID [2018-11-23 12:39:45,338 INFO L273 TraceCheckUtils]: 4: Hoare triple {555#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~s__hit~0 := #t~nondet0;havoc #t~nondet0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {555#true} is VALID [2018-11-23 12:39:45,339 INFO L273 TraceCheckUtils]: 5: Hoare triple {555#true} assume !false; {555#true} is VALID [2018-11-23 12:39:45,339 INFO L273 TraceCheckUtils]: 6: Hoare triple {555#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {555#true} is VALID [2018-11-23 12:39:45,339 INFO L273 TraceCheckUtils]: 7: Hoare triple {555#true} assume 8466 == ~s__state~0; {555#true} is VALID [2018-11-23 12:39:45,341 INFO L273 TraceCheckUtils]: 8: Hoare triple {555#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 2; {557#(<= main_~blastFlag~0 2)} is VALID [2018-11-23 12:39:45,343 INFO L273 TraceCheckUtils]: 9: Hoare triple {557#(<= main_~blastFlag~0 2)} assume !(0 != ~s__hit~0);~s__state~0 := 8512; {557#(<= main_~blastFlag~0 2)} is VALID [2018-11-23 12:39:45,343 INFO L273 TraceCheckUtils]: 10: Hoare triple {557#(<= main_~blastFlag~0 2)} assume !false; {557#(<= main_~blastFlag~0 2)} is VALID [2018-11-23 12:39:45,345 INFO L273 TraceCheckUtils]: 11: Hoare triple {557#(<= main_~blastFlag~0 2)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {556#false} is VALID [2018-11-23 12:39:45,345 INFO L273 TraceCheckUtils]: 12: Hoare triple {556#false} assume !false; {556#false} is VALID [2018-11-23 12:39:45,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:39:45,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:39:45,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:39:45,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 12:39:45,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:39:45,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:39:45,375 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:39:45,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:39:45,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:39:45,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:39:45,376 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. Second operand 3 states. [2018-11-23 12:39:45,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:39:45,711 INFO L93 Difference]: Finished difference Result 93 states and 130 transitions. [2018-11-23 12:39:45,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:39:45,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 12:39:45,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:39:45,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:39:45,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2018-11-23 12:39:45,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:39:45,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2018-11-23 12:39:45,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 88 transitions. [2018-11-23 12:39:45,869 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:39:45,873 INFO L225 Difference]: With dead ends: 93 [2018-11-23 12:39:45,873 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 12:39:45,874 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:39:45,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 12:39:45,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-11-23 12:39:45,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:39:45,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 70 states. [2018-11-23 12:39:45,940 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2018-11-23 12:39:45,940 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2018-11-23 12:39:45,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:39:45,946 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2018-11-23 12:39:45,946 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 93 transitions. [2018-11-23 12:39:45,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:39:45,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:39:45,947 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2018-11-23 12:39:45,947 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2018-11-23 12:39:45,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:39:45,952 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2018-11-23 12:39:45,952 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 93 transitions. [2018-11-23 12:39:45,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:39:45,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:39:45,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:39:45,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:39:45,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 12:39:45,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 93 transitions. [2018-11-23 12:39:45,958 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 93 transitions. Word has length 13 [2018-11-23 12:39:45,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:39:45,958 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 93 transitions. [2018-11-23 12:39:45,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:39:45,959 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 93 transitions. [2018-11-23 12:39:45,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:39:45,960 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:39:45,960 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:39:45,960 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:39:45,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:39:45,961 INFO L82 PathProgramCache]: Analyzing trace with hash 280007728, now seen corresponding path program 1 times [2018-11-23 12:39:45,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:39:45,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:39:45,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:39:45,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:39:45,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:39:45,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:39:46,011 INFO L256 TraceCheckUtils]: 0: Hoare triple {916#true} call ULTIMATE.init(); {916#true} is VALID [2018-11-23 12:39:46,011 INFO L273 TraceCheckUtils]: 1: Hoare triple {916#true} assume true; {916#true} is VALID [2018-11-23 12:39:46,012 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {916#true} {916#true} #105#return; {916#true} is VALID [2018-11-23 12:39:46,012 INFO L256 TraceCheckUtils]: 3: Hoare triple {916#true} call #t~ret2 := main(); {916#true} is VALID [2018-11-23 12:39:46,013 INFO L273 TraceCheckUtils]: 4: Hoare triple {916#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~s__hit~0 := #t~nondet0;havoc #t~nondet0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {916#true} is VALID [2018-11-23 12:39:46,013 INFO L273 TraceCheckUtils]: 5: Hoare triple {916#true} assume !false; {916#true} is VALID [2018-11-23 12:39:46,013 INFO L273 TraceCheckUtils]: 6: Hoare triple {916#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {916#true} is VALID [2018-11-23 12:39:46,013 INFO L273 TraceCheckUtils]: 7: Hoare triple {916#true} assume 8466 == ~s__state~0; {916#true} is VALID [2018-11-23 12:39:46,014 INFO L273 TraceCheckUtils]: 8: Hoare triple {916#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 2; {916#true} is VALID [2018-11-23 12:39:46,014 INFO L273 TraceCheckUtils]: 9: Hoare triple {916#true} assume 0 != ~s__hit~0;~s__state~0 := 8656; {916#true} is VALID [2018-11-23 12:39:46,014 INFO L273 TraceCheckUtils]: 10: Hoare triple {916#true} assume !false; {916#true} is VALID [2018-11-23 12:39:46,014 INFO L273 TraceCheckUtils]: 11: Hoare triple {916#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {916#true} is VALID [2018-11-23 12:39:46,015 INFO L273 TraceCheckUtils]: 12: Hoare triple {916#true} assume !(8466 == ~s__state~0); {916#true} is VALID [2018-11-23 12:39:46,015 INFO L273 TraceCheckUtils]: 13: Hoare triple {916#true} assume !(8512 == ~s__state~0); {916#true} is VALID [2018-11-23 12:39:46,015 INFO L273 TraceCheckUtils]: 14: Hoare triple {916#true} assume !(8640 == ~s__state~0); {916#true} is VALID [2018-11-23 12:39:46,015 INFO L273 TraceCheckUtils]: 15: Hoare triple {916#true} assume 8656 == ~s__state~0; {916#true} is VALID [2018-11-23 12:39:46,017 INFO L273 TraceCheckUtils]: 16: Hoare triple {916#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {918#(<= main_~blastFlag~0 3)} is VALID [2018-11-23 12:39:46,024 INFO L273 TraceCheckUtils]: 17: Hoare triple {918#(<= main_~blastFlag~0 3)} assume !(4 == ~blastFlag~0); {918#(<= main_~blastFlag~0 3)} is VALID [2018-11-23 12:39:46,026 INFO L273 TraceCheckUtils]: 18: Hoare triple {918#(<= main_~blastFlag~0 3)} assume 5 == ~blastFlag~0; {917#false} is VALID [2018-11-23 12:39:46,026 INFO L273 TraceCheckUtils]: 19: Hoare triple {917#false} assume !false; {917#false} is VALID [2018-11-23 12:39:46,027 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 12:39:46,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:39:46,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:39:46,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 12:39:46,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:39:46,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:39:46,064 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:39:46,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:39:46,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:39:46,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:39:46,065 INFO L87 Difference]: Start difference. First operand 70 states and 93 transitions. Second operand 3 states. [2018-11-23 12:39:46,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:39:46,281 INFO L93 Difference]: Finished difference Result 137 states and 187 transitions. [2018-11-23 12:39:46,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:39:46,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 12:39:46,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:39:46,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:39:46,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2018-11-23 12:39:46,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:39:46,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2018-11-23 12:39:46,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 89 transitions. [2018-11-23 12:39:46,421 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:39:46,424 INFO L225 Difference]: With dead ends: 137 [2018-11-23 12:39:46,425 INFO L226 Difference]: Without dead ends: 93 [2018-11-23 12:39:46,426 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:39:46,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-23 12:39:46,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-11-23 12:39:46,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:39:46,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 91 states. [2018-11-23 12:39:46,532 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 91 states. [2018-11-23 12:39:46,532 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 91 states. [2018-11-23 12:39:46,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:39:46,537 INFO L93 Difference]: Finished difference Result 93 states and 124 transitions. [2018-11-23 12:39:46,537 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2018-11-23 12:39:46,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:39:46,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:39:46,538 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 93 states. [2018-11-23 12:39:46,539 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 93 states. [2018-11-23 12:39:46,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:39:46,543 INFO L93 Difference]: Finished difference Result 93 states and 124 transitions. [2018-11-23 12:39:46,544 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2018-11-23 12:39:46,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:39:46,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:39:46,545 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:39:46,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:39:46,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-23 12:39:46,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 123 transitions. [2018-11-23 12:39:46,550 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 123 transitions. Word has length 20 [2018-11-23 12:39:46,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:39:46,550 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 123 transitions. [2018-11-23 12:39:46,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:39:46,550 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 123 transitions. [2018-11-23 12:39:46,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:39:46,551 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:39:46,552 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:39:46,552 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:39:46,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:39:46,552 INFO L82 PathProgramCache]: Analyzing trace with hash 885328029, now seen corresponding path program 1 times [2018-11-23 12:39:46,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:39:46,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:39:46,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:39:46,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:39:46,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:39:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:39:46,632 INFO L256 TraceCheckUtils]: 0: Hoare triple {1407#true} call ULTIMATE.init(); {1407#true} is VALID [2018-11-23 12:39:46,632 INFO L273 TraceCheckUtils]: 1: Hoare triple {1407#true} assume true; {1407#true} is VALID [2018-11-23 12:39:46,632 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1407#true} {1407#true} #105#return; {1407#true} is VALID [2018-11-23 12:39:46,633 INFO L256 TraceCheckUtils]: 3: Hoare triple {1407#true} call #t~ret2 := main(); {1407#true} is VALID [2018-11-23 12:39:46,633 INFO L273 TraceCheckUtils]: 4: Hoare triple {1407#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~s__hit~0 := #t~nondet0;havoc #t~nondet0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {1407#true} is VALID [2018-11-23 12:39:46,633 INFO L273 TraceCheckUtils]: 5: Hoare triple {1407#true} assume !false; {1407#true} is VALID [2018-11-23 12:39:46,634 INFO L273 TraceCheckUtils]: 6: Hoare triple {1407#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1407#true} is VALID [2018-11-23 12:39:46,634 INFO L273 TraceCheckUtils]: 7: Hoare triple {1407#true} assume 8466 == ~s__state~0; {1407#true} is VALID [2018-11-23 12:39:46,634 INFO L273 TraceCheckUtils]: 8: Hoare triple {1407#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 2; {1407#true} is VALID [2018-11-23 12:39:46,634 INFO L273 TraceCheckUtils]: 9: Hoare triple {1407#true} assume 0 != ~s__hit~0;~s__state~0 := 8656; {1407#true} is VALID [2018-11-23 12:39:46,635 INFO L273 TraceCheckUtils]: 10: Hoare triple {1407#true} assume !false; {1407#true} is VALID [2018-11-23 12:39:46,635 INFO L273 TraceCheckUtils]: 11: Hoare triple {1407#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1407#true} is VALID [2018-11-23 12:39:46,635 INFO L273 TraceCheckUtils]: 12: Hoare triple {1407#true} assume !(8466 == ~s__state~0); {1407#true} is VALID [2018-11-23 12:39:46,636 INFO L273 TraceCheckUtils]: 13: Hoare triple {1407#true} assume !(8512 == ~s__state~0); {1407#true} is VALID [2018-11-23 12:39:46,636 INFO L273 TraceCheckUtils]: 14: Hoare triple {1407#true} assume !(8640 == ~s__state~0); {1407#true} is VALID [2018-11-23 12:39:46,636 INFO L273 TraceCheckUtils]: 15: Hoare triple {1407#true} assume 8656 == ~s__state~0; {1407#true} is VALID [2018-11-23 12:39:46,637 INFO L273 TraceCheckUtils]: 16: Hoare triple {1407#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {1407#true} is VALID [2018-11-23 12:39:46,637 INFO L273 TraceCheckUtils]: 17: Hoare triple {1407#true} assume !(4 == ~blastFlag~0); {1407#true} is VALID [2018-11-23 12:39:46,637 INFO L273 TraceCheckUtils]: 18: Hoare triple {1407#true} assume !(5 == ~blastFlag~0); {1407#true} is VALID [2018-11-23 12:39:46,638 INFO L273 TraceCheckUtils]: 19: Hoare triple {1407#true} assume 0 != ~s__hit~0;~s__state~0 := 8640; {1409#(<= 8640 main_~s__state~0)} is VALID [2018-11-23 12:39:46,639 INFO L273 TraceCheckUtils]: 20: Hoare triple {1409#(<= 8640 main_~s__state~0)} assume !false; {1409#(<= 8640 main_~s__state~0)} is VALID [2018-11-23 12:39:46,639 INFO L273 TraceCheckUtils]: 21: Hoare triple {1409#(<= 8640 main_~s__state~0)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {1408#false} is VALID [2018-11-23 12:39:46,639 INFO L273 TraceCheckUtils]: 22: Hoare triple {1408#false} assume !false; {1408#false} is VALID [2018-11-23 12:39:46,641 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 12:39:46,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:39:46,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:39:46,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:39:46,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:39:46,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:39:46,666 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:39:46,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:39:46,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:39:46,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:39:46,668 INFO L87 Difference]: Start difference. First operand 91 states and 123 transitions. Second operand 3 states. [2018-11-23 12:39:46,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:39:46,901 INFO L93 Difference]: Finished difference Result 181 states and 245 transitions. [2018-11-23 12:39:46,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:39:46,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:39:46,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:39:46,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:39:46,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2018-11-23 12:39:46,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:39:46,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2018-11-23 12:39:46,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2018-11-23 12:39:46,987 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:39:46,989 INFO L225 Difference]: With dead ends: 181 [2018-11-23 12:39:46,990 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 12:39:46,991 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:39:46,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 12:39:47,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-11-23 12:39:47,105 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:39:47,105 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 74 states. [2018-11-23 12:39:47,105 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 74 states. [2018-11-23 12:39:47,106 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 74 states. [2018-11-23 12:39:47,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:39:47,109 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2018-11-23 12:39:47,109 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2018-11-23 12:39:47,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:39:47,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:39:47,110 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 76 states. [2018-11-23 12:39:47,110 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 76 states. [2018-11-23 12:39:47,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:39:47,113 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2018-11-23 12:39:47,113 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2018-11-23 12:39:47,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:39:47,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:39:47,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:39:47,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:39:47,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 12:39:47,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 90 transitions. [2018-11-23 12:39:47,117 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 90 transitions. Word has length 23 [2018-11-23 12:39:47,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:39:47,117 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 90 transitions. [2018-11-23 12:39:47,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:39:47,118 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 90 transitions. [2018-11-23 12:39:47,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 12:39:47,119 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:39:47,119 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:39:47,119 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:39:47,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:39:47,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1155086362, now seen corresponding path program 1 times [2018-11-23 12:39:47,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:39:47,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:39:47,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:39:47,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:39:47,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:39:47,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:39:47,174 INFO L256 TraceCheckUtils]: 0: Hoare triple {1894#true} call ULTIMATE.init(); {1894#true} is VALID [2018-11-23 12:39:47,174 INFO L273 TraceCheckUtils]: 1: Hoare triple {1894#true} assume true; {1894#true} is VALID [2018-11-23 12:39:47,174 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1894#true} {1894#true} #105#return; {1894#true} is VALID [2018-11-23 12:39:47,175 INFO L256 TraceCheckUtils]: 3: Hoare triple {1894#true} call #t~ret2 := main(); {1894#true} is VALID [2018-11-23 12:39:47,175 INFO L273 TraceCheckUtils]: 4: Hoare triple {1894#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~s__hit~0 := #t~nondet0;havoc #t~nondet0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {1894#true} is VALID [2018-11-23 12:39:47,175 INFO L273 TraceCheckUtils]: 5: Hoare triple {1894#true} assume !false; {1894#true} is VALID [2018-11-23 12:39:47,175 INFO L273 TraceCheckUtils]: 6: Hoare triple {1894#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1894#true} is VALID [2018-11-23 12:39:47,176 INFO L273 TraceCheckUtils]: 7: Hoare triple {1894#true} assume 8466 == ~s__state~0; {1894#true} is VALID [2018-11-23 12:39:47,176 INFO L273 TraceCheckUtils]: 8: Hoare triple {1894#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 2; {1894#true} is VALID [2018-11-23 12:39:47,177 INFO L273 TraceCheckUtils]: 9: Hoare triple {1894#true} assume 0 != ~s__hit~0;~s__state~0 := 8656; {1896#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:47,179 INFO L273 TraceCheckUtils]: 10: Hoare triple {1896#(not (= 0 main_~s__hit~0))} assume !false; {1896#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:47,179 INFO L273 TraceCheckUtils]: 11: Hoare triple {1896#(not (= 0 main_~s__hit~0))} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1896#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:47,182 INFO L273 TraceCheckUtils]: 12: Hoare triple {1896#(not (= 0 main_~s__hit~0))} assume !(8466 == ~s__state~0); {1896#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:47,182 INFO L273 TraceCheckUtils]: 13: Hoare triple {1896#(not (= 0 main_~s__hit~0))} assume !(8512 == ~s__state~0); {1896#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:47,185 INFO L273 TraceCheckUtils]: 14: Hoare triple {1896#(not (= 0 main_~s__hit~0))} assume !(8640 == ~s__state~0); {1896#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:47,185 INFO L273 TraceCheckUtils]: 15: Hoare triple {1896#(not (= 0 main_~s__hit~0))} assume 8656 == ~s__state~0; {1896#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:47,186 INFO L273 TraceCheckUtils]: 16: Hoare triple {1896#(not (= 0 main_~s__hit~0))} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {1896#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:47,186 INFO L273 TraceCheckUtils]: 17: Hoare triple {1896#(not (= 0 main_~s__hit~0))} assume !(4 == ~blastFlag~0); {1896#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:47,189 INFO L273 TraceCheckUtils]: 18: Hoare triple {1896#(not (= 0 main_~s__hit~0))} assume !(5 == ~blastFlag~0); {1896#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:47,189 INFO L273 TraceCheckUtils]: 19: Hoare triple {1896#(not (= 0 main_~s__hit~0))} assume 0 != ~s__hit~0;~s__state~0 := 8640; {1896#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:47,191 INFO L273 TraceCheckUtils]: 20: Hoare triple {1896#(not (= 0 main_~s__hit~0))} assume !false; {1896#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:47,191 INFO L273 TraceCheckUtils]: 21: Hoare triple {1896#(not (= 0 main_~s__hit~0))} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1896#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:47,192 INFO L273 TraceCheckUtils]: 22: Hoare triple {1896#(not (= 0 main_~s__hit~0))} assume !(8466 == ~s__state~0); {1896#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:47,193 INFO L273 TraceCheckUtils]: 23: Hoare triple {1896#(not (= 0 main_~s__hit~0))} assume !(8512 == ~s__state~0); {1896#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:47,193 INFO L273 TraceCheckUtils]: 24: Hoare triple {1896#(not (= 0 main_~s__hit~0))} assume 8640 == ~s__state~0; {1896#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:47,194 INFO L273 TraceCheckUtils]: 25: Hoare triple {1896#(not (= 0 main_~s__hit~0))} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {1896#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:47,196 INFO L273 TraceCheckUtils]: 26: Hoare triple {1896#(not (= 0 main_~s__hit~0))} assume !(0 != ~s__hit~0);~s__state~0 := 8656; {1895#false} is VALID [2018-11-23 12:39:47,196 INFO L273 TraceCheckUtils]: 27: Hoare triple {1895#false} assume !false; {1895#false} is VALID [2018-11-23 12:39:47,196 INFO L273 TraceCheckUtils]: 28: Hoare triple {1895#false} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1895#false} is VALID [2018-11-23 12:39:47,197 INFO L273 TraceCheckUtils]: 29: Hoare triple {1895#false} assume !(8466 == ~s__state~0); {1895#false} is VALID [2018-11-23 12:39:47,197 INFO L273 TraceCheckUtils]: 30: Hoare triple {1895#false} assume !(8512 == ~s__state~0); {1895#false} is VALID [2018-11-23 12:39:47,197 INFO L273 TraceCheckUtils]: 31: Hoare triple {1895#false} assume !(8640 == ~s__state~0); {1895#false} is VALID [2018-11-23 12:39:47,198 INFO L273 TraceCheckUtils]: 32: Hoare triple {1895#false} assume 8656 == ~s__state~0; {1895#false} is VALID [2018-11-23 12:39:47,198 INFO L273 TraceCheckUtils]: 33: Hoare triple {1895#false} assume !(2 == ~blastFlag~0); {1895#false} is VALID [2018-11-23 12:39:47,198 INFO L273 TraceCheckUtils]: 34: Hoare triple {1895#false} assume !(4 == ~blastFlag~0); {1895#false} is VALID [2018-11-23 12:39:47,199 INFO L273 TraceCheckUtils]: 35: Hoare triple {1895#false} assume 5 == ~blastFlag~0; {1895#false} is VALID [2018-11-23 12:39:47,199 INFO L273 TraceCheckUtils]: 36: Hoare triple {1895#false} assume !false; {1895#false} is VALID [2018-11-23 12:39:47,202 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 12:39:47,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:39:47,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:39:47,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-23 12:39:47,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:39:47,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:39:47,249 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:39:47,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:39:47,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:39:47,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:39:47,249 INFO L87 Difference]: Start difference. First operand 74 states and 90 transitions. Second operand 3 states. [2018-11-23 12:39:47,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:39:47,370 INFO L93 Difference]: Finished difference Result 124 states and 147 transitions. [2018-11-23 12:39:47,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:39:47,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-23 12:39:47,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:39:47,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:39:47,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-23 12:39:47,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:39:47,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-23 12:39:47,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2018-11-23 12:39:47,454 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:39:47,455 INFO L225 Difference]: With dead ends: 124 [2018-11-23 12:39:47,455 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 12:39:47,457 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:39:47,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 12:39:47,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 12:39:47,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:39:47,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 12:39:47,458 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 12:39:47,458 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 12:39:47,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:39:47,458 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 12:39:47,459 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:39:47,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:39:47,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:39:47,459 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 12:39:47,459 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 12:39:47,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:39:47,460 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 12:39:47,460 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:39:47,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:39:47,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:39:47,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:39:47,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:39:47,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 12:39:47,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 12:39:47,462 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-11-23 12:39:47,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:39:47,463 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:39:47,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:39:47,463 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:39:47,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:39:47,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 12:39:47,686 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 12:39:47,687 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:39:47,687 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:39:47,687 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 12:39:47,687 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 12:39:47,687 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 12:39:47,687 INFO L444 ceAbstractionStarter]: At program point L97(lines 9 141) the Hoare annotation is: false [2018-11-23 12:39:47,687 INFO L444 ceAbstractionStarter]: At program point L31(lines 30 125) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-11-23 12:39:47,688 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 54 107) no Hoare annotation was computed. [2018-11-23 12:39:47,688 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 139) no Hoare annotation was computed. [2018-11-23 12:39:47,688 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 9 141) no Hoare annotation was computed. [2018-11-23 12:39:47,688 INFO L448 ceAbstractionStarter]: For program point L89-1(lines 54 107) no Hoare annotation was computed. [2018-11-23 12:39:47,688 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-11-23 12:39:47,688 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 54 107) no Hoare annotation was computed. [2018-11-23 12:39:47,688 INFO L448 ceAbstractionStarter]: For program point L70(lines 70 74) no Hoare annotation was computed. [2018-11-23 12:39:47,689 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 128) no Hoare annotation was computed. [2018-11-23 12:39:47,689 INFO L448 ceAbstractionStarter]: For program point L58-1(lines 54 107) no Hoare annotation was computed. [2018-11-23 12:39:47,689 INFO L448 ceAbstractionStarter]: For program point L50(lines 50 109) no Hoare annotation was computed. [2018-11-23 12:39:47,689 INFO L448 ceAbstractionStarter]: For program point L46(lines 46 111) no Hoare annotation was computed. [2018-11-23 12:39:47,689 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 9 141) no Hoare annotation was computed. [2018-11-23 12:39:47,689 INFO L451 ceAbstractionStarter]: At program point L137(lines 9 141) the Hoare annotation is: true [2018-11-23 12:39:47,689 INFO L444 ceAbstractionStarter]: At program point L100(lines 18 135) the Hoare annotation is: (or (and (<= 8640 main_~s__state~0) (<= main_~blastFlag~0 3) (not (= 0 main_~s__hit~0))) (<= main_~blastFlag~0 2)) [2018-11-23 12:39:47,689 INFO L448 ceAbstractionStarter]: For program point L96(lines 96 98) no Hoare annotation was computed. [2018-11-23 12:39:47,689 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 125) no Hoare annotation was computed. [2018-11-23 12:39:47,690 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 9 141) the Hoare annotation is: true [2018-11-23 12:39:47,690 INFO L444 ceAbstractionStarter]: At program point L26(lines 25 128) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-11-23 12:39:47,690 INFO L444 ceAbstractionStarter]: At program point L51(lines 50 109) the Hoare annotation is: (let ((.cse0 (<= 8656 main_~s__state~0))) (or (and .cse0 (<= main_~blastFlag~0 2)) (and .cse0 (<= main_~blastFlag~0 3) (not (= 0 main_~s__hit~0))))) [2018-11-23 12:39:47,690 INFO L444 ceAbstractionStarter]: At program point L47(lines 46 111) the Hoare annotation is: (let ((.cse0 (<= 8640 main_~s__state~0))) (or (and .cse0 (<= main_~blastFlag~0 3) (not (= 0 main_~s__hit~0))) (and .cse0 (<= main_~blastFlag~0 2)))) [2018-11-23 12:39:47,692 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:39:47,694 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:39:47,694 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:39:47,694 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-23 12:39:47,694 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:39:47,695 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:39:47,695 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-23 12:39:47,695 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-23 12:39:47,695 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:39:47,695 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-23 12:39:47,695 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:39:47,695 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2018-11-23 12:39:47,696 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2018-11-23 12:39:47,696 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 12:39:47,696 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2018-11-23 12:39:47,696 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2018-11-23 12:39:47,696 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2018-11-23 12:39:47,696 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2018-11-23 12:39:47,696 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2018-11-23 12:39:47,696 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2018-11-23 12:39:47,696 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2018-11-23 12:39:47,696 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2018-11-23 12:39:47,697 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2018-11-23 12:39:47,697 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2018-11-23 12:39:47,697 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2018-11-23 12:39:47,697 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2018-11-23 12:39:47,697 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2018-11-23 12:39:47,697 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2018-11-23 12:39:47,697 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2018-11-23 12:39:47,697 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2018-11-23 12:39:47,697 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2018-11-23 12:39:47,697 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2018-11-23 12:39:47,698 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2018-11-23 12:39:47,698 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2018-11-23 12:39:47,698 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2018-11-23 12:39:47,698 WARN L170 areAnnotationChecker]: L93-1 has no Hoare annotation [2018-11-23 12:39:47,698 WARN L170 areAnnotationChecker]: L93-1 has no Hoare annotation [2018-11-23 12:39:47,698 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2018-11-23 12:39:47,698 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2018-11-23 12:39:47,698 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 12:39:47,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:39:47 BoogieIcfgContainer [2018-11-23 12:39:47,709 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:39:47,709 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:39:47,710 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:39:47,710 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:39:47,710 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:39:43" (3/4) ... [2018-11-23 12:39:47,714 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 12:39:47,720 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 12:39:47,720 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 12:39:47,725 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 12:39:47,725 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 12:39:47,725 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 12:39:47,787 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ssh-simplified/s3_srvr_1b_true-unreach-call_false-termination.cil.c-witness.graphml [2018-11-23 12:39:47,787 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:39:47,791 INFO L168 Benchmark]: Toolchain (without parser) took 5795.53 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.3 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -410.6 MB). Peak memory consumption was 319.8 MB. Max. memory is 7.1 GB. [2018-11-23 12:39:47,792 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:39:47,793 INFO L168 Benchmark]: CACSL2BoogieTranslator took 354.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:39:47,793 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.00 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:39:47,794 INFO L168 Benchmark]: Boogie Preprocessor took 23.75 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:39:47,794 INFO L168 Benchmark]: RCFGBuilder took 682.94 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -765.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-23 12:39:47,795 INFO L168 Benchmark]: TraceAbstraction took 4627.46 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 331.1 MB). Peak memory consumption was 331.1 MB. Max. memory is 7.1 GB. [2018-11-23 12:39:47,795 INFO L168 Benchmark]: Witness Printer took 77.94 ms. Allocated memory is still 2.3 GB. Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. [2018-11-23 12:39:47,799 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 354.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 21.00 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.75 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 682.94 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -765.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4627.46 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 331.1 MB). Peak memory consumption was 331.1 MB. Max. memory is 7.1 GB. * Witness Printer took 77.94 ms. Allocated memory is still 2.3 GB. Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 139]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (8656 <= s__state && blastFlag <= 2) || ((8656 <= s__state && blastFlag <= 3) && !(0 == s__hit)) - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((8640 <= s__state && blastFlag <= 3) && !(0 == s__hit)) || blastFlag <= 2 - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((8640 <= s__state && blastFlag <= 3) && !(0 == s__hit)) || (8640 <= s__state && blastFlag <= 2) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: blastFlag <= 2 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. SAFE Result, 4.5s OverallTime, 6 OverallIterations, 4 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 184 SDtfs, 92 SDslu, 109 SDs, 0 SdLazy, 95 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 6 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 11 PreInvPairs, 34 NumberOfFragments, 65 HoareAnnotationTreeSize, 11 FomulaSimplifications, 175 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 24 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 114 NumberOfCodeBlocks, 114 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 4626 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 42/42 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...