/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_1b.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:03:17,891 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:03:17,894 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:03:17,906 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:03:17,906 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:03:17,908 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:03:17,909 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:03:17,911 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:03:17,912 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:03:17,913 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:03:17,914 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:03:17,915 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:03:17,916 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:03:17,917 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:03:17,918 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:03:17,919 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:03:17,920 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:03:17,920 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:03:17,922 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:03:17,927 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:03:17,928 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:03:17,933 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:03:17,934 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:03:17,936 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:03:17,938 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:03:17,941 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:03:17,942 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:03:17,943 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:03:17,943 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:03:17,945 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:03:17,945 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:03:17,946 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:03:17,946 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:03:17,947 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:03:17,948 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:03:17,948 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:03:17,949 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:03:17,949 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:03:17,950 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:03:17,951 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:03:17,953 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:03:17,954 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:03:17,972 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:03:17,972 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:03:17,973 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:03:17,974 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:03:17,974 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:03:17,974 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:03:17,974 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:03:17,975 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:03:17,975 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:03:17,975 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:03:17,975 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:03:17,975 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:03:17,976 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:03:17,976 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:03:17,976 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:03:17,976 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:03:17,976 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:03:17,977 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:03:17,977 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:03:17,977 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:03:17,977 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:03:17,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:03:17,978 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:03:17,978 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:03:17,978 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:03:17,979 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:03:17,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:03:17,979 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:03:17,979 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:03:17,979 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:03:18,303 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:03:18,322 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:03:18,326 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:03:18,327 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:03:18,328 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:03:18,329 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_1b.cil.c [2020-07-10 15:03:18,401 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edce705e2/4c78059d667d469b9fc97f5a1f997578/FLAG80aac9efd [2020-07-10 15:03:18,861 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:03:18,861 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_1b.cil.c [2020-07-10 15:03:18,869 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edce705e2/4c78059d667d469b9fc97f5a1f997578/FLAG80aac9efd [2020-07-10 15:03:19,227 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edce705e2/4c78059d667d469b9fc97f5a1f997578 [2020-07-10 15:03:19,235 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:03:19,237 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:03:19,238 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:03:19,238 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:03:19,241 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:03:19,243 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:03:19" (1/1) ... [2020-07-10 15:03:19,246 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67e202a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:19, skipping insertion in model container [2020-07-10 15:03:19,246 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:03:19" (1/1) ... [2020-07-10 15:03:19,252 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:03:19,272 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:03:19,444 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:03:19,449 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:03:19,471 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:03:19,486 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:03:19,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:19 WrapperNode [2020-07-10 15:03:19,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:03:19,487 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:03:19,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:03:19,488 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:03:19,501 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:19" (1/1) ... [2020-07-10 15:03:19,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:19" (1/1) ... [2020-07-10 15:03:19,589 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:19" (1/1) ... [2020-07-10 15:03:19,590 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:19" (1/1) ... [2020-07-10 15:03:19,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:19" (1/1) ... [2020-07-10 15:03:19,601 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:19" (1/1) ... [2020-07-10 15:03:19,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:19" (1/1) ... [2020-07-10 15:03:19,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:03:19,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:03:19,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:03:19,605 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:03:19,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:19" (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 [2020-07-10 15:03:19,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:03:19,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:03:19,667 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:03:19,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:03:19,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-07-10 15:03:19,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:03:19,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2020-07-10 15:03:19,668 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:03:19,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:03:19,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:03:20,041 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:03:20,041 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 15:03:20,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:03:20 BoogieIcfgContainer [2020-07-10 15:03:20,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:03:20,045 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:03:20,046 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:03:20,049 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:03:20,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:03:19" (1/3) ... [2020-07-10 15:03:20,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@616938bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:03:20, skipping insertion in model container [2020-07-10 15:03:20,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:19" (2/3) ... [2020-07-10 15:03:20,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@616938bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:03:20, skipping insertion in model container [2020-07-10 15:03:20,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:03:20" (3/3) ... [2020-07-10 15:03:20,052 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1b.cil.c [2020-07-10 15:03:20,063 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:03:20,070 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:03:20,083 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:03:20,110 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:03:20,110 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:03:20,111 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:03:20,111 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:03:20,112 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:03:20,112 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:03:20,112 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:03:20,112 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:03:20,133 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2020-07-10 15:03:20,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-10 15:03:20,139 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:20,140 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:03:20,140 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:20,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:20,146 INFO L82 PathProgramCache]: Analyzing trace with hash -2134687016, now seen corresponding path program 1 times [2020-07-10 15:03:20,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:20,154 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784590307] [2020-07-10 15:03:20,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:20,322 INFO L280 TraceCheckUtils]: 0: Hoare triple {31#true} assume true; {31#true} is VALID [2020-07-10 15:03:20,322 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {31#true} {31#true} #105#return; {31#true} is VALID [2020-07-10 15:03:20,324 INFO L263 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {31#true} is VALID [2020-07-10 15:03:20,325 INFO L280 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2020-07-10 15:03:20,327 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #105#return; {31#true} is VALID [2020-07-10 15:03:20,327 INFO L263 TraceCheckUtils]: 3: Hoare triple {31#true} call #t~ret2 := main(); {31#true} is VALID [2020-07-10 15:03:20,329 INFO L280 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; {35#(<= main_~blastFlag~0 0)} is VALID [2020-07-10 15:03:20,330 INFO L280 TraceCheckUtils]: 5: Hoare triple {35#(<= main_~blastFlag~0 0)} assume !false; {35#(<= main_~blastFlag~0 0)} is VALID [2020-07-10 15:03:20,332 INFO L280 TraceCheckUtils]: 6: Hoare triple {35#(<= main_~blastFlag~0 0)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {32#false} is VALID [2020-07-10 15:03:20,332 INFO L280 TraceCheckUtils]: 7: Hoare triple {32#false} assume !false; {32#false} is VALID [2020-07-10 15:03:20,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:20,335 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784590307] [2020-07-10 15:03:20,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:20,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:20,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520543476] [2020-07-10 15:03:20,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-07-10 15:03:20,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:20,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:20,395 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:20,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:20,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:20,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:20,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:20,409 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. [2020-07-10 15:03:20,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:20,617 INFO L93 Difference]: Finished difference Result 70 states and 116 transitions. [2020-07-10 15:03:20,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:20,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-07-10 15:03:20,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:20,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:20,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2020-07-10 15:03:20,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:20,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2020-07-10 15:03:20,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 116 transitions. [2020-07-10 15:03:20,805 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:20,819 INFO L225 Difference]: With dead ends: 70 [2020-07-10 15:03:20,819 INFO L226 Difference]: Without dead ends: 39 [2020-07-10 15:03:20,823 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:20,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-10 15:03:20,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-07-10 15:03:20,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:20,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 39 states. [2020-07-10 15:03:20,878 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2020-07-10 15:03:20,878 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2020-07-10 15:03:20,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:20,883 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2020-07-10 15:03:20,884 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2020-07-10 15:03:20,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:20,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:20,885 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2020-07-10 15:03:20,885 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2020-07-10 15:03:20,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:20,890 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2020-07-10 15:03:20,891 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2020-07-10 15:03:20,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:20,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:20,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:20,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:20,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-10 15:03:20,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2020-07-10 15:03:20,897 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 8 [2020-07-10 15:03:20,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:20,898 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2020-07-10 15:03:20,898 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:20,898 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2020-07-10 15:03:20,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-10 15:03:20,899 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:20,899 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:03:20,900 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:03:20,900 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:20,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:20,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1966827798, now seen corresponding path program 1 times [2020-07-10 15:03:20,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:20,901 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193898686] [2020-07-10 15:03:20,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:20,949 INFO L280 TraceCheckUtils]: 0: Hoare triple {264#true} assume true; {264#true} is VALID [2020-07-10 15:03:20,949 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {264#true} {264#true} #105#return; {264#true} is VALID [2020-07-10 15:03:20,950 INFO L263 TraceCheckUtils]: 0: Hoare triple {264#true} call ULTIMATE.init(); {264#true} is VALID [2020-07-10 15:03:20,950 INFO L280 TraceCheckUtils]: 1: Hoare triple {264#true} assume true; {264#true} is VALID [2020-07-10 15:03:20,950 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {264#true} {264#true} #105#return; {264#true} is VALID [2020-07-10 15:03:20,951 INFO L263 TraceCheckUtils]: 3: Hoare triple {264#true} call #t~ret2 := main(); {264#true} is VALID [2020-07-10 15:03:20,951 INFO L280 TraceCheckUtils]: 4: Hoare triple {264#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; {264#true} is VALID [2020-07-10 15:03:20,961 INFO L280 TraceCheckUtils]: 5: Hoare triple {264#true} assume !false; {264#true} is VALID [2020-07-10 15:03:20,962 INFO L280 TraceCheckUtils]: 6: Hoare triple {264#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {264#true} is VALID [2020-07-10 15:03:20,964 INFO L280 TraceCheckUtils]: 7: Hoare triple {264#true} assume 8466 == ~s__state~0; {264#true} is VALID [2020-07-10 15:03:20,965 INFO L280 TraceCheckUtils]: 8: Hoare triple {264#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 2; {264#true} is VALID [2020-07-10 15:03:20,966 INFO L280 TraceCheckUtils]: 9: Hoare triple {264#true} assume 0 != ~s__hit~0;~s__state~0 := 8656; {268#(<= 8656 main_~s__state~0)} is VALID [2020-07-10 15:03:20,968 INFO L280 TraceCheckUtils]: 10: Hoare triple {268#(<= 8656 main_~s__state~0)} assume !false; {268#(<= 8656 main_~s__state~0)} is VALID [2020-07-10 15:03:20,970 INFO L280 TraceCheckUtils]: 11: Hoare triple {268#(<= 8656 main_~s__state~0)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {265#false} is VALID [2020-07-10 15:03:20,970 INFO L280 TraceCheckUtils]: 12: Hoare triple {265#false} assume !false; {265#false} is VALID [2020-07-10 15:03:20,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:20,972 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193898686] [2020-07-10 15:03:20,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:20,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:20,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574711655] [2020-07-10 15:03:20,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-07-10 15:03:20,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:20,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:20,995 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:20,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:20,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:20,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:20,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:20,997 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand 3 states. [2020-07-10 15:03:21,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:21,111 INFO L93 Difference]: Finished difference Result 87 states and 125 transitions. [2020-07-10 15:03:21,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:21,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-07-10 15:03:21,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:21,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:21,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2020-07-10 15:03:21,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:21,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2020-07-10 15:03:21,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 72 transitions. [2020-07-10 15:03:21,202 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:21,205 INFO L225 Difference]: With dead ends: 87 [2020-07-10 15:03:21,205 INFO L226 Difference]: Without dead ends: 53 [2020-07-10 15:03:21,206 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:21,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-10 15:03:21,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2020-07-10 15:03:21,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:21,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 49 states. [2020-07-10 15:03:21,227 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 49 states. [2020-07-10 15:03:21,227 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 49 states. [2020-07-10 15:03:21,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:21,231 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2020-07-10 15:03:21,231 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2020-07-10 15:03:21,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:21,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:21,232 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 53 states. [2020-07-10 15:03:21,232 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 53 states. [2020-07-10 15:03:21,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:21,237 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2020-07-10 15:03:21,237 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2020-07-10 15:03:21,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:21,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:21,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:21,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:21,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-10 15:03:21,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2020-07-10 15:03:21,242 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 13 [2020-07-10 15:03:21,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:21,243 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2020-07-10 15:03:21,243 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:21,243 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2020-07-10 15:03:21,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-10 15:03:21,244 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:21,244 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:03:21,244 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:03:21,245 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:21,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:21,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1966887380, now seen corresponding path program 1 times [2020-07-10 15:03:21,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:21,246 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221974727] [2020-07-10 15:03:21,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:21,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:21,281 INFO L280 TraceCheckUtils]: 0: Hoare triple {559#true} assume true; {559#true} is VALID [2020-07-10 15:03:21,281 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {559#true} {559#true} #105#return; {559#true} is VALID [2020-07-10 15:03:21,282 INFO L263 TraceCheckUtils]: 0: Hoare triple {559#true} call ULTIMATE.init(); {559#true} is VALID [2020-07-10 15:03:21,282 INFO L280 TraceCheckUtils]: 1: Hoare triple {559#true} assume true; {559#true} is VALID [2020-07-10 15:03:21,282 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {559#true} {559#true} #105#return; {559#true} is VALID [2020-07-10 15:03:21,283 INFO L263 TraceCheckUtils]: 3: Hoare triple {559#true} call #t~ret2 := main(); {559#true} is VALID [2020-07-10 15:03:21,283 INFO L280 TraceCheckUtils]: 4: Hoare triple {559#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; {559#true} is VALID [2020-07-10 15:03:21,283 INFO L280 TraceCheckUtils]: 5: Hoare triple {559#true} assume !false; {559#true} is VALID [2020-07-10 15:03:21,284 INFO L280 TraceCheckUtils]: 6: Hoare triple {559#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {559#true} is VALID [2020-07-10 15:03:21,284 INFO L280 TraceCheckUtils]: 7: Hoare triple {559#true} assume 8466 == ~s__state~0; {559#true} is VALID [2020-07-10 15:03:21,285 INFO L280 TraceCheckUtils]: 8: Hoare triple {559#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 2; {563#(<= main_~blastFlag~0 2)} is VALID [2020-07-10 15:03:21,286 INFO L280 TraceCheckUtils]: 9: Hoare triple {563#(<= main_~blastFlag~0 2)} assume !(0 != ~s__hit~0);~s__state~0 := 8512; {563#(<= main_~blastFlag~0 2)} is VALID [2020-07-10 15:03:21,286 INFO L280 TraceCheckUtils]: 10: Hoare triple {563#(<= main_~blastFlag~0 2)} assume !false; {563#(<= main_~blastFlag~0 2)} is VALID [2020-07-10 15:03:21,287 INFO L280 TraceCheckUtils]: 11: Hoare triple {563#(<= main_~blastFlag~0 2)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {560#false} is VALID [2020-07-10 15:03:21,287 INFO L280 TraceCheckUtils]: 12: Hoare triple {560#false} assume !false; {560#false} is VALID [2020-07-10 15:03:21,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:21,289 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221974727] [2020-07-10 15:03:21,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:21,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:21,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958183092] [2020-07-10 15:03:21,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-07-10 15:03:21,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:21,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:21,306 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:21,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:21,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:21,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:21,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:21,307 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. Second operand 3 states. [2020-07-10 15:03:21,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:21,428 INFO L93 Difference]: Finished difference Result 93 states and 130 transitions. [2020-07-10 15:03:21,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:21,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-07-10 15:03:21,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:21,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:21,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2020-07-10 15:03:21,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:21,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2020-07-10 15:03:21,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 88 transitions. [2020-07-10 15:03:21,542 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:21,544 INFO L225 Difference]: With dead ends: 93 [2020-07-10 15:03:21,545 INFO L226 Difference]: Without dead ends: 70 [2020-07-10 15:03:21,545 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:21,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-10 15:03:21,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-07-10 15:03:21,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:21,575 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 70 states. [2020-07-10 15:03:21,575 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2020-07-10 15:03:21,575 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2020-07-10 15:03:21,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:21,579 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2020-07-10 15:03:21,579 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 93 transitions. [2020-07-10 15:03:21,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:21,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:21,580 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2020-07-10 15:03:21,580 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2020-07-10 15:03:21,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:21,584 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2020-07-10 15:03:21,584 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 93 transitions. [2020-07-10 15:03:21,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:21,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:21,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:21,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:21,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-10 15:03:21,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 93 transitions. [2020-07-10 15:03:21,590 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 93 transitions. Word has length 13 [2020-07-10 15:03:21,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:21,590 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 93 transitions. [2020-07-10 15:03:21,590 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:21,591 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 93 transitions. [2020-07-10 15:03:21,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 15:03:21,591 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:21,592 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:03:21,592 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:03:21,592 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:21,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:21,593 INFO L82 PathProgramCache]: Analyzing trace with hash 280007728, now seen corresponding path program 1 times [2020-07-10 15:03:21,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:21,593 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327353172] [2020-07-10 15:03:21,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:21,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:21,633 INFO L280 TraceCheckUtils]: 0: Hoare triple {922#true} assume true; {922#true} is VALID [2020-07-10 15:03:21,634 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {922#true} {922#true} #105#return; {922#true} is VALID [2020-07-10 15:03:21,635 INFO L263 TraceCheckUtils]: 0: Hoare triple {922#true} call ULTIMATE.init(); {922#true} is VALID [2020-07-10 15:03:21,635 INFO L280 TraceCheckUtils]: 1: Hoare triple {922#true} assume true; {922#true} is VALID [2020-07-10 15:03:21,635 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {922#true} {922#true} #105#return; {922#true} is VALID [2020-07-10 15:03:21,636 INFO L263 TraceCheckUtils]: 3: Hoare triple {922#true} call #t~ret2 := main(); {922#true} is VALID [2020-07-10 15:03:21,636 INFO L280 TraceCheckUtils]: 4: Hoare triple {922#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; {922#true} is VALID [2020-07-10 15:03:21,637 INFO L280 TraceCheckUtils]: 5: Hoare triple {922#true} assume !false; {922#true} is VALID [2020-07-10 15:03:21,637 INFO L280 TraceCheckUtils]: 6: Hoare triple {922#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {922#true} is VALID [2020-07-10 15:03:21,637 INFO L280 TraceCheckUtils]: 7: Hoare triple {922#true} assume 8466 == ~s__state~0; {922#true} is VALID [2020-07-10 15:03:21,638 INFO L280 TraceCheckUtils]: 8: Hoare triple {922#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 2; {922#true} is VALID [2020-07-10 15:03:21,638 INFO L280 TraceCheckUtils]: 9: Hoare triple {922#true} assume 0 != ~s__hit~0;~s__state~0 := 8656; {922#true} is VALID [2020-07-10 15:03:21,638 INFO L280 TraceCheckUtils]: 10: Hoare triple {922#true} assume !false; {922#true} is VALID [2020-07-10 15:03:21,638 INFO L280 TraceCheckUtils]: 11: Hoare triple {922#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {922#true} is VALID [2020-07-10 15:03:21,639 INFO L280 TraceCheckUtils]: 12: Hoare triple {922#true} assume !(8466 == ~s__state~0); {922#true} is VALID [2020-07-10 15:03:21,639 INFO L280 TraceCheckUtils]: 13: Hoare triple {922#true} assume !(8512 == ~s__state~0); {922#true} is VALID [2020-07-10 15:03:21,639 INFO L280 TraceCheckUtils]: 14: Hoare triple {922#true} assume !(8640 == ~s__state~0); {922#true} is VALID [2020-07-10 15:03:21,640 INFO L280 TraceCheckUtils]: 15: Hoare triple {922#true} assume 8656 == ~s__state~0; {922#true} is VALID [2020-07-10 15:03:21,641 INFO L280 TraceCheckUtils]: 16: Hoare triple {922#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {926#(<= main_~blastFlag~0 3)} is VALID [2020-07-10 15:03:21,642 INFO L280 TraceCheckUtils]: 17: Hoare triple {926#(<= main_~blastFlag~0 3)} assume !(4 == ~blastFlag~0); {926#(<= main_~blastFlag~0 3)} is VALID [2020-07-10 15:03:21,643 INFO L280 TraceCheckUtils]: 18: Hoare triple {926#(<= main_~blastFlag~0 3)} assume 5 == ~blastFlag~0; {923#false} is VALID [2020-07-10 15:03:21,643 INFO L280 TraceCheckUtils]: 19: Hoare triple {923#false} assume !false; {923#false} is VALID [2020-07-10 15:03:21,644 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-10 15:03:21,645 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327353172] [2020-07-10 15:03:21,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:21,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:21,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530224996] [2020-07-10 15:03:21,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-10 15:03:21,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:21,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:21,669 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:21,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:21,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:21,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:21,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:21,670 INFO L87 Difference]: Start difference. First operand 70 states and 93 transitions. Second operand 3 states. [2020-07-10 15:03:21,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:21,822 INFO L93 Difference]: Finished difference Result 137 states and 187 transitions. [2020-07-10 15:03:21,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:21,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-10 15:03:21,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:21,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:21,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2020-07-10 15:03:21,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:21,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2020-07-10 15:03:21,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 89 transitions. [2020-07-10 15:03:21,929 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:21,932 INFO L225 Difference]: With dead ends: 137 [2020-07-10 15:03:21,933 INFO L226 Difference]: Without dead ends: 93 [2020-07-10 15:03:21,934 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:21,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-07-10 15:03:21,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2020-07-10 15:03:21,980 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:21,980 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 91 states. [2020-07-10 15:03:21,980 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 91 states. [2020-07-10 15:03:21,981 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 91 states. [2020-07-10 15:03:21,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:21,985 INFO L93 Difference]: Finished difference Result 93 states and 124 transitions. [2020-07-10 15:03:21,985 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2020-07-10 15:03:21,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:21,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:21,986 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 93 states. [2020-07-10 15:03:21,986 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 93 states. [2020-07-10 15:03:21,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:21,991 INFO L93 Difference]: Finished difference Result 93 states and 124 transitions. [2020-07-10 15:03:21,991 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2020-07-10 15:03:21,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:21,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:21,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:21,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:21,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-07-10 15:03:21,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 123 transitions. [2020-07-10 15:03:21,997 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 123 transitions. Word has length 20 [2020-07-10 15:03:21,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:21,997 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 123 transitions. [2020-07-10 15:03:21,997 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:21,997 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 123 transitions. [2020-07-10 15:03:21,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 15:03:21,998 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:21,998 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:03:21,999 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 15:03:21,999 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:21,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:21,999 INFO L82 PathProgramCache]: Analyzing trace with hash 885328029, now seen corresponding path program 1 times [2020-07-10 15:03:22,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:22,000 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367051786] [2020-07-10 15:03:22,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:22,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:22,037 INFO L280 TraceCheckUtils]: 0: Hoare triple {1415#true} assume true; {1415#true} is VALID [2020-07-10 15:03:22,037 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1415#true} {1415#true} #105#return; {1415#true} is VALID [2020-07-10 15:03:22,038 INFO L263 TraceCheckUtils]: 0: Hoare triple {1415#true} call ULTIMATE.init(); {1415#true} is VALID [2020-07-10 15:03:22,038 INFO L280 TraceCheckUtils]: 1: Hoare triple {1415#true} assume true; {1415#true} is VALID [2020-07-10 15:03:22,038 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1415#true} {1415#true} #105#return; {1415#true} is VALID [2020-07-10 15:03:22,039 INFO L263 TraceCheckUtils]: 3: Hoare triple {1415#true} call #t~ret2 := main(); {1415#true} is VALID [2020-07-10 15:03:22,039 INFO L280 TraceCheckUtils]: 4: Hoare triple {1415#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; {1415#true} is VALID [2020-07-10 15:03:22,039 INFO L280 TraceCheckUtils]: 5: Hoare triple {1415#true} assume !false; {1415#true} is VALID [2020-07-10 15:03:22,040 INFO L280 TraceCheckUtils]: 6: Hoare triple {1415#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1415#true} is VALID [2020-07-10 15:03:22,040 INFO L280 TraceCheckUtils]: 7: Hoare triple {1415#true} assume 8466 == ~s__state~0; {1415#true} is VALID [2020-07-10 15:03:22,040 INFO L280 TraceCheckUtils]: 8: Hoare triple {1415#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 2; {1415#true} is VALID [2020-07-10 15:03:22,040 INFO L280 TraceCheckUtils]: 9: Hoare triple {1415#true} assume 0 != ~s__hit~0;~s__state~0 := 8656; {1415#true} is VALID [2020-07-10 15:03:22,041 INFO L280 TraceCheckUtils]: 10: Hoare triple {1415#true} assume !false; {1415#true} is VALID [2020-07-10 15:03:22,041 INFO L280 TraceCheckUtils]: 11: Hoare triple {1415#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1415#true} is VALID [2020-07-10 15:03:22,041 INFO L280 TraceCheckUtils]: 12: Hoare triple {1415#true} assume !(8466 == ~s__state~0); {1415#true} is VALID [2020-07-10 15:03:22,041 INFO L280 TraceCheckUtils]: 13: Hoare triple {1415#true} assume !(8512 == ~s__state~0); {1415#true} is VALID [2020-07-10 15:03:22,042 INFO L280 TraceCheckUtils]: 14: Hoare triple {1415#true} assume !(8640 == ~s__state~0); {1415#true} is VALID [2020-07-10 15:03:22,042 INFO L280 TraceCheckUtils]: 15: Hoare triple {1415#true} assume 8656 == ~s__state~0; {1415#true} is VALID [2020-07-10 15:03:22,042 INFO L280 TraceCheckUtils]: 16: Hoare triple {1415#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {1415#true} is VALID [2020-07-10 15:03:22,043 INFO L280 TraceCheckUtils]: 17: Hoare triple {1415#true} assume !(4 == ~blastFlag~0); {1415#true} is VALID [2020-07-10 15:03:22,043 INFO L280 TraceCheckUtils]: 18: Hoare triple {1415#true} assume !(5 == ~blastFlag~0); {1415#true} is VALID [2020-07-10 15:03:22,044 INFO L280 TraceCheckUtils]: 19: Hoare triple {1415#true} assume 0 != ~s__hit~0;~s__state~0 := 8640; {1419#(<= 8640 main_~s__state~0)} is VALID [2020-07-10 15:03:22,045 INFO L280 TraceCheckUtils]: 20: Hoare triple {1419#(<= 8640 main_~s__state~0)} assume !false; {1419#(<= 8640 main_~s__state~0)} is VALID [2020-07-10 15:03:22,045 INFO L280 TraceCheckUtils]: 21: Hoare triple {1419#(<= 8640 main_~s__state~0)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {1416#false} is VALID [2020-07-10 15:03:22,046 INFO L280 TraceCheckUtils]: 22: Hoare triple {1416#false} assume !false; {1416#false} is VALID [2020-07-10 15:03:22,047 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-10 15:03:22,047 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367051786] [2020-07-10 15:03:22,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:22,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:22,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285974349] [2020-07-10 15:03:22,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 15:03:22,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:22,049 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:22,070 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:22,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:22,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:22,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:22,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:22,071 INFO L87 Difference]: Start difference. First operand 91 states and 123 transitions. Second operand 3 states. [2020-07-10 15:03:22,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:22,197 INFO L93 Difference]: Finished difference Result 181 states and 245 transitions. [2020-07-10 15:03:22,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:22,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 15:03:22,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:22,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:22,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2020-07-10 15:03:22,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:22,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2020-07-10 15:03:22,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2020-07-10 15:03:22,270 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:22,272 INFO L225 Difference]: With dead ends: 181 [2020-07-10 15:03:22,272 INFO L226 Difference]: Without dead ends: 76 [2020-07-10 15:03:22,273 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:22,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-07-10 15:03:22,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2020-07-10 15:03:22,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:22,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 74 states. [2020-07-10 15:03:22,310 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 74 states. [2020-07-10 15:03:22,310 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 74 states. [2020-07-10 15:03:22,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:22,314 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2020-07-10 15:03:22,314 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2020-07-10 15:03:22,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:22,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:22,315 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 76 states. [2020-07-10 15:03:22,315 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 76 states. [2020-07-10 15:03:22,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:22,318 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2020-07-10 15:03:22,318 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2020-07-10 15:03:22,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:22,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:22,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:22,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:22,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-07-10 15:03:22,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 90 transitions. [2020-07-10 15:03:22,322 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 90 transitions. Word has length 23 [2020-07-10 15:03:22,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:22,322 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 90 transitions. [2020-07-10 15:03:22,323 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:22,323 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 90 transitions. [2020-07-10 15:03:22,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-10 15:03:22,324 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:22,324 INFO L422 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] [2020-07-10 15:03:22,325 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 15:03:22,325 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:22,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:22,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1155086362, now seen corresponding path program 1 times [2020-07-10 15:03:22,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:22,326 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645369833] [2020-07-10 15:03:22,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:22,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:22,405 INFO L280 TraceCheckUtils]: 0: Hoare triple {1904#true} assume true; {1904#true} is VALID [2020-07-10 15:03:22,405 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1904#true} {1904#true} #105#return; {1904#true} is VALID [2020-07-10 15:03:22,405 INFO L263 TraceCheckUtils]: 0: Hoare triple {1904#true} call ULTIMATE.init(); {1904#true} is VALID [2020-07-10 15:03:22,406 INFO L280 TraceCheckUtils]: 1: Hoare triple {1904#true} assume true; {1904#true} is VALID [2020-07-10 15:03:22,406 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1904#true} {1904#true} #105#return; {1904#true} is VALID [2020-07-10 15:03:22,406 INFO L263 TraceCheckUtils]: 3: Hoare triple {1904#true} call #t~ret2 := main(); {1904#true} is VALID [2020-07-10 15:03:22,406 INFO L280 TraceCheckUtils]: 4: Hoare triple {1904#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; {1904#true} is VALID [2020-07-10 15:03:22,409 INFO L280 TraceCheckUtils]: 5: Hoare triple {1904#true} assume !false; {1904#true} is VALID [2020-07-10 15:03:22,409 INFO L280 TraceCheckUtils]: 6: Hoare triple {1904#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1904#true} is VALID [2020-07-10 15:03:22,409 INFO L280 TraceCheckUtils]: 7: Hoare triple {1904#true} assume 8466 == ~s__state~0; {1904#true} is VALID [2020-07-10 15:03:22,410 INFO L280 TraceCheckUtils]: 8: Hoare triple {1904#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 2; {1904#true} is VALID [2020-07-10 15:03:22,411 INFO L280 TraceCheckUtils]: 9: Hoare triple {1904#true} assume 0 != ~s__hit~0;~s__state~0 := 8656; {1908#(not (= 0 main_~s__hit~0))} is VALID [2020-07-10 15:03:22,411 INFO L280 TraceCheckUtils]: 10: Hoare triple {1908#(not (= 0 main_~s__hit~0))} assume !false; {1908#(not (= 0 main_~s__hit~0))} is VALID [2020-07-10 15:03:22,412 INFO L280 TraceCheckUtils]: 11: Hoare triple {1908#(not (= 0 main_~s__hit~0))} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1908#(not (= 0 main_~s__hit~0))} is VALID [2020-07-10 15:03:22,412 INFO L280 TraceCheckUtils]: 12: Hoare triple {1908#(not (= 0 main_~s__hit~0))} assume !(8466 == ~s__state~0); {1908#(not (= 0 main_~s__hit~0))} is VALID [2020-07-10 15:03:22,414 INFO L280 TraceCheckUtils]: 13: Hoare triple {1908#(not (= 0 main_~s__hit~0))} assume !(8512 == ~s__state~0); {1908#(not (= 0 main_~s__hit~0))} is VALID [2020-07-10 15:03:22,415 INFO L280 TraceCheckUtils]: 14: Hoare triple {1908#(not (= 0 main_~s__hit~0))} assume !(8640 == ~s__state~0); {1908#(not (= 0 main_~s__hit~0))} is VALID [2020-07-10 15:03:22,416 INFO L280 TraceCheckUtils]: 15: Hoare triple {1908#(not (= 0 main_~s__hit~0))} assume 8656 == ~s__state~0; {1908#(not (= 0 main_~s__hit~0))} is VALID [2020-07-10 15:03:22,416 INFO L280 TraceCheckUtils]: 16: Hoare triple {1908#(not (= 0 main_~s__hit~0))} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {1908#(not (= 0 main_~s__hit~0))} is VALID [2020-07-10 15:03:22,417 INFO L280 TraceCheckUtils]: 17: Hoare triple {1908#(not (= 0 main_~s__hit~0))} assume !(4 == ~blastFlag~0); {1908#(not (= 0 main_~s__hit~0))} is VALID [2020-07-10 15:03:22,417 INFO L280 TraceCheckUtils]: 18: Hoare triple {1908#(not (= 0 main_~s__hit~0))} assume !(5 == ~blastFlag~0); {1908#(not (= 0 main_~s__hit~0))} is VALID [2020-07-10 15:03:22,418 INFO L280 TraceCheckUtils]: 19: Hoare triple {1908#(not (= 0 main_~s__hit~0))} assume 0 != ~s__hit~0;~s__state~0 := 8640; {1908#(not (= 0 main_~s__hit~0))} is VALID [2020-07-10 15:03:22,419 INFO L280 TraceCheckUtils]: 20: Hoare triple {1908#(not (= 0 main_~s__hit~0))} assume !false; {1908#(not (= 0 main_~s__hit~0))} is VALID [2020-07-10 15:03:22,419 INFO L280 TraceCheckUtils]: 21: Hoare triple {1908#(not (= 0 main_~s__hit~0))} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1908#(not (= 0 main_~s__hit~0))} is VALID [2020-07-10 15:03:22,420 INFO L280 TraceCheckUtils]: 22: Hoare triple {1908#(not (= 0 main_~s__hit~0))} assume !(8466 == ~s__state~0); {1908#(not (= 0 main_~s__hit~0))} is VALID [2020-07-10 15:03:22,421 INFO L280 TraceCheckUtils]: 23: Hoare triple {1908#(not (= 0 main_~s__hit~0))} assume !(8512 == ~s__state~0); {1908#(not (= 0 main_~s__hit~0))} is VALID [2020-07-10 15:03:22,421 INFO L280 TraceCheckUtils]: 24: Hoare triple {1908#(not (= 0 main_~s__hit~0))} assume 8640 == ~s__state~0; {1908#(not (= 0 main_~s__hit~0))} is VALID [2020-07-10 15:03:22,422 INFO L280 TraceCheckUtils]: 25: Hoare triple {1908#(not (= 0 main_~s__hit~0))} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {1908#(not (= 0 main_~s__hit~0))} is VALID [2020-07-10 15:03:22,422 INFO L280 TraceCheckUtils]: 26: Hoare triple {1908#(not (= 0 main_~s__hit~0))} assume !(0 != ~s__hit~0);~s__state~0 := 8656; {1905#false} is VALID [2020-07-10 15:03:22,423 INFO L280 TraceCheckUtils]: 27: Hoare triple {1905#false} assume !false; {1905#false} is VALID [2020-07-10 15:03:22,423 INFO L280 TraceCheckUtils]: 28: Hoare triple {1905#false} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1905#false} is VALID [2020-07-10 15:03:22,423 INFO L280 TraceCheckUtils]: 29: Hoare triple {1905#false} assume !(8466 == ~s__state~0); {1905#false} is VALID [2020-07-10 15:03:22,423 INFO L280 TraceCheckUtils]: 30: Hoare triple {1905#false} assume !(8512 == ~s__state~0); {1905#false} is VALID [2020-07-10 15:03:22,424 INFO L280 TraceCheckUtils]: 31: Hoare triple {1905#false} assume !(8640 == ~s__state~0); {1905#false} is VALID [2020-07-10 15:03:22,424 INFO L280 TraceCheckUtils]: 32: Hoare triple {1905#false} assume 8656 == ~s__state~0; {1905#false} is VALID [2020-07-10 15:03:22,424 INFO L280 TraceCheckUtils]: 33: Hoare triple {1905#false} assume !(2 == ~blastFlag~0); {1905#false} is VALID [2020-07-10 15:03:22,424 INFO L280 TraceCheckUtils]: 34: Hoare triple {1905#false} assume !(4 == ~blastFlag~0); {1905#false} is VALID [2020-07-10 15:03:22,425 INFO L280 TraceCheckUtils]: 35: Hoare triple {1905#false} assume 5 == ~blastFlag~0; {1905#false} is VALID [2020-07-10 15:03:22,425 INFO L280 TraceCheckUtils]: 36: Hoare triple {1905#false} assume !false; {1905#false} is VALID [2020-07-10 15:03:22,428 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-10 15:03:22,428 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645369833] [2020-07-10 15:03:22,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:22,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:22,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550932670] [2020-07-10 15:03:22,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-07-10 15:03:22,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:22,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:22,467 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:22,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:22,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:22,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:22,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:22,469 INFO L87 Difference]: Start difference. First operand 74 states and 90 transitions. Second operand 3 states. [2020-07-10 15:03:22,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:22,547 INFO L93 Difference]: Finished difference Result 124 states and 147 transitions. [2020-07-10 15:03:22,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:22,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-07-10 15:03:22,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:22,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:22,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2020-07-10 15:03:22,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:22,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2020-07-10 15:03:22,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2020-07-10 15:03:22,609 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:22,609 INFO L225 Difference]: With dead ends: 124 [2020-07-10 15:03:22,610 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:03:22,611 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:22,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:03:22,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:03:22,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:22,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:03:22,612 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:03:22,612 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:03:22,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:22,612 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:03:22,612 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:03:22,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:22,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:22,613 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:03:22,613 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:03:22,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:22,613 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:03:22,613 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:03:22,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:22,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:22,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:22,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:22,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:03:22,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:03:22,615 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2020-07-10 15:03:22,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:22,615 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:03:22,615 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:22,615 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:03:22,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:22,615 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 15:03:22,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:03:22,797 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 15:03:22,797 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:03:22,798 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:03:22,798 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:03:22,798 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:03:22,798 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:03:22,798 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 8 140) no Hoare annotation was computed. [2020-07-10 15:03:22,798 INFO L268 CegarLoopResult]: For program point L77-1(lines 53 106) no Hoare annotation was computed. [2020-07-10 15:03:22,798 INFO L268 CegarLoopResult]: For program point L69(lines 69 73) no Hoare annotation was computed. [2020-07-10 15:03:22,798 INFO L268 CegarLoopResult]: For program point L24(lines 24 127) no Hoare annotation was computed. [2020-07-10 15:03:22,798 INFO L268 CegarLoopResult]: For program point L57-1(lines 53 106) no Hoare annotation was computed. [2020-07-10 15:03:22,799 INFO L268 CegarLoopResult]: For program point L49(lines 49 108) no Hoare annotation was computed. [2020-07-10 15:03:22,799 INFO L268 CegarLoopResult]: For program point L45(lines 45 110) no Hoare annotation was computed. [2020-07-10 15:03:22,799 INFO L271 CegarLoopResult]: At program point L136(lines 8 140) the Hoare annotation is: true [2020-07-10 15:03:22,799 INFO L264 CegarLoopResult]: At program point L99(lines 17 134) the Hoare annotation is: (or (and (not (= 0 main_~s__hit~0)) (<= main_~blastFlag~0 3) (<= 8640 main_~s__state~0)) (<= main_~blastFlag~0 2)) [2020-07-10 15:03:22,799 INFO L268 CegarLoopResult]: For program point L95(lines 95 97) no Hoare annotation was computed. [2020-07-10 15:03:22,799 INFO L268 CegarLoopResult]: For program point L29(lines 29 124) no Hoare annotation was computed. [2020-07-10 15:03:22,799 INFO L264 CegarLoopResult]: At program point L25(lines 24 127) the Hoare annotation is: (<= main_~blastFlag~0 2) [2020-07-10 15:03:22,800 INFO L264 CegarLoopResult]: At program point L50(lines 49 108) the Hoare annotation is: (let ((.cse0 (<= 8656 main_~s__state~0))) (or (and .cse0 (<= main_~blastFlag~0 2)) (and .cse0 (not (= 0 main_~s__hit~0)) (<= main_~blastFlag~0 3)))) [2020-07-10 15:03:22,800 INFO L264 CegarLoopResult]: At program point L46(lines 45 110) the Hoare annotation is: (let ((.cse0 (<= 8640 main_~s__state~0))) (or (and (<= main_~blastFlag~0 2) .cse0) (and (not (= 0 main_~s__hit~0)) (<= main_~blastFlag~0 3) .cse0))) [2020-07-10 15:03:22,800 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 8 140) no Hoare annotation was computed. [2020-07-10 15:03:22,800 INFO L264 CegarLoopResult]: At program point L96(lines 8 140) the Hoare annotation is: false [2020-07-10 15:03:22,800 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 138) no Hoare annotation was computed. [2020-07-10 15:03:22,801 INFO L264 CegarLoopResult]: At program point L30(lines 29 124) the Hoare annotation is: (<= main_~blastFlag~0 2) [2020-07-10 15:03:22,801 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 8 140) the Hoare annotation is: true [2020-07-10 15:03:22,801 INFO L268 CegarLoopResult]: For program point L92-1(lines 53 106) no Hoare annotation was computed. [2020-07-10 15:03:22,801 INFO L268 CegarLoopResult]: For program point L88-1(lines 53 106) no Hoare annotation was computed. [2020-07-10 15:03:22,801 INFO L268 CegarLoopResult]: For program point L18(line 18) no Hoare annotation was computed. [2020-07-10 15:03:22,806 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:03:22,807 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:03:22,807 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:03:22,808 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-10 15:03:22,808 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:03:22,808 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:03:22,808 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-10 15:03:22,808 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-10 15:03:22,808 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:03:22,808 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2020-07-10 15:03:22,808 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:03:22,809 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-10 15:03:22,809 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-10 15:03:22,809 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:03:22,809 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2020-07-10 15:03:22,809 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2020-07-10 15:03:22,809 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-10 15:03:22,809 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-10 15:03:22,809 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2020-07-10 15:03:22,809 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2020-07-10 15:03:22,810 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2020-07-10 15:03:22,810 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2020-07-10 15:03:22,810 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2020-07-10 15:03:22,810 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2020-07-10 15:03:22,810 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2020-07-10 15:03:22,810 WARN L170 areAnnotationChecker]: L77-1 has no Hoare annotation [2020-07-10 15:03:22,810 WARN L170 areAnnotationChecker]: L77-1 has no Hoare annotation [2020-07-10 15:03:22,810 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-10 15:03:22,810 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-10 15:03:22,811 WARN L170 areAnnotationChecker]: L77-1 has no Hoare annotation [2020-07-10 15:03:22,811 WARN L170 areAnnotationChecker]: L77-1 has no Hoare annotation [2020-07-10 15:03:22,811 WARN L170 areAnnotationChecker]: L88-1 has no Hoare annotation [2020-07-10 15:03:22,811 WARN L170 areAnnotationChecker]: L88-1 has no Hoare annotation [2020-07-10 15:03:22,811 WARN L170 areAnnotationChecker]: L88-1 has no Hoare annotation [2020-07-10 15:03:22,811 WARN L170 areAnnotationChecker]: L88-1 has no Hoare annotation [2020-07-10 15:03:22,811 WARN L170 areAnnotationChecker]: L92-1 has no Hoare annotation [2020-07-10 15:03:22,811 WARN L170 areAnnotationChecker]: L92-1 has no Hoare annotation [2020-07-10 15:03:22,812 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2020-07-10 15:03:22,812 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2020-07-10 15:03:22,812 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. [2020-07-10 15:03:22,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:03:22 BoogieIcfgContainer [2020-07-10 15:03:22,826 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:03:22,830 INFO L168 Benchmark]: Toolchain (without parser) took 3592.48 ms. Allocated memory was 137.9 MB in the beginning and 249.0 MB in the end (delta: 111.1 MB). Free memory was 103.2 MB in the beginning and 197.2 MB in the end (delta: -94.0 MB). Peak memory consumption was 17.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:03:22,831 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 15:03:22,832 INFO L168 Benchmark]: CACSL2BoogieTranslator took 249.64 ms. Allocated memory is still 137.9 MB. Free memory was 103.0 MB in the beginning and 92.4 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2020-07-10 15:03:22,833 INFO L168 Benchmark]: Boogie Preprocessor took 116.55 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 92.4 MB in the beginning and 179.5 MB in the end (delta: -87.0 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:03:22,833 INFO L168 Benchmark]: RCFGBuilder took 439.94 ms. Allocated memory is still 201.3 MB. Free memory was 179.5 MB in the beginning and 159.8 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:03:22,834 INFO L168 Benchmark]: TraceAbstraction took 2781.05 ms. Allocated memory was 201.3 MB in the beginning and 249.0 MB in the end (delta: 47.7 MB). Free memory was 159.8 MB in the beginning and 197.2 MB in the end (delta: -37.4 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:03:22,838 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.51 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 249.64 ms. Allocated memory is still 137.9 MB. Free memory was 103.0 MB in the beginning and 92.4 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 116.55 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 92.4 MB in the beginning and 179.5 MB in the end (delta: -87.0 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 439.94 ms. Allocated memory is still 201.3 MB. Free memory was 179.5 MB in the beginning and 159.8 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2781.05 ms. Allocated memory was 201.3 MB in the beginning and 249.0 MB in the end (delta: 47.7 MB). Free memory was 159.8 MB in the beginning and 197.2 MB in the end (delta: -37.4 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 138]: 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: 49]: Loop Invariant Derived loop invariant: (8656 <= s__state && blastFlag <= 2) || ((8656 <= s__state && !(0 == s__hit)) && blastFlag <= 3) - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((!(0 == s__hit) && blastFlag <= 3) && 8640 <= s__state) || blastFlag <= 2 - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && 8640 <= s__state) || ((!(0 == s__hit) && blastFlag <= 3) && 8640 <= s__state) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.5s, OverallIterations: 6, TraceHistogramMax: 4, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 184 SDtfs, 92 SDslu, 109 SDs, 0 SdLazy, 95 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 24 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 DumpTime, AutomataMinimizationStatistics: 0.2s 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: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s 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, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...