/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/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_1b.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 18:55:24,732 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 18:55:24,735 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 18:55:24,747 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 18:55:24,747 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 18:55:24,748 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 18:55:24,750 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 18:55:24,752 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 18:55:24,753 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 18:55:24,754 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 18:55:24,755 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 18:55:24,756 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 18:55:24,759 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 18:55:24,760 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 18:55:24,761 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 18:55:24,765 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 18:55:24,766 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 18:55:24,767 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 18:55:24,769 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 18:55:24,772 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 18:55:24,775 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 18:55:24,776 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 18:55:24,777 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 18:55:24,778 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 18:55:24,780 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 18:55:24,780 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 18:55:24,780 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 18:55:24,781 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 18:55:24,782 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 18:55:24,783 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 18:55:24,783 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 18:55:24,783 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 18:55:24,784 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 18:55:24,785 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 18:55:24,786 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 18:55:24,786 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 18:55:24,787 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 18:55:24,787 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 18:55:24,787 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 18:55:24,788 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 18:55:24,789 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 18:55:24,789 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 18:55:24,798 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 18:55:24,798 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 18:55:24,800 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 18:55:24,800 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 18:55:24,800 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 18:55:24,800 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 18:55:24,800 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 18:55:24,801 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 18:55:24,801 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 18:55:24,801 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 18:55:24,801 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 18:55:24,801 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 18:55:24,802 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 18:55:24,802 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 18:55:24,802 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 18:55:24,802 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 18:55:24,802 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 18:55:24,803 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 18:55:24,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 18:55:24,803 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 18:55:24,803 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 18:55:24,803 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 18:55:24,804 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 18:55:25,082 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 18:55:25,101 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 18:55:25,103 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 18:55:25,105 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 18:55:25,105 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 18:55:25,105 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 18:55:25,175 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d13bfbe2/bb951ff0d2654b5a9ca7e9997fd784b6/FLAG3bc9c2777 [2020-07-10 18:55:25,621 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 18:55:25,622 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_1b.cil.c [2020-07-10 18:55:25,633 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d13bfbe2/bb951ff0d2654b5a9ca7e9997fd784b6/FLAG3bc9c2777 [2020-07-10 18:55:25,993 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d13bfbe2/bb951ff0d2654b5a9ca7e9997fd784b6 [2020-07-10 18:55:26,002 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 18:55:26,004 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 18:55:26,005 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 18:55:26,005 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 18:55:26,008 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 18:55:26,010 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:55:25" (1/1) ... [2020-07-10 18:55:26,013 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63214a85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:55:26, skipping insertion in model container [2020-07-10 18:55:26,013 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:55:25" (1/1) ... [2020-07-10 18:55:26,021 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 18:55:26,041 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 18:55:26,218 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:55:26,225 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 18:55:26,247 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:55:26,261 INFO L208 MainTranslator]: Completed translation [2020-07-10 18:55:26,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:55:26 WrapperNode [2020-07-10 18:55:26,262 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 18:55:26,263 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 18:55:26,263 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 18:55:26,263 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 18:55:26,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:55:26" (1/1) ... [2020-07-10 18:55:26,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:55:26" (1/1) ... [2020-07-10 18:55:26,282 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:55:26" (1/1) ... [2020-07-10 18:55:26,283 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:55:26" (1/1) ... [2020-07-10 18:55:26,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:55:26" (1/1) ... [2020-07-10 18:55:26,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:55:26" (1/1) ... [2020-07-10 18:55:26,384 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:55:26" (1/1) ... [2020-07-10 18:55:26,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 18:55:26,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 18:55:26,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 18:55:26,387 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 18:55:26,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:55:26" (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 18:55:26,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 18:55:26,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 18:55:26,455 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 18:55:26,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 18:55:26,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-07-10 18:55:26,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 18:55:26,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2020-07-10 18:55:26,456 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 18:55:26,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 18:55:26,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 18:55:26,816 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 18:55:26,817 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 18:55:26,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:55:26 BoogieIcfgContainer [2020-07-10 18:55:26,821 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 18:55:26,822 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 18:55:26,822 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 18:55:26,825 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 18:55:26,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 06:55:25" (1/3) ... [2020-07-10 18:55:26,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21ca6902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:55:26, skipping insertion in model container [2020-07-10 18:55:26,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:55:26" (2/3) ... [2020-07-10 18:55:26,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21ca6902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:55:26, skipping insertion in model container [2020-07-10 18:55:26,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:55:26" (3/3) ... [2020-07-10 18:55:26,829 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1b.cil.c [2020-07-10 18:55:26,839 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 18:55:26,852 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 18:55:26,862 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 18:55:26,882 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 18:55:26,883 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 18:55:26,883 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 18:55:26,883 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 18:55:26,883 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 18:55:26,883 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 18:55:26,883 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 18:55:26,884 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 18:55:26,899 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2020-07-10 18:55:26,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-10 18:55:26,909 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:55:26,910 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:55:26,910 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:55:26,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:55:26,917 INFO L82 PathProgramCache]: Analyzing trace with hash -936940309, now seen corresponding path program 1 times [2020-07-10 18:55:26,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:55:26,924 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [743754545] [2020-07-10 18:55:26,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:55:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:55:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:55:27,119 INFO L280 TraceCheckUtils]: 0: Hoare triple {51#true} assume true; {51#true} is VALID [2020-07-10 18:55:27,120 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {51#true} {51#true} #125#return; {51#true} is VALID [2020-07-10 18:55:27,123 INFO L263 TraceCheckUtils]: 0: Hoare triple {51#true} call ULTIMATE.init(); {51#true} is VALID [2020-07-10 18:55:27,124 INFO L280 TraceCheckUtils]: 1: Hoare triple {51#true} assume true; {51#true} is VALID [2020-07-10 18:55:27,124 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {51#true} {51#true} #125#return; {51#true} is VALID [2020-07-10 18:55:27,125 INFO L263 TraceCheckUtils]: 3: Hoare triple {51#true} call #t~ret2 := main(); {51#true} is VALID [2020-07-10 18:55:27,125 INFO L280 TraceCheckUtils]: 4: Hoare triple {51#true} havoc ~s__state~0; {51#true} is VALID [2020-07-10 18:55:27,126 INFO L280 TraceCheckUtils]: 5: Hoare triple {51#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {51#true} is VALID [2020-07-10 18:55:27,126 INFO L280 TraceCheckUtils]: 6: Hoare triple {51#true} ~s__hit~0 := #t~nondet0; {51#true} is VALID [2020-07-10 18:55:27,127 INFO L280 TraceCheckUtils]: 7: Hoare triple {51#true} havoc #t~nondet0; {51#true} is VALID [2020-07-10 18:55:27,127 INFO L280 TraceCheckUtils]: 8: Hoare triple {51#true} havoc ~blastFlag~0; {51#true} is VALID [2020-07-10 18:55:27,128 INFO L280 TraceCheckUtils]: 9: Hoare triple {51#true} havoc ~tmp___1~0; {51#true} is VALID [2020-07-10 18:55:27,128 INFO L280 TraceCheckUtils]: 10: Hoare triple {51#true} ~s__state~0 := 8466; {51#true} is VALID [2020-07-10 18:55:27,130 INFO L280 TraceCheckUtils]: 11: Hoare triple {51#true} ~blastFlag~0 := 0; {55#(<= main_~blastFlag~0 0)} is VALID [2020-07-10 18:55:27,132 INFO L280 TraceCheckUtils]: 12: Hoare triple {55#(<= main_~blastFlag~0 0)} assume !false; {55#(<= main_~blastFlag~0 0)} is VALID [2020-07-10 18:55:27,134 INFO L280 TraceCheckUtils]: 13: Hoare triple {55#(<= main_~blastFlag~0 0)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {52#false} is VALID [2020-07-10 18:55:27,135 INFO L280 TraceCheckUtils]: 14: Hoare triple {52#false} assume !false; {52#false} is VALID [2020-07-10 18:55:27,137 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 18:55:27,138 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:55:27,140 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [743754545] [2020-07-10 18:55:27,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:55:27,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 18:55:27,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042795995] [2020-07-10 18:55:27,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-07-10 18:55:27,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:55:27,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 18:55:27,192 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:55:27,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 18:55:27,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:55:27,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 18:55:27,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:55:27,204 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 3 states. [2020-07-10 18:55:27,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:55:27,505 INFO L93 Difference]: Finished difference Result 110 states and 156 transitions. [2020-07-10 18:55:27,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 18:55:27,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-07-10 18:55:27,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:55:27,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:55:27,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2020-07-10 18:55:27,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:55:27,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2020-07-10 18:55:27,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 156 transitions. [2020-07-10 18:55:27,745 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:55:27,760 INFO L225 Difference]: With dead ends: 110 [2020-07-10 18:55:27,761 INFO L226 Difference]: Without dead ends: 66 [2020-07-10 18:55:27,765 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 18:55:27,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-10 18:55:27,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-07-10 18:55:27,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:55:27,849 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 66 states. [2020-07-10 18:55:27,850 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2020-07-10 18:55:27,850 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2020-07-10 18:55:27,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:55:27,859 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2020-07-10 18:55:27,859 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2020-07-10 18:55:27,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:55:27,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:55:27,861 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2020-07-10 18:55:27,861 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2020-07-10 18:55:27,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:55:27,868 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2020-07-10 18:55:27,868 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2020-07-10 18:55:27,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:55:27,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:55:27,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:55:27,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:55:27,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-10 18:55:27,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2020-07-10 18:55:27,877 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 15 [2020-07-10 18:55:27,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:55:27,878 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2020-07-10 18:55:27,878 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 18:55:27,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 66 states and 82 transitions. [2020-07-10 18:55:27,983 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:55:27,983 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2020-07-10 18:55:27,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 18:55:27,985 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:55:27,985 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:55:27,985 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 18:55:27,985 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:55:27,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:55:27,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1261763386, now seen corresponding path program 1 times [2020-07-10 18:55:27,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:55:27,987 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1953092478] [2020-07-10 18:55:27,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:55:28,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:55:28,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:55:28,047 INFO L280 TraceCheckUtils]: 0: Hoare triple {542#true} assume true; {542#true} is VALID [2020-07-10 18:55:28,047 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {542#true} {542#true} #125#return; {542#true} is VALID [2020-07-10 18:55:28,047 INFO L263 TraceCheckUtils]: 0: Hoare triple {542#true} call ULTIMATE.init(); {542#true} is VALID [2020-07-10 18:55:28,048 INFO L280 TraceCheckUtils]: 1: Hoare triple {542#true} assume true; {542#true} is VALID [2020-07-10 18:55:28,048 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {542#true} {542#true} #125#return; {542#true} is VALID [2020-07-10 18:55:28,049 INFO L263 TraceCheckUtils]: 3: Hoare triple {542#true} call #t~ret2 := main(); {542#true} is VALID [2020-07-10 18:55:28,049 INFO L280 TraceCheckUtils]: 4: Hoare triple {542#true} havoc ~s__state~0; {542#true} is VALID [2020-07-10 18:55:28,049 INFO L280 TraceCheckUtils]: 5: Hoare triple {542#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {542#true} is VALID [2020-07-10 18:55:28,050 INFO L280 TraceCheckUtils]: 6: Hoare triple {542#true} ~s__hit~0 := #t~nondet0; {542#true} is VALID [2020-07-10 18:55:28,050 INFO L280 TraceCheckUtils]: 7: Hoare triple {542#true} havoc #t~nondet0; {542#true} is VALID [2020-07-10 18:55:28,050 INFO L280 TraceCheckUtils]: 8: Hoare triple {542#true} havoc ~blastFlag~0; {542#true} is VALID [2020-07-10 18:55:28,051 INFO L280 TraceCheckUtils]: 9: Hoare triple {542#true} havoc ~tmp___1~0; {542#true} is VALID [2020-07-10 18:55:28,051 INFO L280 TraceCheckUtils]: 10: Hoare triple {542#true} ~s__state~0 := 8466; {542#true} is VALID [2020-07-10 18:55:28,051 INFO L280 TraceCheckUtils]: 11: Hoare triple {542#true} ~blastFlag~0 := 0; {542#true} is VALID [2020-07-10 18:55:28,051 INFO L280 TraceCheckUtils]: 12: Hoare triple {542#true} assume !false; {542#true} is VALID [2020-07-10 18:55:28,052 INFO L280 TraceCheckUtils]: 13: Hoare triple {542#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {542#true} is VALID [2020-07-10 18:55:28,052 INFO L280 TraceCheckUtils]: 14: Hoare triple {542#true} assume 8466 == ~s__state~0; {542#true} is VALID [2020-07-10 18:55:28,052 INFO L280 TraceCheckUtils]: 15: Hoare triple {542#true} assume 0 == ~blastFlag~0; {542#true} is VALID [2020-07-10 18:55:28,053 INFO L280 TraceCheckUtils]: 16: Hoare triple {542#true} ~blastFlag~0 := 2; {542#true} is VALID [2020-07-10 18:55:28,053 INFO L280 TraceCheckUtils]: 17: Hoare triple {542#true} assume 0 != ~s__hit~0; {542#true} is VALID [2020-07-10 18:55:28,054 INFO L280 TraceCheckUtils]: 18: Hoare triple {542#true} ~s__state~0 := 8656; {546#(<= 8656 main_~s__state~0)} is VALID [2020-07-10 18:55:28,055 INFO L280 TraceCheckUtils]: 19: Hoare triple {546#(<= 8656 main_~s__state~0)} assume !false; {546#(<= 8656 main_~s__state~0)} is VALID [2020-07-10 18:55:28,056 INFO L280 TraceCheckUtils]: 20: Hoare triple {546#(<= 8656 main_~s__state~0)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {543#false} is VALID [2020-07-10 18:55:28,056 INFO L280 TraceCheckUtils]: 21: Hoare triple {543#false} assume !false; {543#false} is VALID [2020-07-10 18:55:28,058 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 18:55:28,058 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:55:28,059 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1953092478] [2020-07-10 18:55:28,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:55:28,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 18:55:28,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159940698] [2020-07-10 18:55:28,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 18:55:28,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:55:28,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 18:55:28,084 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:55:28,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 18:55:28,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:55:28,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 18:55:28,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:55:28,086 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand 3 states. [2020-07-10 18:55:28,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:55:28,313 INFO L93 Difference]: Finished difference Result 134 states and 172 transitions. [2020-07-10 18:55:28,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 18:55:28,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 18:55:28,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:55:28,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:55:28,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2020-07-10 18:55:28,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:55:28,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2020-07-10 18:55:28,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 103 transitions. [2020-07-10 18:55:28,444 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:55:28,448 INFO L225 Difference]: With dead ends: 134 [2020-07-10 18:55:28,449 INFO L226 Difference]: Without dead ends: 80 [2020-07-10 18:55:28,451 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 18:55:28,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-07-10 18:55:28,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2020-07-10 18:55:28,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:55:28,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 76 states. [2020-07-10 18:55:28,525 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 76 states. [2020-07-10 18:55:28,525 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 76 states. [2020-07-10 18:55:28,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:55:28,530 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2020-07-10 18:55:28,531 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2020-07-10 18:55:28,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:55:28,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:55:28,532 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 80 states. [2020-07-10 18:55:28,533 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 80 states. [2020-07-10 18:55:28,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:55:28,537 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2020-07-10 18:55:28,538 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2020-07-10 18:55:28,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:55:28,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:55:28,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:55:28,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:55:28,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-10 18:55:28,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 92 transitions. [2020-07-10 18:55:28,544 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 92 transitions. Word has length 22 [2020-07-10 18:55:28,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:55:28,544 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 92 transitions. [2020-07-10 18:55:28,544 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 18:55:28,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 76 states and 92 transitions. [2020-07-10 18:55:28,661 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:55:28,662 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 92 transitions. [2020-07-10 18:55:28,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 18:55:28,663 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:55:28,663 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:55:28,663 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 18:55:28,663 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:55:28,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:55:28,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1258903450, now seen corresponding path program 1 times [2020-07-10 18:55:28,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:55:28,664 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [309833412] [2020-07-10 18:55:28,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:55:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:55:28,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:55:28,720 INFO L280 TraceCheckUtils]: 0: Hoare triple {1129#true} assume true; {1129#true} is VALID [2020-07-10 18:55:28,721 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1129#true} {1129#true} #125#return; {1129#true} is VALID [2020-07-10 18:55:28,721 INFO L263 TraceCheckUtils]: 0: Hoare triple {1129#true} call ULTIMATE.init(); {1129#true} is VALID [2020-07-10 18:55:28,721 INFO L280 TraceCheckUtils]: 1: Hoare triple {1129#true} assume true; {1129#true} is VALID [2020-07-10 18:55:28,722 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1129#true} {1129#true} #125#return; {1129#true} is VALID [2020-07-10 18:55:28,722 INFO L263 TraceCheckUtils]: 3: Hoare triple {1129#true} call #t~ret2 := main(); {1129#true} is VALID [2020-07-10 18:55:28,722 INFO L280 TraceCheckUtils]: 4: Hoare triple {1129#true} havoc ~s__state~0; {1129#true} is VALID [2020-07-10 18:55:28,723 INFO L280 TraceCheckUtils]: 5: Hoare triple {1129#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1129#true} is VALID [2020-07-10 18:55:28,723 INFO L280 TraceCheckUtils]: 6: Hoare triple {1129#true} ~s__hit~0 := #t~nondet0; {1129#true} is VALID [2020-07-10 18:55:28,723 INFO L280 TraceCheckUtils]: 7: Hoare triple {1129#true} havoc #t~nondet0; {1129#true} is VALID [2020-07-10 18:55:28,724 INFO L280 TraceCheckUtils]: 8: Hoare triple {1129#true} havoc ~blastFlag~0; {1129#true} is VALID [2020-07-10 18:55:28,724 INFO L280 TraceCheckUtils]: 9: Hoare triple {1129#true} havoc ~tmp___1~0; {1129#true} is VALID [2020-07-10 18:55:28,724 INFO L280 TraceCheckUtils]: 10: Hoare triple {1129#true} ~s__state~0 := 8466; {1129#true} is VALID [2020-07-10 18:55:28,725 INFO L280 TraceCheckUtils]: 11: Hoare triple {1129#true} ~blastFlag~0 := 0; {1129#true} is VALID [2020-07-10 18:55:28,725 INFO L280 TraceCheckUtils]: 12: Hoare triple {1129#true} assume !false; {1129#true} is VALID [2020-07-10 18:55:28,725 INFO L280 TraceCheckUtils]: 13: Hoare triple {1129#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1129#true} is VALID [2020-07-10 18:55:28,725 INFO L280 TraceCheckUtils]: 14: Hoare triple {1129#true} assume 8466 == ~s__state~0; {1129#true} is VALID [2020-07-10 18:55:28,726 INFO L280 TraceCheckUtils]: 15: Hoare triple {1129#true} assume 0 == ~blastFlag~0; {1129#true} is VALID [2020-07-10 18:55:28,727 INFO L280 TraceCheckUtils]: 16: Hoare triple {1129#true} ~blastFlag~0 := 2; {1133#(<= main_~blastFlag~0 2)} is VALID [2020-07-10 18:55:28,727 INFO L280 TraceCheckUtils]: 17: Hoare triple {1133#(<= main_~blastFlag~0 2)} assume !(0 != ~s__hit~0); {1133#(<= main_~blastFlag~0 2)} is VALID [2020-07-10 18:55:28,728 INFO L280 TraceCheckUtils]: 18: Hoare triple {1133#(<= main_~blastFlag~0 2)} ~s__state~0 := 8512; {1133#(<= main_~blastFlag~0 2)} is VALID [2020-07-10 18:55:28,729 INFO L280 TraceCheckUtils]: 19: Hoare triple {1133#(<= main_~blastFlag~0 2)} assume !false; {1133#(<= main_~blastFlag~0 2)} is VALID [2020-07-10 18:55:28,730 INFO L280 TraceCheckUtils]: 20: Hoare triple {1133#(<= main_~blastFlag~0 2)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {1130#false} is VALID [2020-07-10 18:55:28,730 INFO L280 TraceCheckUtils]: 21: Hoare triple {1130#false} assume !false; {1130#false} is VALID [2020-07-10 18:55:28,731 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 18:55:28,731 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:55:28,731 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [309833412] [2020-07-10 18:55:28,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:55:28,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 18:55:28,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951975993] [2020-07-10 18:55:28,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 18:55:28,733 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:55:28,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 18:55:28,754 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:55:28,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 18:55:28,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:55:28,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 18:55:28,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:55:28,756 INFO L87 Difference]: Start difference. First operand 76 states and 92 transitions. Second operand 3 states. [2020-07-10 18:55:28,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:55:28,972 INFO L93 Difference]: Finished difference Result 140 states and 177 transitions. [2020-07-10 18:55:28,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 18:55:28,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 18:55:28,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:55:28,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:55:28,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2020-07-10 18:55:28,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:55:28,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2020-07-10 18:55:28,979 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 127 transitions. [2020-07-10 18:55:29,098 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:55:29,101 INFO L225 Difference]: With dead ends: 140 [2020-07-10 18:55:29,102 INFO L226 Difference]: Without dead ends: 105 [2020-07-10 18:55:29,103 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 18:55:29,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-07-10 18:55:29,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2020-07-10 18:55:29,207 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:55:29,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 105 states. [2020-07-10 18:55:29,208 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 105 states. [2020-07-10 18:55:29,208 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 105 states. [2020-07-10 18:55:29,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:55:29,213 INFO L93 Difference]: Finished difference Result 105 states and 128 transitions. [2020-07-10 18:55:29,213 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2020-07-10 18:55:29,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:55:29,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:55:29,215 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 105 states. [2020-07-10 18:55:29,215 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 105 states. [2020-07-10 18:55:29,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:55:29,220 INFO L93 Difference]: Finished difference Result 105 states and 128 transitions. [2020-07-10 18:55:29,221 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2020-07-10 18:55:29,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:55:29,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:55:29,222 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:55:29,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:55:29,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-07-10 18:55:29,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2020-07-10 18:55:29,227 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 22 [2020-07-10 18:55:29,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:55:29,227 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2020-07-10 18:55:29,227 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 18:55:29,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 105 states and 128 transitions. [2020-07-10 18:55:29,365 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:55:29,365 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2020-07-10 18:55:29,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 18:55:29,366 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:55:29,366 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:55:29,366 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 18:55:29,367 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:55:29,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:55:29,367 INFO L82 PathProgramCache]: Analyzing trace with hash 122238776, now seen corresponding path program 1 times [2020-07-10 18:55:29,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:55:29,367 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1950112748] [2020-07-10 18:55:29,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:55:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:55:29,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:55:29,415 INFO L280 TraceCheckUtils]: 0: Hoare triple {1836#true} assume true; {1836#true} is VALID [2020-07-10 18:55:29,415 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1836#true} {1836#true} #125#return; {1836#true} is VALID [2020-07-10 18:55:29,416 INFO L263 TraceCheckUtils]: 0: Hoare triple {1836#true} call ULTIMATE.init(); {1836#true} is VALID [2020-07-10 18:55:29,416 INFO L280 TraceCheckUtils]: 1: Hoare triple {1836#true} assume true; {1836#true} is VALID [2020-07-10 18:55:29,416 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1836#true} {1836#true} #125#return; {1836#true} is VALID [2020-07-10 18:55:29,416 INFO L263 TraceCheckUtils]: 3: Hoare triple {1836#true} call #t~ret2 := main(); {1836#true} is VALID [2020-07-10 18:55:29,417 INFO L280 TraceCheckUtils]: 4: Hoare triple {1836#true} havoc ~s__state~0; {1836#true} is VALID [2020-07-10 18:55:29,417 INFO L280 TraceCheckUtils]: 5: Hoare triple {1836#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1836#true} is VALID [2020-07-10 18:55:29,417 INFO L280 TraceCheckUtils]: 6: Hoare triple {1836#true} ~s__hit~0 := #t~nondet0; {1836#true} is VALID [2020-07-10 18:55:29,418 INFO L280 TraceCheckUtils]: 7: Hoare triple {1836#true} havoc #t~nondet0; {1836#true} is VALID [2020-07-10 18:55:29,418 INFO L280 TraceCheckUtils]: 8: Hoare triple {1836#true} havoc ~blastFlag~0; {1836#true} is VALID [2020-07-10 18:55:29,418 INFO L280 TraceCheckUtils]: 9: Hoare triple {1836#true} havoc ~tmp___1~0; {1836#true} is VALID [2020-07-10 18:55:29,418 INFO L280 TraceCheckUtils]: 10: Hoare triple {1836#true} ~s__state~0 := 8466; {1836#true} is VALID [2020-07-10 18:55:29,419 INFO L280 TraceCheckUtils]: 11: Hoare triple {1836#true} ~blastFlag~0 := 0; {1836#true} is VALID [2020-07-10 18:55:29,419 INFO L280 TraceCheckUtils]: 12: Hoare triple {1836#true} assume !false; {1836#true} is VALID [2020-07-10 18:55:29,420 INFO L280 TraceCheckUtils]: 13: Hoare triple {1836#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1836#true} is VALID [2020-07-10 18:55:29,420 INFO L280 TraceCheckUtils]: 14: Hoare triple {1836#true} assume 8466 == ~s__state~0; {1836#true} is VALID [2020-07-10 18:55:29,420 INFO L280 TraceCheckUtils]: 15: Hoare triple {1836#true} assume 0 == ~blastFlag~0; {1836#true} is VALID [2020-07-10 18:55:29,421 INFO L280 TraceCheckUtils]: 16: Hoare triple {1836#true} ~blastFlag~0 := 2; {1836#true} is VALID [2020-07-10 18:55:29,421 INFO L280 TraceCheckUtils]: 17: Hoare triple {1836#true} assume 0 != ~s__hit~0; {1836#true} is VALID [2020-07-10 18:55:29,421 INFO L280 TraceCheckUtils]: 18: Hoare triple {1836#true} ~s__state~0 := 8656; {1836#true} is VALID [2020-07-10 18:55:29,422 INFO L280 TraceCheckUtils]: 19: Hoare triple {1836#true} assume !false; {1836#true} is VALID [2020-07-10 18:55:29,422 INFO L280 TraceCheckUtils]: 20: Hoare triple {1836#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1836#true} is VALID [2020-07-10 18:55:29,423 INFO L280 TraceCheckUtils]: 21: Hoare triple {1836#true} assume !(8466 == ~s__state~0); {1836#true} is VALID [2020-07-10 18:55:29,424 INFO L280 TraceCheckUtils]: 22: Hoare triple {1836#true} assume !(8512 == ~s__state~0); {1836#true} is VALID [2020-07-10 18:55:29,424 INFO L280 TraceCheckUtils]: 23: Hoare triple {1836#true} assume !(8640 == ~s__state~0); {1836#true} is VALID [2020-07-10 18:55:29,424 INFO L280 TraceCheckUtils]: 24: Hoare triple {1836#true} assume 8656 == ~s__state~0; {1836#true} is VALID [2020-07-10 18:55:29,425 INFO L280 TraceCheckUtils]: 25: Hoare triple {1836#true} assume 2 == ~blastFlag~0; {1836#true} is VALID [2020-07-10 18:55:29,426 INFO L280 TraceCheckUtils]: 26: Hoare triple {1836#true} ~blastFlag~0 := 3; {1840#(<= main_~blastFlag~0 3)} is VALID [2020-07-10 18:55:29,426 INFO L280 TraceCheckUtils]: 27: Hoare triple {1840#(<= main_~blastFlag~0 3)} assume !(4 == ~blastFlag~0); {1840#(<= main_~blastFlag~0 3)} is VALID [2020-07-10 18:55:29,427 INFO L280 TraceCheckUtils]: 28: Hoare triple {1840#(<= main_~blastFlag~0 3)} assume 5 == ~blastFlag~0; {1837#false} is VALID [2020-07-10 18:55:29,427 INFO L280 TraceCheckUtils]: 29: Hoare triple {1837#false} assume !false; {1837#false} is VALID [2020-07-10 18:55:29,428 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 18:55:29,428 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:55:29,429 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1950112748] [2020-07-10 18:55:29,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:55:29,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 18:55:29,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135189604] [2020-07-10 18:55:29,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-10 18:55:29,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:55:29,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 18:55:29,456 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:55:29,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 18:55:29,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:55:29,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 18:55:29,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:55:29,458 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 3 states. [2020-07-10 18:55:29,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:55:29,748 INFO L93 Difference]: Finished difference Result 200 states and 250 transitions. [2020-07-10 18:55:29,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 18:55:29,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-10 18:55:29,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:55:29,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:55:29,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2020-07-10 18:55:29,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:55:29,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2020-07-10 18:55:29,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 128 transitions. [2020-07-10 18:55:29,864 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:55:29,867 INFO L225 Difference]: With dead ends: 200 [2020-07-10 18:55:29,867 INFO L226 Difference]: Without dead ends: 136 [2020-07-10 18:55:29,868 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 18:55:29,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-07-10 18:55:30,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2020-07-10 18:55:30,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:55:30,029 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand 134 states. [2020-07-10 18:55:30,029 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 134 states. [2020-07-10 18:55:30,029 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 134 states. [2020-07-10 18:55:30,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:55:30,035 INFO L93 Difference]: Finished difference Result 136 states and 167 transitions. [2020-07-10 18:55:30,036 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 167 transitions. [2020-07-10 18:55:30,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:55:30,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:55:30,037 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 136 states. [2020-07-10 18:55:30,037 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 136 states. [2020-07-10 18:55:30,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:55:30,042 INFO L93 Difference]: Finished difference Result 136 states and 167 transitions. [2020-07-10 18:55:30,042 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 167 transitions. [2020-07-10 18:55:30,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:55:30,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:55:30,043 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:55:30,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:55:30,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-07-10 18:55:30,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 166 transitions. [2020-07-10 18:55:30,047 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 166 transitions. Word has length 30 [2020-07-10 18:55:30,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:55:30,048 INFO L479 AbstractCegarLoop]: Abstraction has 134 states and 166 transitions. [2020-07-10 18:55:30,048 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 18:55:30,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 134 states and 166 transitions. [2020-07-10 18:55:30,244 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:55:30,245 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 166 transitions. [2020-07-10 18:55:30,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-10 18:55:30,246 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:55:30,246 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:55:30,246 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 18:55:30,246 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:55:30,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:55:30,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1207592178, now seen corresponding path program 1 times [2020-07-10 18:55:30,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:55:30,248 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1289213230] [2020-07-10 18:55:30,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:55:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:55:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:55:30,316 INFO L280 TraceCheckUtils]: 0: Hoare triple {2783#true} assume true; {2783#true} is VALID [2020-07-10 18:55:30,316 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2783#true} {2783#true} #125#return; {2783#true} is VALID [2020-07-10 18:55:30,316 INFO L263 TraceCheckUtils]: 0: Hoare triple {2783#true} call ULTIMATE.init(); {2783#true} is VALID [2020-07-10 18:55:30,317 INFO L280 TraceCheckUtils]: 1: Hoare triple {2783#true} assume true; {2783#true} is VALID [2020-07-10 18:55:30,317 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2783#true} {2783#true} #125#return; {2783#true} is VALID [2020-07-10 18:55:30,317 INFO L263 TraceCheckUtils]: 3: Hoare triple {2783#true} call #t~ret2 := main(); {2783#true} is VALID [2020-07-10 18:55:30,317 INFO L280 TraceCheckUtils]: 4: Hoare triple {2783#true} havoc ~s__state~0; {2783#true} is VALID [2020-07-10 18:55:30,318 INFO L280 TraceCheckUtils]: 5: Hoare triple {2783#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2783#true} is VALID [2020-07-10 18:55:30,318 INFO L280 TraceCheckUtils]: 6: Hoare triple {2783#true} ~s__hit~0 := #t~nondet0; {2783#true} is VALID [2020-07-10 18:55:30,318 INFO L280 TraceCheckUtils]: 7: Hoare triple {2783#true} havoc #t~nondet0; {2783#true} is VALID [2020-07-10 18:55:30,318 INFO L280 TraceCheckUtils]: 8: Hoare triple {2783#true} havoc ~blastFlag~0; {2783#true} is VALID [2020-07-10 18:55:30,319 INFO L280 TraceCheckUtils]: 9: Hoare triple {2783#true} havoc ~tmp___1~0; {2783#true} is VALID [2020-07-10 18:55:30,319 INFO L280 TraceCheckUtils]: 10: Hoare triple {2783#true} ~s__state~0 := 8466; {2783#true} is VALID [2020-07-10 18:55:30,324 INFO L280 TraceCheckUtils]: 11: Hoare triple {2783#true} ~blastFlag~0 := 0; {2783#true} is VALID [2020-07-10 18:55:30,324 INFO L280 TraceCheckUtils]: 12: Hoare triple {2783#true} assume !false; {2783#true} is VALID [2020-07-10 18:55:30,325 INFO L280 TraceCheckUtils]: 13: Hoare triple {2783#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {2783#true} is VALID [2020-07-10 18:55:30,325 INFO L280 TraceCheckUtils]: 14: Hoare triple {2783#true} assume 8466 == ~s__state~0; {2783#true} is VALID [2020-07-10 18:55:30,325 INFO L280 TraceCheckUtils]: 15: Hoare triple {2783#true} assume 0 == ~blastFlag~0; {2783#true} is VALID [2020-07-10 18:55:30,325 INFO L280 TraceCheckUtils]: 16: Hoare triple {2783#true} ~blastFlag~0 := 2; {2783#true} is VALID [2020-07-10 18:55:30,326 INFO L280 TraceCheckUtils]: 17: Hoare triple {2783#true} assume 0 != ~s__hit~0; {2783#true} is VALID [2020-07-10 18:55:30,326 INFO L280 TraceCheckUtils]: 18: Hoare triple {2783#true} ~s__state~0 := 8656; {2783#true} is VALID [2020-07-10 18:55:30,326 INFO L280 TraceCheckUtils]: 19: Hoare triple {2783#true} assume !false; {2783#true} is VALID [2020-07-10 18:55:30,326 INFO L280 TraceCheckUtils]: 20: Hoare triple {2783#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {2783#true} is VALID [2020-07-10 18:55:30,327 INFO L280 TraceCheckUtils]: 21: Hoare triple {2783#true} assume !(8466 == ~s__state~0); {2783#true} is VALID [2020-07-10 18:55:30,327 INFO L280 TraceCheckUtils]: 22: Hoare triple {2783#true} assume !(8512 == ~s__state~0); {2783#true} is VALID [2020-07-10 18:55:30,327 INFO L280 TraceCheckUtils]: 23: Hoare triple {2783#true} assume !(8640 == ~s__state~0); {2783#true} is VALID [2020-07-10 18:55:30,327 INFO L280 TraceCheckUtils]: 24: Hoare triple {2783#true} assume 8656 == ~s__state~0; {2783#true} is VALID [2020-07-10 18:55:30,328 INFO L280 TraceCheckUtils]: 25: Hoare triple {2783#true} assume 2 == ~blastFlag~0; {2783#true} is VALID [2020-07-10 18:55:30,328 INFO L280 TraceCheckUtils]: 26: Hoare triple {2783#true} ~blastFlag~0 := 3; {2783#true} is VALID [2020-07-10 18:55:30,328 INFO L280 TraceCheckUtils]: 27: Hoare triple {2783#true} assume !(4 == ~blastFlag~0); {2783#true} is VALID [2020-07-10 18:55:30,328 INFO L280 TraceCheckUtils]: 28: Hoare triple {2783#true} assume !(5 == ~blastFlag~0); {2783#true} is VALID [2020-07-10 18:55:30,329 INFO L280 TraceCheckUtils]: 29: Hoare triple {2783#true} assume 0 != ~s__hit~0; {2783#true} is VALID [2020-07-10 18:55:30,331 INFO L280 TraceCheckUtils]: 30: Hoare triple {2783#true} ~s__state~0 := 8640; {2787#(<= 8640 main_~s__state~0)} is VALID [2020-07-10 18:55:30,332 INFO L280 TraceCheckUtils]: 31: Hoare triple {2787#(<= 8640 main_~s__state~0)} assume !false; {2787#(<= 8640 main_~s__state~0)} is VALID [2020-07-10 18:55:30,332 INFO L280 TraceCheckUtils]: 32: Hoare triple {2787#(<= 8640 main_~s__state~0)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {2784#false} is VALID [2020-07-10 18:55:30,333 INFO L280 TraceCheckUtils]: 33: Hoare triple {2784#false} assume !false; {2784#false} is VALID [2020-07-10 18:55:30,336 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 18:55:30,336 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:55:30,337 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1289213230] [2020-07-10 18:55:30,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:55:30,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 18:55:30,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028525326] [2020-07-10 18:55:30,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-07-10 18:55:30,338 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:55:30,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 18:55:30,377 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:55:30,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 18:55:30,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:55:30,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 18:55:30,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:55:30,379 INFO L87 Difference]: Start difference. First operand 134 states and 166 transitions. Second operand 3 states. [2020-07-10 18:55:30,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:55:30,700 INFO L93 Difference]: Finished difference Result 248 states and 312 transitions. [2020-07-10 18:55:30,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 18:55:30,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-07-10 18:55:30,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:55:30,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:55:30,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2020-07-10 18:55:30,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:55:30,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2020-07-10 18:55:30,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2020-07-10 18:55:30,786 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:55:30,788 INFO L225 Difference]: With dead ends: 248 [2020-07-10 18:55:30,788 INFO L226 Difference]: Without dead ends: 103 [2020-07-10 18:55:30,790 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 18:55:30,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-07-10 18:55:30,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2020-07-10 18:55:30,918 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:55:30,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 101 states. [2020-07-10 18:55:30,919 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 101 states. [2020-07-10 18:55:30,919 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 101 states. [2020-07-10 18:55:30,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:55:30,923 INFO L93 Difference]: Finished difference Result 103 states and 120 transitions. [2020-07-10 18:55:30,923 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 120 transitions. [2020-07-10 18:55:30,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:55:30,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:55:30,924 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 103 states. [2020-07-10 18:55:30,925 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 103 states. [2020-07-10 18:55:30,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:55:30,929 INFO L93 Difference]: Finished difference Result 103 states and 120 transitions. [2020-07-10 18:55:30,929 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 120 transitions. [2020-07-10 18:55:30,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:55:30,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:55:30,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:55:30,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:55:30,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-07-10 18:55:30,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2020-07-10 18:55:30,935 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 34 [2020-07-10 18:55:30,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:55:30,936 INFO L479 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2020-07-10 18:55:30,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 18:55:30,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 101 states and 117 transitions. [2020-07-10 18:55:31,072 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:55:31,072 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2020-07-10 18:55:31,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-10 18:55:31,073 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:55:31,074 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:55:31,074 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 18:55:31,074 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:55:31,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:55:31,075 INFO L82 PathProgramCache]: Analyzing trace with hash 340924863, now seen corresponding path program 1 times [2020-07-10 18:55:31,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:55:31,075 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [288082511] [2020-07-10 18:55:31,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:55:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:55:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:55:31,124 INFO L280 TraceCheckUtils]: 0: Hoare triple {3694#true} assume true; {3694#true} is VALID [2020-07-10 18:55:31,124 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3694#true} {3694#true} #125#return; {3694#true} is VALID [2020-07-10 18:55:31,125 INFO L263 TraceCheckUtils]: 0: Hoare triple {3694#true} call ULTIMATE.init(); {3694#true} is VALID [2020-07-10 18:55:31,125 INFO L280 TraceCheckUtils]: 1: Hoare triple {3694#true} assume true; {3694#true} is VALID [2020-07-10 18:55:31,125 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3694#true} {3694#true} #125#return; {3694#true} is VALID [2020-07-10 18:55:31,126 INFO L263 TraceCheckUtils]: 3: Hoare triple {3694#true} call #t~ret2 := main(); {3694#true} is VALID [2020-07-10 18:55:31,126 INFO L280 TraceCheckUtils]: 4: Hoare triple {3694#true} havoc ~s__state~0; {3694#true} is VALID [2020-07-10 18:55:31,126 INFO L280 TraceCheckUtils]: 5: Hoare triple {3694#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3694#true} is VALID [2020-07-10 18:55:31,126 INFO L280 TraceCheckUtils]: 6: Hoare triple {3694#true} ~s__hit~0 := #t~nondet0; {3694#true} is VALID [2020-07-10 18:55:31,127 INFO L280 TraceCheckUtils]: 7: Hoare triple {3694#true} havoc #t~nondet0; {3694#true} is VALID [2020-07-10 18:55:31,127 INFO L280 TraceCheckUtils]: 8: Hoare triple {3694#true} havoc ~blastFlag~0; {3694#true} is VALID [2020-07-10 18:55:31,127 INFO L280 TraceCheckUtils]: 9: Hoare triple {3694#true} havoc ~tmp___1~0; {3694#true} is VALID [2020-07-10 18:55:31,128 INFO L280 TraceCheckUtils]: 10: Hoare triple {3694#true} ~s__state~0 := 8466; {3694#true} is VALID [2020-07-10 18:55:31,128 INFO L280 TraceCheckUtils]: 11: Hoare triple {3694#true} ~blastFlag~0 := 0; {3694#true} is VALID [2020-07-10 18:55:31,128 INFO L280 TraceCheckUtils]: 12: Hoare triple {3694#true} assume !false; {3694#true} is VALID [2020-07-10 18:55:31,128 INFO L280 TraceCheckUtils]: 13: Hoare triple {3694#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {3694#true} is VALID [2020-07-10 18:55:31,129 INFO L280 TraceCheckUtils]: 14: Hoare triple {3694#true} assume 8466 == ~s__state~0; {3694#true} is VALID [2020-07-10 18:55:31,129 INFO L280 TraceCheckUtils]: 15: Hoare triple {3694#true} assume 0 == ~blastFlag~0; {3694#true} is VALID [2020-07-10 18:55:31,129 INFO L280 TraceCheckUtils]: 16: Hoare triple {3694#true} ~blastFlag~0 := 2; {3694#true} is VALID [2020-07-10 18:55:31,130 INFO L280 TraceCheckUtils]: 17: Hoare triple {3694#true} assume 0 != ~s__hit~0; {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-10 18:55:31,131 INFO L280 TraceCheckUtils]: 18: Hoare triple {3698#(not (= 0 main_~s__hit~0))} ~s__state~0 := 8656; {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-10 18:55:31,132 INFO L280 TraceCheckUtils]: 19: Hoare triple {3698#(not (= 0 main_~s__hit~0))} assume !false; {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-10 18:55:31,132 INFO L280 TraceCheckUtils]: 20: Hoare triple {3698#(not (= 0 main_~s__hit~0))} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-10 18:55:31,133 INFO L280 TraceCheckUtils]: 21: Hoare triple {3698#(not (= 0 main_~s__hit~0))} assume !(8466 == ~s__state~0); {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-10 18:55:31,133 INFO L280 TraceCheckUtils]: 22: Hoare triple {3698#(not (= 0 main_~s__hit~0))} assume !(8512 == ~s__state~0); {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-10 18:55:31,134 INFO L280 TraceCheckUtils]: 23: Hoare triple {3698#(not (= 0 main_~s__hit~0))} assume !(8640 == ~s__state~0); {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-10 18:55:31,135 INFO L280 TraceCheckUtils]: 24: Hoare triple {3698#(not (= 0 main_~s__hit~0))} assume 8656 == ~s__state~0; {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-10 18:55:31,135 INFO L280 TraceCheckUtils]: 25: Hoare triple {3698#(not (= 0 main_~s__hit~0))} assume 2 == ~blastFlag~0; {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-10 18:55:31,136 INFO L280 TraceCheckUtils]: 26: Hoare triple {3698#(not (= 0 main_~s__hit~0))} ~blastFlag~0 := 3; {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-10 18:55:31,136 INFO L280 TraceCheckUtils]: 27: Hoare triple {3698#(not (= 0 main_~s__hit~0))} assume !(4 == ~blastFlag~0); {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-10 18:55:31,137 INFO L280 TraceCheckUtils]: 28: Hoare triple {3698#(not (= 0 main_~s__hit~0))} assume !(5 == ~blastFlag~0); {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-10 18:55:31,138 INFO L280 TraceCheckUtils]: 29: Hoare triple {3698#(not (= 0 main_~s__hit~0))} assume 0 != ~s__hit~0; {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-10 18:55:31,139 INFO L280 TraceCheckUtils]: 30: Hoare triple {3698#(not (= 0 main_~s__hit~0))} ~s__state~0 := 8640; {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-10 18:55:31,139 INFO L280 TraceCheckUtils]: 31: Hoare triple {3698#(not (= 0 main_~s__hit~0))} assume !false; {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-10 18:55:31,140 INFO L280 TraceCheckUtils]: 32: Hoare triple {3698#(not (= 0 main_~s__hit~0))} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-10 18:55:31,141 INFO L280 TraceCheckUtils]: 33: Hoare triple {3698#(not (= 0 main_~s__hit~0))} assume !(8466 == ~s__state~0); {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-10 18:55:31,149 INFO L280 TraceCheckUtils]: 34: Hoare triple {3698#(not (= 0 main_~s__hit~0))} assume !(8512 == ~s__state~0); {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-10 18:55:31,149 INFO L280 TraceCheckUtils]: 35: Hoare triple {3698#(not (= 0 main_~s__hit~0))} assume 8640 == ~s__state~0; {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-10 18:55:31,150 INFO L280 TraceCheckUtils]: 36: Hoare triple {3698#(not (= 0 main_~s__hit~0))} assume 3 == ~blastFlag~0; {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-10 18:55:31,150 INFO L280 TraceCheckUtils]: 37: Hoare triple {3698#(not (= 0 main_~s__hit~0))} ~blastFlag~0 := 4; {3698#(not (= 0 main_~s__hit~0))} is VALID [2020-07-10 18:55:31,151 INFO L280 TraceCheckUtils]: 38: Hoare triple {3698#(not (= 0 main_~s__hit~0))} assume !(0 != ~s__hit~0); {3695#false} is VALID [2020-07-10 18:55:31,151 INFO L280 TraceCheckUtils]: 39: Hoare triple {3695#false} ~s__state~0 := 8656; {3695#false} is VALID [2020-07-10 18:55:31,151 INFO L280 TraceCheckUtils]: 40: Hoare triple {3695#false} assume !false; {3695#false} is VALID [2020-07-10 18:55:31,151 INFO L280 TraceCheckUtils]: 41: Hoare triple {3695#false} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {3695#false} is VALID [2020-07-10 18:55:31,152 INFO L280 TraceCheckUtils]: 42: Hoare triple {3695#false} assume !(8466 == ~s__state~0); {3695#false} is VALID [2020-07-10 18:55:31,152 INFO L280 TraceCheckUtils]: 43: Hoare triple {3695#false} assume !(8512 == ~s__state~0); {3695#false} is VALID [2020-07-10 18:55:31,152 INFO L280 TraceCheckUtils]: 44: Hoare triple {3695#false} assume !(8640 == ~s__state~0); {3695#false} is VALID [2020-07-10 18:55:31,152 INFO L280 TraceCheckUtils]: 45: Hoare triple {3695#false} assume 8656 == ~s__state~0; {3695#false} is VALID [2020-07-10 18:55:31,152 INFO L280 TraceCheckUtils]: 46: Hoare triple {3695#false} assume !(2 == ~blastFlag~0); {3695#false} is VALID [2020-07-10 18:55:31,153 INFO L280 TraceCheckUtils]: 47: Hoare triple {3695#false} assume !(4 == ~blastFlag~0); {3695#false} is VALID [2020-07-10 18:55:31,153 INFO L280 TraceCheckUtils]: 48: Hoare triple {3695#false} assume 5 == ~blastFlag~0; {3695#false} is VALID [2020-07-10 18:55:31,153 INFO L280 TraceCheckUtils]: 49: Hoare triple {3695#false} assume !false; {3695#false} is VALID [2020-07-10 18:55:31,156 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 18:55:31,156 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:55:31,156 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [288082511] [2020-07-10 18:55:31,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:55:31,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 18:55:31,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521212399] [2020-07-10 18:55:31,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-10 18:55:31,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:55:31,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 18:55:31,202 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:55:31,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 18:55:31,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:55:31,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 18:55:31,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:55:31,203 INFO L87 Difference]: Start difference. First operand 101 states and 117 transitions. Second operand 3 states. [2020-07-10 18:55:31,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:55:31,433 INFO L93 Difference]: Finished difference Result 157 states and 180 transitions. [2020-07-10 18:55:31,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 18:55:31,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-10 18:55:31,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:55:31,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:55:31,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2020-07-10 18:55:31,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:55:31,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2020-07-10 18:55:31,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 85 transitions. [2020-07-10 18:55:31,514 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:55:31,515 INFO L225 Difference]: With dead ends: 157 [2020-07-10 18:55:31,515 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 18:55:31,516 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 18:55:31,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 18:55:31,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 18:55:31,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:55:31,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 18:55:31,517 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 18:55:31,517 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 18:55:31,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:55:31,517 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 18:55:31,518 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 18:55:31,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:55:31,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:55:31,518 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 18:55:31,518 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 18:55:31,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:55:31,518 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 18:55:31,518 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 18:55:31,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:55:31,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:55:31,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:55:31,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:55:31,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 18:55:31,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 18:55:31,519 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2020-07-10 18:55:31,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:55:31,519 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 18:55:31,519 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 18:55:31,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-10 18:55:31,520 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:55:31,520 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 18:55:31,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:55:31,520 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 18:55:31,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 18:55:32,162 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 18:55:32,162 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-10 18:55:32,162 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-10 18:55:32,162 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 18:55:32,163 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 18:55:32,163 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-10 18:55:32,163 INFO L264 CegarLoopResult]: At program point L93(line 93) the Hoare annotation is: false [2020-07-10 18:55:32,163 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 8 140) the Hoare annotation is: true [2020-07-10 18:55:32,163 INFO L264 CegarLoopResult]: At program point L77-1(lines 53 106) 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)) .cse0))) [2020-07-10 18:55:32,163 INFO L271 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: true [2020-07-10 18:55:32,163 INFO L264 CegarLoopResult]: At program point L69(lines 69 73) the Hoare annotation is: (<= main_~blastFlag~0 2) [2020-07-10 18:55:32,164 INFO L264 CegarLoopResult]: At program point L61(line 61) the Hoare annotation is: (or (and (not (= 0 main_~s__hit~0)) (<= main_~blastFlag~0 2)) (<= main_~blastFlag~0 0)) [2020-07-10 18:55:32,164 INFO L264 CegarLoopResult]: At program point L78(line 78) the Hoare annotation is: (and (not (= 0 main_~s__hit~0)) (<= main_~blastFlag~0 3) (<= 8640 main_~s__state~0)) [2020-07-10 18:55:32,164 INFO L264 CegarLoopResult]: At program point L45(lines 45 110) 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 18:55:32,164 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-07-10 18:55:32,164 INFO L271 CegarLoopResult]: At program point L136(lines 8 140) the Hoare annotation is: true [2020-07-10 18:55:32,164 INFO L264 CegarLoopResult]: At program point L70(line 70) the Hoare annotation is: (<= main_~blastFlag~0 2) [2020-07-10 18:55:32,165 INFO L264 CegarLoopResult]: At program point L95(lines 95 97) the Hoare annotation is: (and (<= 8656 main_~s__state~0) (<= main_~blastFlag~0 3)) [2020-07-10 18:55:32,165 INFO L264 CegarLoopResult]: At program point L29(lines 29 124) 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 18:55:32,165 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 18:55:32,165 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 8 140) the Hoare annotation is: true [2020-07-10 18:55:32,165 INFO L264 CegarLoopResult]: At program point L96(lines 8 140) the Hoare annotation is: false [2020-07-10 18:55:32,165 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 138) the Hoare annotation is: false [2020-07-10 18:55:32,165 INFO L264 CegarLoopResult]: At program point L63(line 63) the Hoare annotation is: (<= main_~blastFlag~0 2) [2020-07-10 18:55:32,165 INFO L264 CegarLoopResult]: At program point L30(lines 29 124) the Hoare annotation is: (<= main_~blastFlag~0 2) [2020-07-10 18:55:32,166 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 8 140) the Hoare annotation is: true [2020-07-10 18:55:32,166 INFO L264 CegarLoopResult]: At program point L88-1(lines 53 106) the Hoare annotation is: (and (<= 8656 main_~s__state~0) (<= main_~blastFlag~0 3)) [2020-07-10 18:55:32,166 INFO L271 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-07-10 18:55:32,166 INFO L264 CegarLoopResult]: At program point L72(line 72) the Hoare annotation is: (<= main_~blastFlag~0 2) [2020-07-10 18:55:32,166 INFO L264 CegarLoopResult]: At program point L89(line 89) the Hoare annotation is: (and (<= 8656 main_~s__state~0) (<= main_~blastFlag~0 2)) [2020-07-10 18:55:32,166 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-10 18:55:32,166 INFO L264 CegarLoopResult]: At program point L139(line 139) the Hoare annotation is: false [2020-07-10 18:55:32,166 INFO L264 CegarLoopResult]: At program point L24(lines 24 127) 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 18:55:32,166 INFO L264 CegarLoopResult]: At program point L57-1(lines 53 106) the Hoare annotation is: (<= main_~blastFlag~0 2) [2020-07-10 18:55:32,167 INFO L264 CegarLoopResult]: At program point L49(lines 49 108) 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 18:55:32,167 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 18:55:32,167 INFO L264 CegarLoopResult]: At program point L58(line 58) the Hoare annotation is: (<= main_~blastFlag~0 0) [2020-07-10 18:55:32,167 INFO L264 CegarLoopResult]: At program point L25(lines 24 127) the Hoare annotation is: (<= main_~blastFlag~0 2) [2020-07-10 18:55:32,167 INFO L264 CegarLoopResult]: At program point L83(line 83) the Hoare annotation is: (and (<= main_~blastFlag~0 2) (<= 8640 main_~s__state~0)) [2020-07-10 18:55:32,167 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 18:55:32,168 INFO L264 CegarLoopResult]: At program point L100(line 100) the Hoare annotation is: (let ((.cse0 (<= 8656 main_~s__state~0))) (or (and .cse0 (not (= 0 main_~s__hit~0)) (<= main_~blastFlag~0 3)) (and .cse0 (<= main_~blastFlag~0 0)))) [2020-07-10 18:55:32,168 INFO L264 CegarLoopResult]: At program point L92-1(lines 53 106) the Hoare annotation is: (and (<= 8656 main_~s__state~0) (<= main_~blastFlag~0 3)) [2020-07-10 18:55:32,168 INFO L264 CegarLoopResult]: At program point L18(line 18) 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 18:55:32,168 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-07-10 18:55:32,168 INFO L271 CegarLoopResult]: At program point L10-1(line 10) the Hoare annotation is: true [2020-07-10 18:55:32,168 INFO L271 CegarLoopResult]: At program point L10-2(line 10) the Hoare annotation is: true [2020-07-10 18:55:32,168 INFO L264 CegarLoopResult]: At program point L68(line 68) the Hoare annotation is: (<= main_~blastFlag~0 2) [2020-07-10 18:55:32,168 INFO L264 CegarLoopResult]: At program point L68-1(line 68) the Hoare annotation is: (<= main_~blastFlag~0 2) [2020-07-10 18:55:32,195 INFO L163 areAnnotationChecker]: CFG has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 18:55:32,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 06:55:32 BoogieIcfgContainer [2020-07-10 18:55:32,209 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 18:55:32,212 INFO L168 Benchmark]: Toolchain (without parser) took 6208.38 ms. Allocated memory was 136.8 MB in the beginning and 298.3 MB in the end (delta: 161.5 MB). Free memory was 100.5 MB in the beginning and 94.0 MB in the end (delta: 6.5 MB). Peak memory consumption was 168.0 MB. Max. memory is 7.1 GB. [2020-07-10 18:55:32,213 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 136.8 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 18:55:32,214 INFO L168 Benchmark]: CACSL2BoogieTranslator took 257.85 ms. Allocated memory is still 136.8 MB. Free memory was 100.3 MB in the beginning and 89.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2020-07-10 18:55:32,215 INFO L168 Benchmark]: Boogie Preprocessor took 123.24 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 89.8 MB in the beginning and 179.0 MB in the end (delta: -89.3 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2020-07-10 18:55:32,216 INFO L168 Benchmark]: RCFGBuilder took 434.40 ms. Allocated memory is still 200.3 MB. Free memory was 179.0 MB in the beginning and 155.7 MB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. [2020-07-10 18:55:32,217 INFO L168 Benchmark]: TraceAbstraction took 5387.35 ms. Allocated memory was 200.3 MB in the beginning and 298.3 MB in the end (delta: 98.0 MB). Free memory was 155.7 MB in the beginning and 94.0 MB in the end (delta: 61.7 MB). Peak memory consumption was 159.7 MB. Max. memory is 7.1 GB. [2020-07-10 18:55:32,220 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.16 ms. Allocated memory is still 136.8 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 257.85 ms. Allocated memory is still 136.8 MB. Free memory was 100.3 MB in the beginning and 89.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 123.24 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 89.8 MB in the beginning and 179.0 MB in the end (delta: -89.3 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 434.40 ms. Allocated memory is still 200.3 MB. Free memory was 179.0 MB in the beginning and 155.7 MB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5387.35 ms. Allocated memory was 200.3 MB in the beginning and 298.3 MB in the end (delta: 98.0 MB). Free memory was 155.7 MB in the beginning and 94.0 MB in the end (delta: 61.7 MB). Peak memory consumption was 159.7 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 - ProcedureContractResult [Line: 8]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.6s, OverallIterations: 6, TraceHistogramMax: 4, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 295 SDtfs, 129 SDslu, 194 SDs, 0 SdLazy, 106 SolverSat, 30 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=134occurred 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.6s AutomataMinimizationTime, 6 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 48 LocationsWithAnnotation, 48 PreInvPairs, 162 NumberOfFragments, 272 HoareAnnotationTreeSize, 48 FomulaSimplifications, 975 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 48 FomulaSimplificationsInter, 122 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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...