/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/psyco/psyco_security.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:16:38,104 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:16:38,107 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:16:38,121 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:16:38,122 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:16:38,123 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:16:38,124 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:16:38,126 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:16:38,128 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:16:38,129 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:16:38,130 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:16:38,132 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:16:38,132 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:16:38,133 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:16:38,134 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:16:38,136 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:16:38,137 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:16:38,138 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:16:38,139 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:16:38,141 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:16:38,143 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:16:38,144 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:16:38,145 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:16:38,146 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:16:38,148 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:16:38,149 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:16:38,149 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:16:38,150 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:16:38,150 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:16:38,151 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:16:38,151 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:16:38,152 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:16:38,153 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:16:38,154 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:16:38,155 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:16:38,155 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:16:38,156 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:16:38,156 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:16:38,156 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:16:38,157 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:16:38,158 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:16:38,159 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 20:16:38,169 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:16:38,169 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:16:38,171 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:16:38,171 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:16:38,171 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:16:38,171 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:16:38,171 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:16:38,172 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:16:38,172 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:16:38,172 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:16:38,172 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:16:38,172 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:16:38,173 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:16:38,173 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:16:38,173 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:16:38,173 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:16:38,173 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:16:38,173 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:16:38,174 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:16:38,174 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:16:38,174 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:16:38,174 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:16:38,174 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:16:38,458 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:16:38,473 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:16:38,477 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:16:38,478 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:16:38,479 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:16:38,480 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_security.c [2020-07-10 20:16:38,570 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1629c261/e1be0c4f20cd442eb8e2dbf02954286b/FLAGf071c1064 [2020-07-10 20:16:39,084 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:16:39,085 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_security.c [2020-07-10 20:16:39,105 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1629c261/e1be0c4f20cd442eb8e2dbf02954286b/FLAGf071c1064 [2020-07-10 20:16:39,396 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1629c261/e1be0c4f20cd442eb8e2dbf02954286b [2020-07-10 20:16:39,409 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:16:39,411 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:16:39,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:16:39,413 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:16:39,417 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:16:39,418 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:16:39" (1/1) ... [2020-07-10 20:16:39,422 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@714d67de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:16:39, skipping insertion in model container [2020-07-10 20:16:39,422 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:16:39" (1/1) ... [2020-07-10 20:16:39,431 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:16:39,464 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:16:39,726 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:16:39,733 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:16:39,795 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:16:39,902 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:16:39,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:16:39 WrapperNode [2020-07-10 20:16:39,903 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:16:39,904 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:16:39,904 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:16:39,904 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:16:39,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:16:39" (1/1) ... [2020-07-10 20:16:39,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:16:39" (1/1) ... [2020-07-10 20:16:39,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:16:39" (1/1) ... [2020-07-10 20:16:39,924 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:16:39" (1/1) ... [2020-07-10 20:16:39,938 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:16:39" (1/1) ... [2020-07-10 20:16:39,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:16:39" (1/1) ... [2020-07-10 20:16:39,967 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:16:39" (1/1) ... [2020-07-10 20:16:39,971 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:16:39,971 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:16:39,972 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:16:39,972 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:16:39,973 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:16:39" (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 20:16:40,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:16:40,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:16:40,048 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:16:40,048 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:16:40,048 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:16:40,048 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:16:40,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:16:40,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:16:40,957 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:16:40,958 INFO L295 CfgBuilder]: Removed 18 assume(true) statements. [2020-07-10 20:16:40,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:16:40 BoogieIcfgContainer [2020-07-10 20:16:40,965 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:16:40,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:16:40,967 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:16:40,970 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:16:40,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:16:39" (1/3) ... [2020-07-10 20:16:40,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c224389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:16:40, skipping insertion in model container [2020-07-10 20:16:40,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:16:39" (2/3) ... [2020-07-10 20:16:40,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c224389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:16:40, skipping insertion in model container [2020-07-10 20:16:40,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:16:40" (3/3) ... [2020-07-10 20:16:40,975 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_security.c [2020-07-10 20:16:40,987 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:16:40,997 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:16:41,013 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:16:41,041 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:16:41,042 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:16:41,042 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:16:41,042 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:16:41,043 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:16:41,043 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:16:41,043 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:16:41,043 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:16:41,066 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states. [2020-07-10 20:16:41,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 20:16:41,080 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:16:41,082 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:16:41,082 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:16:41,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:16:41,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1507146259, now seen corresponding path program 1 times [2020-07-10 20:16:41,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:16:41,101 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1810511231] [2020-07-10 20:16:41,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:16:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:16:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:16:41,337 INFO L280 TraceCheckUtils]: 0: Hoare triple {204#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {194#true} is VALID [2020-07-10 20:16:41,338 INFO L280 TraceCheckUtils]: 1: Hoare triple {194#true} ~m_initVerify~0 := 2; {194#true} is VALID [2020-07-10 20:16:41,339 INFO L280 TraceCheckUtils]: 2: Hoare triple {194#true} ~m_Signature~0 := 3; {194#true} is VALID [2020-07-10 20:16:41,339 INFO L280 TraceCheckUtils]: 3: Hoare triple {194#true} ~m_sign~0 := 4; {194#true} is VALID [2020-07-10 20:16:41,340 INFO L280 TraceCheckUtils]: 4: Hoare triple {194#true} ~m_verify~0 := 5; {194#true} is VALID [2020-07-10 20:16:41,341 INFO L280 TraceCheckUtils]: 5: Hoare triple {194#true} ~m_update~0 := 6; {194#true} is VALID [2020-07-10 20:16:41,341 INFO L280 TraceCheckUtils]: 6: Hoare triple {194#true} assume true; {194#true} is VALID [2020-07-10 20:16:41,342 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {194#true} {194#true} #484#return; {194#true} is VALID [2020-07-10 20:16:41,347 INFO L263 TraceCheckUtils]: 0: Hoare triple {194#true} call ULTIMATE.init(); {204#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID [2020-07-10 20:16:41,347 INFO L280 TraceCheckUtils]: 1: Hoare triple {204#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {194#true} is VALID [2020-07-10 20:16:41,348 INFO L280 TraceCheckUtils]: 2: Hoare triple {194#true} ~m_initVerify~0 := 2; {194#true} is VALID [2020-07-10 20:16:41,348 INFO L280 TraceCheckUtils]: 3: Hoare triple {194#true} ~m_Signature~0 := 3; {194#true} is VALID [2020-07-10 20:16:41,349 INFO L280 TraceCheckUtils]: 4: Hoare triple {194#true} ~m_sign~0 := 4; {194#true} is VALID [2020-07-10 20:16:41,349 INFO L280 TraceCheckUtils]: 5: Hoare triple {194#true} ~m_verify~0 := 5; {194#true} is VALID [2020-07-10 20:16:41,350 INFO L280 TraceCheckUtils]: 6: Hoare triple {194#true} ~m_update~0 := 6; {194#true} is VALID [2020-07-10 20:16:41,350 INFO L280 TraceCheckUtils]: 7: Hoare triple {194#true} assume true; {194#true} is VALID [2020-07-10 20:16:41,351 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {194#true} {194#true} #484#return; {194#true} is VALID [2020-07-10 20:16:41,351 INFO L263 TraceCheckUtils]: 9: Hoare triple {194#true} call #t~ret21 := main(); {194#true} is VALID [2020-07-10 20:16:41,352 INFO L280 TraceCheckUtils]: 10: Hoare triple {194#true} ~q~0 := 0; {194#true} is VALID [2020-07-10 20:16:41,352 INFO L280 TraceCheckUtils]: 11: Hoare triple {194#true} havoc ~method_id~0; {194#true} is VALID [2020-07-10 20:16:41,353 INFO L280 TraceCheckUtils]: 12: Hoare triple {194#true} ~this_state~0 := 0; {194#true} is VALID [2020-07-10 20:16:41,353 INFO L280 TraceCheckUtils]: 13: Hoare triple {194#true} goto; {194#true} is VALID [2020-07-10 20:16:41,354 INFO L280 TraceCheckUtils]: 14: Hoare triple {194#true} assume !false; {194#true} is VALID [2020-07-10 20:16:41,354 INFO L280 TraceCheckUtils]: 15: Hoare triple {194#true} assume 0 == ~q~0; {194#true} is VALID [2020-07-10 20:16:41,355 INFO L280 TraceCheckUtils]: 16: Hoare triple {194#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {194#true} is VALID [2020-07-10 20:16:41,355 INFO L280 TraceCheckUtils]: 17: Hoare triple {194#true} assume 0 != #t~nondet0; {194#true} is VALID [2020-07-10 20:16:41,356 INFO L280 TraceCheckUtils]: 18: Hoare triple {194#true} havoc #t~nondet0; {194#true} is VALID [2020-07-10 20:16:41,356 INFO L280 TraceCheckUtils]: 19: Hoare triple {194#true} ~method_id~0 := 3; {194#true} is VALID [2020-07-10 20:16:41,357 INFO L280 TraceCheckUtils]: 20: Hoare triple {194#true} assume false; {195#false} is VALID [2020-07-10 20:16:41,358 INFO L280 TraceCheckUtils]: 21: Hoare triple {195#false} assume !false; {195#false} is VALID [2020-07-10 20:16:41,362 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 20:16:41,363 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:16:41,366 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1810511231] [2020-07-10 20:16:41,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:16:41,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 20:16:41,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469692773] [2020-07-10 20:16:41,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 20:16:41,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:16:41,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 20:16:41,445 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 20:16:41,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 20:16:41,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:16:41,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 20:16:41,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:16:41,459 INFO L87 Difference]: Start difference. First operand 191 states. Second operand 3 states. [2020-07-10 20:16:42,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:16:42,921 INFO L93 Difference]: Finished difference Result 369 states and 507 transitions. [2020-07-10 20:16:42,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 20:16:42,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 20:16:42,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:16:42,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:16:42,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 507 transitions. [2020-07-10 20:16:42,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:16:42,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 507 transitions. [2020-07-10 20:16:42,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 507 transitions. [2020-07-10 20:16:43,653 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 507 edges. 507 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:16:43,681 INFO L225 Difference]: With dead ends: 369 [2020-07-10 20:16:43,682 INFO L226 Difference]: Without dead ends: 178 [2020-07-10 20:16:43,688 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 20:16:43,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2020-07-10 20:16:44,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2020-07-10 20:16:44,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:16:44,371 INFO L82 GeneralOperation]: Start isEquivalent. First operand 178 states. Second operand 178 states. [2020-07-10 20:16:44,371 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand 178 states. [2020-07-10 20:16:44,371 INFO L87 Difference]: Start difference. First operand 178 states. Second operand 178 states. [2020-07-10 20:16:44,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:16:44,392 INFO L93 Difference]: Finished difference Result 178 states and 213 transitions. [2020-07-10 20:16:44,393 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 213 transitions. [2020-07-10 20:16:44,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:16:44,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:16:44,396 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand 178 states. [2020-07-10 20:16:44,396 INFO L87 Difference]: Start difference. First operand 178 states. Second operand 178 states. [2020-07-10 20:16:44,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:16:44,408 INFO L93 Difference]: Finished difference Result 178 states and 213 transitions. [2020-07-10 20:16:44,409 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 213 transitions. [2020-07-10 20:16:44,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:16:44,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:16:44,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:16:44,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:16:44,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2020-07-10 20:16:44,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 213 transitions. [2020-07-10 20:16:44,424 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 213 transitions. Word has length 22 [2020-07-10 20:16:44,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:16:44,424 INFO L479 AbstractCegarLoop]: Abstraction has 178 states and 213 transitions. [2020-07-10 20:16:44,425 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 20:16:44,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 178 states and 213 transitions. [2020-07-10 20:16:44,727 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:16:44,728 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 213 transitions. [2020-07-10 20:16:44,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 20:16:44,729 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:16:44,729 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:16:44,730 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:16:44,730 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:16:44,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:16:44,731 INFO L82 PathProgramCache]: Analyzing trace with hash -946920198, now seen corresponding path program 1 times [2020-07-10 20:16:44,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:16:44,732 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1327764622] [2020-07-10 20:16:44,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:16:44,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:16:44,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:16:44,817 INFO L280 TraceCheckUtils]: 0: Hoare triple {1668#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {1657#true} is VALID [2020-07-10 20:16:44,817 INFO L280 TraceCheckUtils]: 1: Hoare triple {1657#true} ~m_initVerify~0 := 2; {1657#true} is VALID [2020-07-10 20:16:44,818 INFO L280 TraceCheckUtils]: 2: Hoare triple {1657#true} ~m_Signature~0 := 3; {1657#true} is VALID [2020-07-10 20:16:44,818 INFO L280 TraceCheckUtils]: 3: Hoare triple {1657#true} ~m_sign~0 := 4; {1657#true} is VALID [2020-07-10 20:16:44,819 INFO L280 TraceCheckUtils]: 4: Hoare triple {1657#true} ~m_verify~0 := 5; {1657#true} is VALID [2020-07-10 20:16:44,819 INFO L280 TraceCheckUtils]: 5: Hoare triple {1657#true} ~m_update~0 := 6; {1657#true} is VALID [2020-07-10 20:16:44,820 INFO L280 TraceCheckUtils]: 6: Hoare triple {1657#true} assume true; {1657#true} is VALID [2020-07-10 20:16:44,820 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1657#true} {1657#true} #484#return; {1657#true} is VALID [2020-07-10 20:16:44,822 INFO L263 TraceCheckUtils]: 0: Hoare triple {1657#true} call ULTIMATE.init(); {1668#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID [2020-07-10 20:16:44,823 INFO L280 TraceCheckUtils]: 1: Hoare triple {1668#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {1657#true} is VALID [2020-07-10 20:16:44,823 INFO L280 TraceCheckUtils]: 2: Hoare triple {1657#true} ~m_initVerify~0 := 2; {1657#true} is VALID [2020-07-10 20:16:44,824 INFO L280 TraceCheckUtils]: 3: Hoare triple {1657#true} ~m_Signature~0 := 3; {1657#true} is VALID [2020-07-10 20:16:44,824 INFO L280 TraceCheckUtils]: 4: Hoare triple {1657#true} ~m_sign~0 := 4; {1657#true} is VALID [2020-07-10 20:16:44,825 INFO L280 TraceCheckUtils]: 5: Hoare triple {1657#true} ~m_verify~0 := 5; {1657#true} is VALID [2020-07-10 20:16:44,825 INFO L280 TraceCheckUtils]: 6: Hoare triple {1657#true} ~m_update~0 := 6; {1657#true} is VALID [2020-07-10 20:16:44,825 INFO L280 TraceCheckUtils]: 7: Hoare triple {1657#true} assume true; {1657#true} is VALID [2020-07-10 20:16:44,826 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {1657#true} {1657#true} #484#return; {1657#true} is VALID [2020-07-10 20:16:44,826 INFO L263 TraceCheckUtils]: 9: Hoare triple {1657#true} call #t~ret21 := main(); {1657#true} is VALID [2020-07-10 20:16:44,827 INFO L280 TraceCheckUtils]: 10: Hoare triple {1657#true} ~q~0 := 0; {1667#(= 0 main_~q~0)} is VALID [2020-07-10 20:16:44,830 INFO L280 TraceCheckUtils]: 11: Hoare triple {1667#(= 0 main_~q~0)} havoc ~method_id~0; {1667#(= 0 main_~q~0)} is VALID [2020-07-10 20:16:44,831 INFO L280 TraceCheckUtils]: 12: Hoare triple {1667#(= 0 main_~q~0)} ~this_state~0 := 0; {1667#(= 0 main_~q~0)} is VALID [2020-07-10 20:16:44,832 INFO L280 TraceCheckUtils]: 13: Hoare triple {1667#(= 0 main_~q~0)} goto; {1667#(= 0 main_~q~0)} is VALID [2020-07-10 20:16:44,833 INFO L280 TraceCheckUtils]: 14: Hoare triple {1667#(= 0 main_~q~0)} assume !false; {1667#(= 0 main_~q~0)} is VALID [2020-07-10 20:16:44,834 INFO L280 TraceCheckUtils]: 15: Hoare triple {1667#(= 0 main_~q~0)} assume !(0 == ~q~0); {1658#false} is VALID [2020-07-10 20:16:44,834 INFO L280 TraceCheckUtils]: 16: Hoare triple {1658#false} assume 1 == ~q~0; {1658#false} is VALID [2020-07-10 20:16:44,835 INFO L280 TraceCheckUtils]: 17: Hoare triple {1658#false} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1658#false} is VALID [2020-07-10 20:16:44,835 INFO L280 TraceCheckUtils]: 18: Hoare triple {1658#false} assume 0 != #t~nondet1; {1658#false} is VALID [2020-07-10 20:16:44,835 INFO L280 TraceCheckUtils]: 19: Hoare triple {1658#false} havoc #t~nondet1; {1658#false} is VALID [2020-07-10 20:16:44,836 INFO L280 TraceCheckUtils]: 20: Hoare triple {1658#false} ~method_id~0 := 4; {1658#false} is VALID [2020-07-10 20:16:44,836 INFO L280 TraceCheckUtils]: 21: Hoare triple {1658#false} assume 2 == ~this_state~0; {1658#false} is VALID [2020-07-10 20:16:44,837 INFO L280 TraceCheckUtils]: 22: Hoare triple {1658#false} assume !false; {1658#false} is VALID [2020-07-10 20:16:44,838 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 20:16:44,839 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:16:44,839 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1327764622] [2020-07-10 20:16:44,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:16:44,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 20:16:44,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057728565] [2020-07-10 20:16:44,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-07-10 20:16:44,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:16:44,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 20:16:44,867 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:16:44,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 20:16:44,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:16:44,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 20:16:44,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 20:16:44,869 INFO L87 Difference]: Start difference. First operand 178 states and 213 transitions. Second operand 4 states. [2020-07-10 20:16:46,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:16:46,422 INFO L93 Difference]: Finished difference Result 346 states and 417 transitions. [2020-07-10 20:16:46,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 20:16:46,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-07-10 20:16:46,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:16:46,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 20:16:46,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 417 transitions. [2020-07-10 20:16:46,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 20:16:46,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 417 transitions. [2020-07-10 20:16:46,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 417 transitions. [2020-07-10 20:16:46,968 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 417 edges. 417 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:16:46,974 INFO L225 Difference]: With dead ends: 346 [2020-07-10 20:16:46,974 INFO L226 Difference]: Without dead ends: 181 [2020-07-10 20:16:46,977 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:16:46,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-07-10 20:16:47,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2020-07-10 20:16:47,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:16:47,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand 181 states. [2020-07-10 20:16:47,569 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand 181 states. [2020-07-10 20:16:47,569 INFO L87 Difference]: Start difference. First operand 181 states. Second operand 181 states. [2020-07-10 20:16:47,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:16:47,577 INFO L93 Difference]: Finished difference Result 181 states and 216 transitions. [2020-07-10 20:16:47,577 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 216 transitions. [2020-07-10 20:16:47,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:16:47,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:16:47,579 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand 181 states. [2020-07-10 20:16:47,579 INFO L87 Difference]: Start difference. First operand 181 states. Second operand 181 states. [2020-07-10 20:16:47,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:16:47,587 INFO L93 Difference]: Finished difference Result 181 states and 216 transitions. [2020-07-10 20:16:47,588 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 216 transitions. [2020-07-10 20:16:47,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:16:47,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:16:47,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:16:47,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:16:47,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-07-10 20:16:47,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 216 transitions. [2020-07-10 20:16:47,596 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 216 transitions. Word has length 23 [2020-07-10 20:16:47,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:16:47,597 INFO L479 AbstractCegarLoop]: Abstraction has 181 states and 216 transitions. [2020-07-10 20:16:47,597 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 20:16:47,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 181 states and 216 transitions. [2020-07-10 20:16:47,898 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:16:47,898 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 216 transitions. [2020-07-10 20:16:47,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-10 20:16:47,901 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:16:47,901 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:16:47,901 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:16:47,901 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:16:47,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:16:47,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1840173547, now seen corresponding path program 1 times [2020-07-10 20:16:47,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:16:47,903 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [176027207] [2020-07-10 20:16:47,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:16:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:16:48,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:16:48,027 INFO L280 TraceCheckUtils]: 0: Hoare triple {3100#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {3089#true} is VALID [2020-07-10 20:16:48,027 INFO L280 TraceCheckUtils]: 1: Hoare triple {3089#true} ~m_initVerify~0 := 2; {3089#true} is VALID [2020-07-10 20:16:48,028 INFO L280 TraceCheckUtils]: 2: Hoare triple {3089#true} ~m_Signature~0 := 3; {3089#true} is VALID [2020-07-10 20:16:48,028 INFO L280 TraceCheckUtils]: 3: Hoare triple {3089#true} ~m_sign~0 := 4; {3089#true} is VALID [2020-07-10 20:16:48,028 INFO L280 TraceCheckUtils]: 4: Hoare triple {3089#true} ~m_verify~0 := 5; {3089#true} is VALID [2020-07-10 20:16:48,029 INFO L280 TraceCheckUtils]: 5: Hoare triple {3089#true} ~m_update~0 := 6; {3089#true} is VALID [2020-07-10 20:16:48,029 INFO L280 TraceCheckUtils]: 6: Hoare triple {3089#true} assume true; {3089#true} is VALID [2020-07-10 20:16:48,029 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {3089#true} {3089#true} #484#return; {3089#true} is VALID [2020-07-10 20:16:48,030 INFO L263 TraceCheckUtils]: 0: Hoare triple {3089#true} call ULTIMATE.init(); {3100#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID [2020-07-10 20:16:48,031 INFO L280 TraceCheckUtils]: 1: Hoare triple {3100#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {3089#true} is VALID [2020-07-10 20:16:48,031 INFO L280 TraceCheckUtils]: 2: Hoare triple {3089#true} ~m_initVerify~0 := 2; {3089#true} is VALID [2020-07-10 20:16:48,031 INFO L280 TraceCheckUtils]: 3: Hoare triple {3089#true} ~m_Signature~0 := 3; {3089#true} is VALID [2020-07-10 20:16:48,031 INFO L280 TraceCheckUtils]: 4: Hoare triple {3089#true} ~m_sign~0 := 4; {3089#true} is VALID [2020-07-10 20:16:48,032 INFO L280 TraceCheckUtils]: 5: Hoare triple {3089#true} ~m_verify~0 := 5; {3089#true} is VALID [2020-07-10 20:16:48,032 INFO L280 TraceCheckUtils]: 6: Hoare triple {3089#true} ~m_update~0 := 6; {3089#true} is VALID [2020-07-10 20:16:48,032 INFO L280 TraceCheckUtils]: 7: Hoare triple {3089#true} assume true; {3089#true} is VALID [2020-07-10 20:16:48,033 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {3089#true} {3089#true} #484#return; {3089#true} is VALID [2020-07-10 20:16:48,033 INFO L263 TraceCheckUtils]: 9: Hoare triple {3089#true} call #t~ret21 := main(); {3089#true} is VALID [2020-07-10 20:16:48,033 INFO L280 TraceCheckUtils]: 10: Hoare triple {3089#true} ~q~0 := 0; {3089#true} is VALID [2020-07-10 20:16:48,033 INFO L280 TraceCheckUtils]: 11: Hoare triple {3089#true} havoc ~method_id~0; {3089#true} is VALID [2020-07-10 20:16:48,034 INFO L280 TraceCheckUtils]: 12: Hoare triple {3089#true} ~this_state~0 := 0; {3089#true} is VALID [2020-07-10 20:16:48,034 INFO L280 TraceCheckUtils]: 13: Hoare triple {3089#true} goto; {3089#true} is VALID [2020-07-10 20:16:48,034 INFO L280 TraceCheckUtils]: 14: Hoare triple {3089#true} assume !false; {3089#true} is VALID [2020-07-10 20:16:48,035 INFO L280 TraceCheckUtils]: 15: Hoare triple {3089#true} assume 0 == ~q~0; {3089#true} is VALID [2020-07-10 20:16:48,035 INFO L280 TraceCheckUtils]: 16: Hoare triple {3089#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3089#true} is VALID [2020-07-10 20:16:48,035 INFO L280 TraceCheckUtils]: 17: Hoare triple {3089#true} assume 0 != #t~nondet0; {3089#true} is VALID [2020-07-10 20:16:48,035 INFO L280 TraceCheckUtils]: 18: Hoare triple {3089#true} havoc #t~nondet0; {3089#true} is VALID [2020-07-10 20:16:48,036 INFO L280 TraceCheckUtils]: 19: Hoare triple {3089#true} ~method_id~0 := 3; {3089#true} is VALID [2020-07-10 20:16:48,036 INFO L280 TraceCheckUtils]: 20: Hoare triple {3089#true} assume !false; {3089#true} is VALID [2020-07-10 20:16:48,039 INFO L280 TraceCheckUtils]: 21: Hoare triple {3089#true} ~q~0 := 2; {3099#(<= 2 main_~q~0)} is VALID [2020-07-10 20:16:48,040 INFO L280 TraceCheckUtils]: 22: Hoare triple {3099#(<= 2 main_~q~0)} ~this_state~0 := 0; {3099#(<= 2 main_~q~0)} is VALID [2020-07-10 20:16:48,041 INFO L280 TraceCheckUtils]: 23: Hoare triple {3099#(<= 2 main_~q~0)} assume !false; {3099#(<= 2 main_~q~0)} is VALID [2020-07-10 20:16:48,042 INFO L280 TraceCheckUtils]: 24: Hoare triple {3099#(<= 2 main_~q~0)} assume !(0 == ~q~0); {3099#(<= 2 main_~q~0)} is VALID [2020-07-10 20:16:48,044 INFO L280 TraceCheckUtils]: 25: Hoare triple {3099#(<= 2 main_~q~0)} assume 1 == ~q~0; {3090#false} is VALID [2020-07-10 20:16:48,044 INFO L280 TraceCheckUtils]: 26: Hoare triple {3090#false} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3090#false} is VALID [2020-07-10 20:16:48,044 INFO L280 TraceCheckUtils]: 27: Hoare triple {3090#false} assume 0 != #t~nondet1; {3090#false} is VALID [2020-07-10 20:16:48,045 INFO L280 TraceCheckUtils]: 28: Hoare triple {3090#false} havoc #t~nondet1; {3090#false} is VALID [2020-07-10 20:16:48,045 INFO L280 TraceCheckUtils]: 29: Hoare triple {3090#false} ~method_id~0 := 4; {3090#false} is VALID [2020-07-10 20:16:48,045 INFO L280 TraceCheckUtils]: 30: Hoare triple {3090#false} assume 2 == ~this_state~0; {3090#false} is VALID [2020-07-10 20:16:48,046 INFO L280 TraceCheckUtils]: 31: Hoare triple {3090#false} assume !false; {3090#false} is VALID [2020-07-10 20:16:48,047 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 20:16:48,048 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:16:48,048 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [176027207] [2020-07-10 20:16:48,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:16:48,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 20:16:48,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162127107] [2020-07-10 20:16:48,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2020-07-10 20:16:48,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:16:48,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 20:16:48,084 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 20:16:48,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 20:16:48,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:16:48,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 20:16:48,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 20:16:48,086 INFO L87 Difference]: Start difference. First operand 181 states and 216 transitions. Second operand 4 states. [2020-07-10 20:16:49,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:16:49,278 INFO L93 Difference]: Finished difference Result 330 states and 397 transitions. [2020-07-10 20:16:49,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 20:16:49,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2020-07-10 20:16:49,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:16:49,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 20:16:49,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 395 transitions. [2020-07-10 20:16:49,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 20:16:49,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 395 transitions. [2020-07-10 20:16:49,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 395 transitions. [2020-07-10 20:16:49,829 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 395 edges. 395 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:16:49,836 INFO L225 Difference]: With dead ends: 330 [2020-07-10 20:16:49,836 INFO L226 Difference]: Without dead ends: 163 [2020-07-10 20:16:49,841 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:16:49,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2020-07-10 20:16:50,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2020-07-10 20:16:50,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:16:50,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand 163 states. [2020-07-10 20:16:50,398 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand 163 states. [2020-07-10 20:16:50,398 INFO L87 Difference]: Start difference. First operand 163 states. Second operand 163 states. [2020-07-10 20:16:50,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:16:50,405 INFO L93 Difference]: Finished difference Result 163 states and 193 transitions. [2020-07-10 20:16:50,405 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 193 transitions. [2020-07-10 20:16:50,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:16:50,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:16:50,406 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand 163 states. [2020-07-10 20:16:50,406 INFO L87 Difference]: Start difference. First operand 163 states. Second operand 163 states. [2020-07-10 20:16:50,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:16:50,413 INFO L93 Difference]: Finished difference Result 163 states and 193 transitions. [2020-07-10 20:16:50,413 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 193 transitions. [2020-07-10 20:16:50,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:16:50,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:16:50,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:16:50,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:16:50,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-07-10 20:16:50,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 193 transitions. [2020-07-10 20:16:50,421 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 193 transitions. Word has length 32 [2020-07-10 20:16:50,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:16:50,421 INFO L479 AbstractCegarLoop]: Abstraction has 163 states and 193 transitions. [2020-07-10 20:16:50,421 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 20:16:50,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 163 states and 193 transitions. [2020-07-10 20:16:50,713 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:16:50,714 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 193 transitions. [2020-07-10 20:16:50,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-10 20:16:50,715 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:16:50,715 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:16:50,715 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:16:50,716 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:16:50,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:16:50,716 INFO L82 PathProgramCache]: Analyzing trace with hash 576498569, now seen corresponding path program 1 times [2020-07-10 20:16:50,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:16:50,717 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1656410353] [2020-07-10 20:16:50,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:16:50,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:16:50,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:16:50,797 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {4418#true} is VALID [2020-07-10 20:16:50,797 INFO L280 TraceCheckUtils]: 1: Hoare triple {4418#true} ~m_initVerify~0 := 2; {4418#true} is VALID [2020-07-10 20:16:50,798 INFO L280 TraceCheckUtils]: 2: Hoare triple {4418#true} ~m_Signature~0 := 3; {4418#true} is VALID [2020-07-10 20:16:50,798 INFO L280 TraceCheckUtils]: 3: Hoare triple {4418#true} ~m_sign~0 := 4; {4418#true} is VALID [2020-07-10 20:16:50,798 INFO L280 TraceCheckUtils]: 4: Hoare triple {4418#true} ~m_verify~0 := 5; {4418#true} is VALID [2020-07-10 20:16:50,799 INFO L280 TraceCheckUtils]: 5: Hoare triple {4418#true} ~m_update~0 := 6; {4418#true} is VALID [2020-07-10 20:16:50,799 INFO L280 TraceCheckUtils]: 6: Hoare triple {4418#true} assume true; {4418#true} is VALID [2020-07-10 20:16:50,799 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {4418#true} {4418#true} #484#return; {4418#true} is VALID [2020-07-10 20:16:50,800 INFO L263 TraceCheckUtils]: 0: Hoare triple {4418#true} call ULTIMATE.init(); {4429#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID [2020-07-10 20:16:50,801 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {4418#true} is VALID [2020-07-10 20:16:50,801 INFO L280 TraceCheckUtils]: 2: Hoare triple {4418#true} ~m_initVerify~0 := 2; {4418#true} is VALID [2020-07-10 20:16:50,802 INFO L280 TraceCheckUtils]: 3: Hoare triple {4418#true} ~m_Signature~0 := 3; {4418#true} is VALID [2020-07-10 20:16:50,802 INFO L280 TraceCheckUtils]: 4: Hoare triple {4418#true} ~m_sign~0 := 4; {4418#true} is VALID [2020-07-10 20:16:50,802 INFO L280 TraceCheckUtils]: 5: Hoare triple {4418#true} ~m_verify~0 := 5; {4418#true} is VALID [2020-07-10 20:16:50,802 INFO L280 TraceCheckUtils]: 6: Hoare triple {4418#true} ~m_update~0 := 6; {4418#true} is VALID [2020-07-10 20:16:50,803 INFO L280 TraceCheckUtils]: 7: Hoare triple {4418#true} assume true; {4418#true} is VALID [2020-07-10 20:16:50,803 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {4418#true} {4418#true} #484#return; {4418#true} is VALID [2020-07-10 20:16:50,803 INFO L263 TraceCheckUtils]: 9: Hoare triple {4418#true} call #t~ret21 := main(); {4418#true} is VALID [2020-07-10 20:16:50,804 INFO L280 TraceCheckUtils]: 10: Hoare triple {4418#true} ~q~0 := 0; {4418#true} is VALID [2020-07-10 20:16:50,804 INFO L280 TraceCheckUtils]: 11: Hoare triple {4418#true} havoc ~method_id~0; {4418#true} is VALID [2020-07-10 20:16:50,804 INFO L280 TraceCheckUtils]: 12: Hoare triple {4418#true} ~this_state~0 := 0; {4418#true} is VALID [2020-07-10 20:16:50,804 INFO L280 TraceCheckUtils]: 13: Hoare triple {4418#true} goto; {4418#true} is VALID [2020-07-10 20:16:50,805 INFO L280 TraceCheckUtils]: 14: Hoare triple {4418#true} assume !false; {4418#true} is VALID [2020-07-10 20:16:50,805 INFO L280 TraceCheckUtils]: 15: Hoare triple {4418#true} assume 0 == ~q~0; {4418#true} is VALID [2020-07-10 20:16:50,805 INFO L280 TraceCheckUtils]: 16: Hoare triple {4418#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {4418#true} is VALID [2020-07-10 20:16:50,806 INFO L280 TraceCheckUtils]: 17: Hoare triple {4418#true} assume 0 != #t~nondet0; {4418#true} is VALID [2020-07-10 20:16:50,806 INFO L280 TraceCheckUtils]: 18: Hoare triple {4418#true} havoc #t~nondet0; {4418#true} is VALID [2020-07-10 20:16:50,806 INFO L280 TraceCheckUtils]: 19: Hoare triple {4418#true} ~method_id~0 := 3; {4418#true} is VALID [2020-07-10 20:16:50,807 INFO L280 TraceCheckUtils]: 20: Hoare triple {4418#true} assume !false; {4418#true} is VALID [2020-07-10 20:16:50,807 INFO L280 TraceCheckUtils]: 21: Hoare triple {4418#true} ~q~0 := 2; {4418#true} is VALID [2020-07-10 20:16:50,808 INFO L280 TraceCheckUtils]: 22: Hoare triple {4418#true} ~this_state~0 := 0; {4428#(<= main_~this_state~0 0)} is VALID [2020-07-10 20:16:50,809 INFO L280 TraceCheckUtils]: 23: Hoare triple {4428#(<= main_~this_state~0 0)} assume !false; {4428#(<= main_~this_state~0 0)} is VALID [2020-07-10 20:16:50,809 INFO L280 TraceCheckUtils]: 24: Hoare triple {4428#(<= main_~this_state~0 0)} assume !(0 == ~q~0); {4428#(<= main_~this_state~0 0)} is VALID [2020-07-10 20:16:50,810 INFO L280 TraceCheckUtils]: 25: Hoare triple {4428#(<= main_~this_state~0 0)} assume !(1 == ~q~0); {4428#(<= main_~this_state~0 0)} is VALID [2020-07-10 20:16:50,828 INFO L280 TraceCheckUtils]: 26: Hoare triple {4428#(<= main_~this_state~0 0)} assume 2 == ~q~0; {4428#(<= main_~this_state~0 0)} is VALID [2020-07-10 20:16:50,842 INFO L280 TraceCheckUtils]: 27: Hoare triple {4428#(<= main_~this_state~0 0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {4428#(<= main_~this_state~0 0)} is VALID [2020-07-10 20:16:50,843 INFO L280 TraceCheckUtils]: 28: Hoare triple {4428#(<= main_~this_state~0 0)} assume !(0 != #t~nondet4); {4428#(<= main_~this_state~0 0)} is VALID [2020-07-10 20:16:50,843 INFO L280 TraceCheckUtils]: 29: Hoare triple {4428#(<= main_~this_state~0 0)} havoc #t~nondet4; {4428#(<= main_~this_state~0 0)} is VALID [2020-07-10 20:16:50,844 INFO L280 TraceCheckUtils]: 30: Hoare triple {4428#(<= main_~this_state~0 0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {4428#(<= main_~this_state~0 0)} is VALID [2020-07-10 20:16:50,844 INFO L280 TraceCheckUtils]: 31: Hoare triple {4428#(<= main_~this_state~0 0)} assume !(0 != #t~nondet5); {4428#(<= main_~this_state~0 0)} is VALID [2020-07-10 20:16:50,845 INFO L280 TraceCheckUtils]: 32: Hoare triple {4428#(<= main_~this_state~0 0)} havoc #t~nondet5; {4428#(<= main_~this_state~0 0)} is VALID [2020-07-10 20:16:50,845 INFO L280 TraceCheckUtils]: 33: Hoare triple {4428#(<= main_~this_state~0 0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {4428#(<= main_~this_state~0 0)} is VALID [2020-07-10 20:16:50,846 INFO L280 TraceCheckUtils]: 34: Hoare triple {4428#(<= main_~this_state~0 0)} assume 0 != #t~nondet6; {4428#(<= main_~this_state~0 0)} is VALID [2020-07-10 20:16:50,847 INFO L280 TraceCheckUtils]: 35: Hoare triple {4428#(<= main_~this_state~0 0)} havoc #t~nondet6; {4428#(<= main_~this_state~0 0)} is VALID [2020-07-10 20:16:50,847 INFO L280 TraceCheckUtils]: 36: Hoare triple {4428#(<= main_~this_state~0 0)} ~method_id~0 := 4; {4428#(<= main_~this_state~0 0)} is VALID [2020-07-10 20:16:50,848 INFO L280 TraceCheckUtils]: 37: Hoare triple {4428#(<= main_~this_state~0 0)} assume 2 == ~this_state~0; {4419#false} is VALID [2020-07-10 20:16:50,848 INFO L280 TraceCheckUtils]: 38: Hoare triple {4419#false} assume !false; {4419#false} is VALID [2020-07-10 20:16:50,851 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 20:16:50,851 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:16:50,851 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1656410353] [2020-07-10 20:16:50,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:16:50,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 20:16:50,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730890186] [2020-07-10 20:16:50,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-07-10 20:16:50,853 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:16:50,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 20:16:50,907 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:16:50,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 20:16:50,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:16:50,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 20:16:50,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 20:16:50,908 INFO L87 Difference]: Start difference. First operand 163 states and 193 transitions. Second operand 4 states. [2020-07-10 20:16:53,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:16:53,086 INFO L93 Difference]: Finished difference Result 429 states and 517 transitions. [2020-07-10 20:16:53,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 20:16:53,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-07-10 20:16:53,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:16:53,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 20:16:53,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 515 transitions. [2020-07-10 20:16:53,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 20:16:53,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 515 transitions. [2020-07-10 20:16:53,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 515 transitions. [2020-07-10 20:16:53,787 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 515 edges. 515 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:16:53,794 INFO L225 Difference]: With dead ends: 429 [2020-07-10 20:16:53,794 INFO L226 Difference]: Without dead ends: 275 [2020-07-10 20:16:53,795 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:16:53,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-07-10 20:16:54,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 243. [2020-07-10 20:16:54,730 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:16:54,730 INFO L82 GeneralOperation]: Start isEquivalent. First operand 275 states. Second operand 243 states. [2020-07-10 20:16:54,730 INFO L74 IsIncluded]: Start isIncluded. First operand 275 states. Second operand 243 states. [2020-07-10 20:16:54,730 INFO L87 Difference]: Start difference. First operand 275 states. Second operand 243 states. [2020-07-10 20:16:54,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:16:54,741 INFO L93 Difference]: Finished difference Result 275 states and 319 transitions. [2020-07-10 20:16:54,742 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 319 transitions. [2020-07-10 20:16:54,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:16:54,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:16:54,743 INFO L74 IsIncluded]: Start isIncluded. First operand 243 states. Second operand 275 states. [2020-07-10 20:16:54,743 INFO L87 Difference]: Start difference. First operand 243 states. Second operand 275 states. [2020-07-10 20:16:54,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:16:54,754 INFO L93 Difference]: Finished difference Result 275 states and 319 transitions. [2020-07-10 20:16:54,754 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 319 transitions. [2020-07-10 20:16:54,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:16:54,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:16:54,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:16:54,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:16:54,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2020-07-10 20:16:54,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 288 transitions. [2020-07-10 20:16:54,765 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 288 transitions. Word has length 39 [2020-07-10 20:16:54,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:16:54,765 INFO L479 AbstractCegarLoop]: Abstraction has 243 states and 288 transitions. [2020-07-10 20:16:54,765 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 20:16:54,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 243 states and 288 transitions. [2020-07-10 20:16:55,221 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 288 edges. 288 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:16:55,221 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 288 transitions. [2020-07-10 20:16:55,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-10 20:16:55,223 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:16:55,223 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:16:55,224 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 20:16:55,224 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:16:55,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:16:55,225 INFO L82 PathProgramCache]: Analyzing trace with hash -47890514, now seen corresponding path program 1 times [2020-07-10 20:16:55,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:16:55,225 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1317493646] [2020-07-10 20:16:55,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:16:55,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:16:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:16:55,316 INFO L280 TraceCheckUtils]: 0: Hoare triple {6340#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {6329#true} is VALID [2020-07-10 20:16:55,317 INFO L280 TraceCheckUtils]: 1: Hoare triple {6329#true} ~m_initVerify~0 := 2; {6329#true} is VALID [2020-07-10 20:16:55,317 INFO L280 TraceCheckUtils]: 2: Hoare triple {6329#true} ~m_Signature~0 := 3; {6329#true} is VALID [2020-07-10 20:16:55,317 INFO L280 TraceCheckUtils]: 3: Hoare triple {6329#true} ~m_sign~0 := 4; {6329#true} is VALID [2020-07-10 20:16:55,317 INFO L280 TraceCheckUtils]: 4: Hoare triple {6329#true} ~m_verify~0 := 5; {6329#true} is VALID [2020-07-10 20:16:55,317 INFO L280 TraceCheckUtils]: 5: Hoare triple {6329#true} ~m_update~0 := 6; {6329#true} is VALID [2020-07-10 20:16:55,318 INFO L280 TraceCheckUtils]: 6: Hoare triple {6329#true} assume true; {6329#true} is VALID [2020-07-10 20:16:55,318 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {6329#true} {6329#true} #484#return; {6329#true} is VALID [2020-07-10 20:16:55,319 INFO L263 TraceCheckUtils]: 0: Hoare triple {6329#true} call ULTIMATE.init(); {6340#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID [2020-07-10 20:16:55,319 INFO L280 TraceCheckUtils]: 1: Hoare triple {6340#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {6329#true} is VALID [2020-07-10 20:16:55,319 INFO L280 TraceCheckUtils]: 2: Hoare triple {6329#true} ~m_initVerify~0 := 2; {6329#true} is VALID [2020-07-10 20:16:55,319 INFO L280 TraceCheckUtils]: 3: Hoare triple {6329#true} ~m_Signature~0 := 3; {6329#true} is VALID [2020-07-10 20:16:55,320 INFO L280 TraceCheckUtils]: 4: Hoare triple {6329#true} ~m_sign~0 := 4; {6329#true} is VALID [2020-07-10 20:16:55,320 INFO L280 TraceCheckUtils]: 5: Hoare triple {6329#true} ~m_verify~0 := 5; {6329#true} is VALID [2020-07-10 20:16:55,320 INFO L280 TraceCheckUtils]: 6: Hoare triple {6329#true} ~m_update~0 := 6; {6329#true} is VALID [2020-07-10 20:16:55,320 INFO L280 TraceCheckUtils]: 7: Hoare triple {6329#true} assume true; {6329#true} is VALID [2020-07-10 20:16:55,320 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {6329#true} {6329#true} #484#return; {6329#true} is VALID [2020-07-10 20:16:55,321 INFO L263 TraceCheckUtils]: 9: Hoare triple {6329#true} call #t~ret21 := main(); {6329#true} is VALID [2020-07-10 20:16:55,321 INFO L280 TraceCheckUtils]: 10: Hoare triple {6329#true} ~q~0 := 0; {6329#true} is VALID [2020-07-10 20:16:55,321 INFO L280 TraceCheckUtils]: 11: Hoare triple {6329#true} havoc ~method_id~0; {6329#true} is VALID [2020-07-10 20:16:55,321 INFO L280 TraceCheckUtils]: 12: Hoare triple {6329#true} ~this_state~0 := 0; {6329#true} is VALID [2020-07-10 20:16:55,321 INFO L280 TraceCheckUtils]: 13: Hoare triple {6329#true} goto; {6329#true} is VALID [2020-07-10 20:16:55,322 INFO L280 TraceCheckUtils]: 14: Hoare triple {6329#true} assume !false; {6329#true} is VALID [2020-07-10 20:16:55,322 INFO L280 TraceCheckUtils]: 15: Hoare triple {6329#true} assume 0 == ~q~0; {6329#true} is VALID [2020-07-10 20:16:55,322 INFO L280 TraceCheckUtils]: 16: Hoare triple {6329#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {6329#true} is VALID [2020-07-10 20:16:55,322 INFO L280 TraceCheckUtils]: 17: Hoare triple {6329#true} assume 0 != #t~nondet0; {6329#true} is VALID [2020-07-10 20:16:55,323 INFO L280 TraceCheckUtils]: 18: Hoare triple {6329#true} havoc #t~nondet0; {6329#true} is VALID [2020-07-10 20:16:55,323 INFO L280 TraceCheckUtils]: 19: Hoare triple {6329#true} ~method_id~0 := 3; {6329#true} is VALID [2020-07-10 20:16:55,323 INFO L280 TraceCheckUtils]: 20: Hoare triple {6329#true} assume !false; {6329#true} is VALID [2020-07-10 20:16:55,324 INFO L280 TraceCheckUtils]: 21: Hoare triple {6329#true} ~q~0 := 2; {6339#(= 2 main_~q~0)} is VALID [2020-07-10 20:16:55,324 INFO L280 TraceCheckUtils]: 22: Hoare triple {6339#(= 2 main_~q~0)} ~this_state~0 := 0; {6339#(= 2 main_~q~0)} is VALID [2020-07-10 20:16:55,325 INFO L280 TraceCheckUtils]: 23: Hoare triple {6339#(= 2 main_~q~0)} assume !false; {6339#(= 2 main_~q~0)} is VALID [2020-07-10 20:16:55,325 INFO L280 TraceCheckUtils]: 24: Hoare triple {6339#(= 2 main_~q~0)} assume !(0 == ~q~0); {6339#(= 2 main_~q~0)} is VALID [2020-07-10 20:16:55,326 INFO L280 TraceCheckUtils]: 25: Hoare triple {6339#(= 2 main_~q~0)} assume !(1 == ~q~0); {6339#(= 2 main_~q~0)} is VALID [2020-07-10 20:16:55,326 INFO L280 TraceCheckUtils]: 26: Hoare triple {6339#(= 2 main_~q~0)} assume !(2 == ~q~0); {6330#false} is VALID [2020-07-10 20:16:55,327 INFO L280 TraceCheckUtils]: 27: Hoare triple {6330#false} assume 3 == ~q~0; {6330#false} is VALID [2020-07-10 20:16:55,327 INFO L280 TraceCheckUtils]: 28: Hoare triple {6330#false} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {6330#false} is VALID [2020-07-10 20:16:55,327 INFO L280 TraceCheckUtils]: 29: Hoare triple {6330#false} assume !(0 != #t~nondet9); {6330#false} is VALID [2020-07-10 20:16:55,328 INFO L280 TraceCheckUtils]: 30: Hoare triple {6330#false} havoc #t~nondet9; {6330#false} is VALID [2020-07-10 20:16:55,328 INFO L280 TraceCheckUtils]: 31: Hoare triple {6330#false} assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; {6330#false} is VALID [2020-07-10 20:16:55,328 INFO L280 TraceCheckUtils]: 32: Hoare triple {6330#false} assume !(0 != #t~nondet10); {6330#false} is VALID [2020-07-10 20:16:55,328 INFO L280 TraceCheckUtils]: 33: Hoare triple {6330#false} havoc #t~nondet10; {6330#false} is VALID [2020-07-10 20:16:55,329 INFO L280 TraceCheckUtils]: 34: Hoare triple {6330#false} assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; {6330#false} is VALID [2020-07-10 20:16:55,329 INFO L280 TraceCheckUtils]: 35: Hoare triple {6330#false} assume 0 != #t~nondet11; {6330#false} is VALID [2020-07-10 20:16:55,329 INFO L280 TraceCheckUtils]: 36: Hoare triple {6330#false} havoc #t~nondet11; {6330#false} is VALID [2020-07-10 20:16:55,330 INFO L280 TraceCheckUtils]: 37: Hoare triple {6330#false} ~method_id~0 := 4; {6330#false} is VALID [2020-07-10 20:16:55,330 INFO L280 TraceCheckUtils]: 38: Hoare triple {6330#false} assume 2 != ~this_state~0; {6330#false} is VALID [2020-07-10 20:16:55,330 INFO L280 TraceCheckUtils]: 39: Hoare triple {6330#false} assume !false; {6330#false} is VALID [2020-07-10 20:16:55,332 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 20:16:55,333 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:16:55,333 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1317493646] [2020-07-10 20:16:55,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:16:55,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 20:16:55,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379292859] [2020-07-10 20:16:55,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2020-07-10 20:16:55,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:16:55,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 20:16:55,382 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:16:55,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 20:16:55,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:16:55,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 20:16:55,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 20:16:55,386 INFO L87 Difference]: Start difference. First operand 243 states and 288 transitions. Second operand 4 states. [2020-07-10 20:16:56,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:16:56,851 INFO L93 Difference]: Finished difference Result 407 states and 484 transitions. [2020-07-10 20:16:56,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 20:16:56,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2020-07-10 20:16:56,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:16:56,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 20:16:56,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 365 transitions. [2020-07-10 20:16:56,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 20:16:56,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 365 transitions. [2020-07-10 20:16:56,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 365 transitions. [2020-07-10 20:16:57,293 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 365 edges. 365 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:16:57,297 INFO L225 Difference]: With dead ends: 407 [2020-07-10 20:16:57,298 INFO L226 Difference]: Without dead ends: 188 [2020-07-10 20:16:57,299 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:16:57,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-07-10 20:16:58,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2020-07-10 20:16:58,159 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:16:58,159 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand 186 states. [2020-07-10 20:16:58,159 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand 186 states. [2020-07-10 20:16:58,159 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 186 states. [2020-07-10 20:16:58,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:16:58,169 INFO L93 Difference]: Finished difference Result 188 states and 219 transitions. [2020-07-10 20:16:58,169 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 219 transitions. [2020-07-10 20:16:58,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:16:58,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:16:58,170 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand 188 states. [2020-07-10 20:16:58,170 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 188 states. [2020-07-10 20:16:58,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:16:58,175 INFO L93 Difference]: Finished difference Result 188 states and 219 transitions. [2020-07-10 20:16:58,176 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 219 transitions. [2020-07-10 20:16:58,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:16:58,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:16:58,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:16:58,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:16:58,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-07-10 20:16:58,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 218 transitions. [2020-07-10 20:16:58,182 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 218 transitions. Word has length 40 [2020-07-10 20:16:58,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:16:58,182 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 218 transitions. [2020-07-10 20:16:58,182 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 20:16:58,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 186 states and 218 transitions. [2020-07-10 20:16:58,529 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:16:58,529 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 218 transitions. [2020-07-10 20:16:58,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-10 20:16:58,531 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:16:58,532 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:16:58,532 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 20:16:58,532 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:16:58,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:16:58,533 INFO L82 PathProgramCache]: Analyzing trace with hash 946604760, now seen corresponding path program 1 times [2020-07-10 20:16:58,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:16:58,538 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [826339782] [2020-07-10 20:16:58,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:16:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:16:58,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:16:58,644 INFO L280 TraceCheckUtils]: 0: Hoare triple {7919#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {7908#true} is VALID [2020-07-10 20:16:58,645 INFO L280 TraceCheckUtils]: 1: Hoare triple {7908#true} ~m_initVerify~0 := 2; {7908#true} is VALID [2020-07-10 20:16:58,645 INFO L280 TraceCheckUtils]: 2: Hoare triple {7908#true} ~m_Signature~0 := 3; {7908#true} is VALID [2020-07-10 20:16:58,645 INFO L280 TraceCheckUtils]: 3: Hoare triple {7908#true} ~m_sign~0 := 4; {7908#true} is VALID [2020-07-10 20:16:58,646 INFO L280 TraceCheckUtils]: 4: Hoare triple {7908#true} ~m_verify~0 := 5; {7908#true} is VALID [2020-07-10 20:16:58,646 INFO L280 TraceCheckUtils]: 5: Hoare triple {7908#true} ~m_update~0 := 6; {7908#true} is VALID [2020-07-10 20:16:58,646 INFO L280 TraceCheckUtils]: 6: Hoare triple {7908#true} assume true; {7908#true} is VALID [2020-07-10 20:16:58,647 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {7908#true} {7908#true} #484#return; {7908#true} is VALID [2020-07-10 20:16:58,648 INFO L263 TraceCheckUtils]: 0: Hoare triple {7908#true} call ULTIMATE.init(); {7919#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID [2020-07-10 20:16:58,649 INFO L280 TraceCheckUtils]: 1: Hoare triple {7919#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {7908#true} is VALID [2020-07-10 20:16:58,649 INFO L280 TraceCheckUtils]: 2: Hoare triple {7908#true} ~m_initVerify~0 := 2; {7908#true} is VALID [2020-07-10 20:16:58,649 INFO L280 TraceCheckUtils]: 3: Hoare triple {7908#true} ~m_Signature~0 := 3; {7908#true} is VALID [2020-07-10 20:16:58,650 INFO L280 TraceCheckUtils]: 4: Hoare triple {7908#true} ~m_sign~0 := 4; {7908#true} is VALID [2020-07-10 20:16:58,650 INFO L280 TraceCheckUtils]: 5: Hoare triple {7908#true} ~m_verify~0 := 5; {7908#true} is VALID [2020-07-10 20:16:58,651 INFO L280 TraceCheckUtils]: 6: Hoare triple {7908#true} ~m_update~0 := 6; {7908#true} is VALID [2020-07-10 20:16:58,651 INFO L280 TraceCheckUtils]: 7: Hoare triple {7908#true} assume true; {7908#true} is VALID [2020-07-10 20:16:58,651 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {7908#true} {7908#true} #484#return; {7908#true} is VALID [2020-07-10 20:16:58,652 INFO L263 TraceCheckUtils]: 9: Hoare triple {7908#true} call #t~ret21 := main(); {7908#true} is VALID [2020-07-10 20:16:58,652 INFO L280 TraceCheckUtils]: 10: Hoare triple {7908#true} ~q~0 := 0; {7908#true} is VALID [2020-07-10 20:16:58,652 INFO L280 TraceCheckUtils]: 11: Hoare triple {7908#true} havoc ~method_id~0; {7908#true} is VALID [2020-07-10 20:16:58,653 INFO L280 TraceCheckUtils]: 12: Hoare triple {7908#true} ~this_state~0 := 0; {7908#true} is VALID [2020-07-10 20:16:58,653 INFO L280 TraceCheckUtils]: 13: Hoare triple {7908#true} goto; {7908#true} is VALID [2020-07-10 20:16:58,653 INFO L280 TraceCheckUtils]: 14: Hoare triple {7908#true} assume !false; {7908#true} is VALID [2020-07-10 20:16:58,654 INFO L280 TraceCheckUtils]: 15: Hoare triple {7908#true} assume 0 == ~q~0; {7908#true} is VALID [2020-07-10 20:16:58,654 INFO L280 TraceCheckUtils]: 16: Hoare triple {7908#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {7908#true} is VALID [2020-07-10 20:16:58,654 INFO L280 TraceCheckUtils]: 17: Hoare triple {7908#true} assume 0 != #t~nondet0; {7908#true} is VALID [2020-07-10 20:16:58,655 INFO L280 TraceCheckUtils]: 18: Hoare triple {7908#true} havoc #t~nondet0; {7908#true} is VALID [2020-07-10 20:16:58,655 INFO L280 TraceCheckUtils]: 19: Hoare triple {7908#true} ~method_id~0 := 3; {7908#true} is VALID [2020-07-10 20:16:58,655 INFO L280 TraceCheckUtils]: 20: Hoare triple {7908#true} assume !false; {7908#true} is VALID [2020-07-10 20:16:58,668 INFO L280 TraceCheckUtils]: 21: Hoare triple {7908#true} ~q~0 := 2; {7908#true} is VALID [2020-07-10 20:16:58,668 INFO L280 TraceCheckUtils]: 22: Hoare triple {7908#true} ~this_state~0 := 0; {7908#true} is VALID [2020-07-10 20:16:58,669 INFO L280 TraceCheckUtils]: 23: Hoare triple {7908#true} assume !false; {7908#true} is VALID [2020-07-10 20:16:58,669 INFO L280 TraceCheckUtils]: 24: Hoare triple {7908#true} assume !(0 == ~q~0); {7908#true} is VALID [2020-07-10 20:16:58,669 INFO L280 TraceCheckUtils]: 25: Hoare triple {7908#true} assume !(1 == ~q~0); {7908#true} is VALID [2020-07-10 20:16:58,670 INFO L280 TraceCheckUtils]: 26: Hoare triple {7908#true} assume 2 == ~q~0; {7908#true} is VALID [2020-07-10 20:16:58,670 INFO L280 TraceCheckUtils]: 27: Hoare triple {7908#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {7908#true} is VALID [2020-07-10 20:16:58,670 INFO L280 TraceCheckUtils]: 28: Hoare triple {7908#true} assume 0 != #t~nondet4; {7908#true} is VALID [2020-07-10 20:16:58,671 INFO L280 TraceCheckUtils]: 29: Hoare triple {7908#true} havoc #t~nondet4; {7908#true} is VALID [2020-07-10 20:16:58,671 INFO L280 TraceCheckUtils]: 30: Hoare triple {7908#true} ~method_id~0 := 1; {7908#true} is VALID [2020-07-10 20:16:58,671 INFO L280 TraceCheckUtils]: 31: Hoare triple {7908#true} assume !false; {7908#true} is VALID [2020-07-10 20:16:58,672 INFO L280 TraceCheckUtils]: 32: Hoare triple {7908#true} ~q~0 := 3; {7918#(<= 3 main_~q~0)} is VALID [2020-07-10 20:16:58,673 INFO L280 TraceCheckUtils]: 33: Hoare triple {7918#(<= 3 main_~q~0)} ~this_state~0 := 2; {7918#(<= 3 main_~q~0)} is VALID [2020-07-10 20:16:58,674 INFO L280 TraceCheckUtils]: 34: Hoare triple {7918#(<= 3 main_~q~0)} assume !false; {7918#(<= 3 main_~q~0)} is VALID [2020-07-10 20:16:58,674 INFO L280 TraceCheckUtils]: 35: Hoare triple {7918#(<= 3 main_~q~0)} assume !(0 == ~q~0); {7918#(<= 3 main_~q~0)} is VALID [2020-07-10 20:16:58,675 INFO L280 TraceCheckUtils]: 36: Hoare triple {7918#(<= 3 main_~q~0)} assume !(1 == ~q~0); {7918#(<= 3 main_~q~0)} is VALID [2020-07-10 20:16:58,676 INFO L280 TraceCheckUtils]: 37: Hoare triple {7918#(<= 3 main_~q~0)} assume 2 == ~q~0; {7909#false} is VALID [2020-07-10 20:16:58,676 INFO L280 TraceCheckUtils]: 38: Hoare triple {7909#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {7909#false} is VALID [2020-07-10 20:16:58,676 INFO L280 TraceCheckUtils]: 39: Hoare triple {7909#false} assume !(0 != #t~nondet4); {7909#false} is VALID [2020-07-10 20:16:58,677 INFO L280 TraceCheckUtils]: 40: Hoare triple {7909#false} havoc #t~nondet4; {7909#false} is VALID [2020-07-10 20:16:58,677 INFO L280 TraceCheckUtils]: 41: Hoare triple {7909#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {7909#false} is VALID [2020-07-10 20:16:58,677 INFO L280 TraceCheckUtils]: 42: Hoare triple {7909#false} assume !(0 != #t~nondet5); {7909#false} is VALID [2020-07-10 20:16:58,677 INFO L280 TraceCheckUtils]: 43: Hoare triple {7909#false} havoc #t~nondet5; {7909#false} is VALID [2020-07-10 20:16:58,678 INFO L280 TraceCheckUtils]: 44: Hoare triple {7909#false} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {7909#false} is VALID [2020-07-10 20:16:58,678 INFO L280 TraceCheckUtils]: 45: Hoare triple {7909#false} assume 0 != #t~nondet6; {7909#false} is VALID [2020-07-10 20:16:58,678 INFO L280 TraceCheckUtils]: 46: Hoare triple {7909#false} havoc #t~nondet6; {7909#false} is VALID [2020-07-10 20:16:58,678 INFO L280 TraceCheckUtils]: 47: Hoare triple {7909#false} ~method_id~0 := 4; {7909#false} is VALID [2020-07-10 20:16:58,678 INFO L280 TraceCheckUtils]: 48: Hoare triple {7909#false} assume 2 == ~this_state~0; {7909#false} is VALID [2020-07-10 20:16:58,679 INFO L280 TraceCheckUtils]: 49: Hoare triple {7909#false} assume !false; {7909#false} is VALID [2020-07-10 20:16:58,683 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 20:16:58,683 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:16:58,684 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [826339782] [2020-07-10 20:16:58,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:16:58,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 20:16:58,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29944103] [2020-07-10 20:16:58,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2020-07-10 20:16:58,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:16:58,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 20:16:58,730 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:16:58,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 20:16:58,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:16:58,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 20:16:58,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 20:16:58,731 INFO L87 Difference]: Start difference. First operand 186 states and 218 transitions. Second operand 4 states. [2020-07-10 20:16:59,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:16:59,947 INFO L93 Difference]: Finished difference Result 301 states and 357 transitions. [2020-07-10 20:16:59,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 20:16:59,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2020-07-10 20:16:59,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:16:59,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 20:16:59,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 352 transitions. [2020-07-10 20:16:59,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 20:16:59,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 352 transitions. [2020-07-10 20:16:59,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 352 transitions. [2020-07-10 20:17:00,396 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 352 edges. 352 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:17:00,401 INFO L225 Difference]: With dead ends: 301 [2020-07-10 20:17:00,402 INFO L226 Difference]: Without dead ends: 158 [2020-07-10 20:17:00,403 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:17:00,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-07-10 20:17:01,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2020-07-10 20:17:01,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:17:01,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand 158 states. [2020-07-10 20:17:01,009 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 158 states. [2020-07-10 20:17:01,009 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 158 states. [2020-07-10 20:17:01,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:17:01,014 INFO L93 Difference]: Finished difference Result 158 states and 184 transitions. [2020-07-10 20:17:01,014 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 184 transitions. [2020-07-10 20:17:01,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:17:01,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:17:01,015 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 158 states. [2020-07-10 20:17:01,015 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 158 states. [2020-07-10 20:17:01,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:17:01,019 INFO L93 Difference]: Finished difference Result 158 states and 184 transitions. [2020-07-10 20:17:01,019 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 184 transitions. [2020-07-10 20:17:01,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:17:01,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:17:01,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:17:01,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:17:01,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2020-07-10 20:17:01,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 184 transitions. [2020-07-10 20:17:01,024 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 184 transitions. Word has length 50 [2020-07-10 20:17:01,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:17:01,024 INFO L479 AbstractCegarLoop]: Abstraction has 158 states and 184 transitions. [2020-07-10 20:17:01,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 20:17:01,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 158 states and 184 transitions. [2020-07-10 20:17:01,323 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:17:01,324 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 184 transitions. [2020-07-10 20:17:01,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-10 20:17:01,325 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:17:01,325 INFO L422 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:17:01,326 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 20:17:01,326 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:17:01,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:17:01,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1459500481, now seen corresponding path program 1 times [2020-07-10 20:17:01,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:17:01,327 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1885844715] [2020-07-10 20:17:01,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:17:01,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:17:01,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:17:01,474 INFO L280 TraceCheckUtils]: 0: Hoare triple {9170#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {9159#true} is VALID [2020-07-10 20:17:01,474 INFO L280 TraceCheckUtils]: 1: Hoare triple {9159#true} ~m_initVerify~0 := 2; {9159#true} is VALID [2020-07-10 20:17:01,475 INFO L280 TraceCheckUtils]: 2: Hoare triple {9159#true} ~m_Signature~0 := 3; {9159#true} is VALID [2020-07-10 20:17:01,475 INFO L280 TraceCheckUtils]: 3: Hoare triple {9159#true} ~m_sign~0 := 4; {9159#true} is VALID [2020-07-10 20:17:01,478 INFO L280 TraceCheckUtils]: 4: Hoare triple {9159#true} ~m_verify~0 := 5; {9159#true} is VALID [2020-07-10 20:17:01,479 INFO L280 TraceCheckUtils]: 5: Hoare triple {9159#true} ~m_update~0 := 6; {9159#true} is VALID [2020-07-10 20:17:01,479 INFO L280 TraceCheckUtils]: 6: Hoare triple {9159#true} assume true; {9159#true} is VALID [2020-07-10 20:17:01,479 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {9159#true} {9159#true} #484#return; {9159#true} is VALID [2020-07-10 20:17:01,482 INFO L263 TraceCheckUtils]: 0: Hoare triple {9159#true} call ULTIMATE.init(); {9170#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID [2020-07-10 20:17:01,483 INFO L280 TraceCheckUtils]: 1: Hoare triple {9170#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {9159#true} is VALID [2020-07-10 20:17:01,483 INFO L280 TraceCheckUtils]: 2: Hoare triple {9159#true} ~m_initVerify~0 := 2; {9159#true} is VALID [2020-07-10 20:17:01,484 INFO L280 TraceCheckUtils]: 3: Hoare triple {9159#true} ~m_Signature~0 := 3; {9159#true} is VALID [2020-07-10 20:17:01,484 INFO L280 TraceCheckUtils]: 4: Hoare triple {9159#true} ~m_sign~0 := 4; {9159#true} is VALID [2020-07-10 20:17:01,484 INFO L280 TraceCheckUtils]: 5: Hoare triple {9159#true} ~m_verify~0 := 5; {9159#true} is VALID [2020-07-10 20:17:01,484 INFO L280 TraceCheckUtils]: 6: Hoare triple {9159#true} ~m_update~0 := 6; {9159#true} is VALID [2020-07-10 20:17:01,485 INFO L280 TraceCheckUtils]: 7: Hoare triple {9159#true} assume true; {9159#true} is VALID [2020-07-10 20:17:01,485 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {9159#true} {9159#true} #484#return; {9159#true} is VALID [2020-07-10 20:17:01,485 INFO L263 TraceCheckUtils]: 9: Hoare triple {9159#true} call #t~ret21 := main(); {9159#true} is VALID [2020-07-10 20:17:01,485 INFO L280 TraceCheckUtils]: 10: Hoare triple {9159#true} ~q~0 := 0; {9159#true} is VALID [2020-07-10 20:17:01,485 INFO L280 TraceCheckUtils]: 11: Hoare triple {9159#true} havoc ~method_id~0; {9159#true} is VALID [2020-07-10 20:17:01,486 INFO L280 TraceCheckUtils]: 12: Hoare triple {9159#true} ~this_state~0 := 0; {9159#true} is VALID [2020-07-10 20:17:01,486 INFO L280 TraceCheckUtils]: 13: Hoare triple {9159#true} goto; {9159#true} is VALID [2020-07-10 20:17:01,486 INFO L280 TraceCheckUtils]: 14: Hoare triple {9159#true} assume !false; {9159#true} is VALID [2020-07-10 20:17:01,486 INFO L280 TraceCheckUtils]: 15: Hoare triple {9159#true} assume 0 == ~q~0; {9159#true} is VALID [2020-07-10 20:17:01,487 INFO L280 TraceCheckUtils]: 16: Hoare triple {9159#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {9159#true} is VALID [2020-07-10 20:17:01,487 INFO L280 TraceCheckUtils]: 17: Hoare triple {9159#true} assume 0 != #t~nondet0; {9159#true} is VALID [2020-07-10 20:17:01,487 INFO L280 TraceCheckUtils]: 18: Hoare triple {9159#true} havoc #t~nondet0; {9159#true} is VALID [2020-07-10 20:17:01,487 INFO L280 TraceCheckUtils]: 19: Hoare triple {9159#true} ~method_id~0 := 3; {9159#true} is VALID [2020-07-10 20:17:01,487 INFO L280 TraceCheckUtils]: 20: Hoare triple {9159#true} assume !false; {9159#true} is VALID [2020-07-10 20:17:01,488 INFO L280 TraceCheckUtils]: 21: Hoare triple {9159#true} ~q~0 := 2; {9159#true} is VALID [2020-07-10 20:17:01,488 INFO L280 TraceCheckUtils]: 22: Hoare triple {9159#true} ~this_state~0 := 0; {9159#true} is VALID [2020-07-10 20:17:01,488 INFO L280 TraceCheckUtils]: 23: Hoare triple {9159#true} assume !false; {9159#true} is VALID [2020-07-10 20:17:01,488 INFO L280 TraceCheckUtils]: 24: Hoare triple {9159#true} assume !(0 == ~q~0); {9159#true} is VALID [2020-07-10 20:17:01,489 INFO L280 TraceCheckUtils]: 25: Hoare triple {9159#true} assume !(1 == ~q~0); {9159#true} is VALID [2020-07-10 20:17:01,489 INFO L280 TraceCheckUtils]: 26: Hoare triple {9159#true} assume 2 == ~q~0; {9159#true} is VALID [2020-07-10 20:17:01,489 INFO L280 TraceCheckUtils]: 27: Hoare triple {9159#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {9159#true} is VALID [2020-07-10 20:17:01,490 INFO L280 TraceCheckUtils]: 28: Hoare triple {9159#true} assume 0 != #t~nondet4; {9159#true} is VALID [2020-07-10 20:17:01,490 INFO L280 TraceCheckUtils]: 29: Hoare triple {9159#true} havoc #t~nondet4; {9159#true} is VALID [2020-07-10 20:17:01,490 INFO L280 TraceCheckUtils]: 30: Hoare triple {9159#true} ~method_id~0 := 1; {9159#true} is VALID [2020-07-10 20:17:01,490 INFO L280 TraceCheckUtils]: 31: Hoare triple {9159#true} assume !false; {9159#true} is VALID [2020-07-10 20:17:01,491 INFO L280 TraceCheckUtils]: 32: Hoare triple {9159#true} ~q~0 := 3; {9159#true} is VALID [2020-07-10 20:17:01,494 INFO L280 TraceCheckUtils]: 33: Hoare triple {9159#true} ~this_state~0 := 2; {9169#(= 2 main_~this_state~0)} is VALID [2020-07-10 20:17:01,495 INFO L280 TraceCheckUtils]: 34: Hoare triple {9169#(= 2 main_~this_state~0)} assume !false; {9169#(= 2 main_~this_state~0)} is VALID [2020-07-10 20:17:01,496 INFO L280 TraceCheckUtils]: 35: Hoare triple {9169#(= 2 main_~this_state~0)} assume !(0 == ~q~0); {9169#(= 2 main_~this_state~0)} is VALID [2020-07-10 20:17:01,496 INFO L280 TraceCheckUtils]: 36: Hoare triple {9169#(= 2 main_~this_state~0)} assume !(1 == ~q~0); {9169#(= 2 main_~this_state~0)} is VALID [2020-07-10 20:17:01,497 INFO L280 TraceCheckUtils]: 37: Hoare triple {9169#(= 2 main_~this_state~0)} assume !(2 == ~q~0); {9169#(= 2 main_~this_state~0)} is VALID [2020-07-10 20:17:01,498 INFO L280 TraceCheckUtils]: 38: Hoare triple {9169#(= 2 main_~this_state~0)} assume 3 == ~q~0; {9169#(= 2 main_~this_state~0)} is VALID [2020-07-10 20:17:01,498 INFO L280 TraceCheckUtils]: 39: Hoare triple {9169#(= 2 main_~this_state~0)} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {9169#(= 2 main_~this_state~0)} is VALID [2020-07-10 20:17:01,499 INFO L280 TraceCheckUtils]: 40: Hoare triple {9169#(= 2 main_~this_state~0)} assume !(0 != #t~nondet9); {9169#(= 2 main_~this_state~0)} is VALID [2020-07-10 20:17:01,499 INFO L280 TraceCheckUtils]: 41: Hoare triple {9169#(= 2 main_~this_state~0)} havoc #t~nondet9; {9169#(= 2 main_~this_state~0)} is VALID [2020-07-10 20:17:01,500 INFO L280 TraceCheckUtils]: 42: Hoare triple {9169#(= 2 main_~this_state~0)} assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; {9169#(= 2 main_~this_state~0)} is VALID [2020-07-10 20:17:01,507 INFO L280 TraceCheckUtils]: 43: Hoare triple {9169#(= 2 main_~this_state~0)} assume !(0 != #t~nondet10); {9169#(= 2 main_~this_state~0)} is VALID [2020-07-10 20:17:01,507 INFO L280 TraceCheckUtils]: 44: Hoare triple {9169#(= 2 main_~this_state~0)} havoc #t~nondet10; {9169#(= 2 main_~this_state~0)} is VALID [2020-07-10 20:17:01,508 INFO L280 TraceCheckUtils]: 45: Hoare triple {9169#(= 2 main_~this_state~0)} assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; {9169#(= 2 main_~this_state~0)} is VALID [2020-07-10 20:17:01,509 INFO L280 TraceCheckUtils]: 46: Hoare triple {9169#(= 2 main_~this_state~0)} assume 0 != #t~nondet11; {9169#(= 2 main_~this_state~0)} is VALID [2020-07-10 20:17:01,511 INFO L280 TraceCheckUtils]: 47: Hoare triple {9169#(= 2 main_~this_state~0)} havoc #t~nondet11; {9169#(= 2 main_~this_state~0)} is VALID [2020-07-10 20:17:01,511 INFO L280 TraceCheckUtils]: 48: Hoare triple {9169#(= 2 main_~this_state~0)} ~method_id~0 := 4; {9169#(= 2 main_~this_state~0)} is VALID [2020-07-10 20:17:01,512 INFO L280 TraceCheckUtils]: 49: Hoare triple {9169#(= 2 main_~this_state~0)} assume 2 != ~this_state~0; {9160#false} is VALID [2020-07-10 20:17:01,512 INFO L280 TraceCheckUtils]: 50: Hoare triple {9160#false} assume !false; {9160#false} is VALID [2020-07-10 20:17:01,515 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 20:17:01,515 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:17:01,516 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1885844715] [2020-07-10 20:17:01,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:17:01,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 20:17:01,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567484851] [2020-07-10 20:17:01,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2020-07-10 20:17:01,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:17:01,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 20:17:01,565 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:17:01,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 20:17:01,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:17:01,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 20:17:01,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 20:17:01,567 INFO L87 Difference]: Start difference. First operand 158 states and 184 transitions. Second operand 4 states. [2020-07-10 20:17:03,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:17:03,515 INFO L93 Difference]: Finished difference Result 356 states and 426 transitions. [2020-07-10 20:17:03,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 20:17:03,515 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2020-07-10 20:17:03,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:17:03,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 20:17:03,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 421 transitions. [2020-07-10 20:17:03,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 20:17:03,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 421 transitions. [2020-07-10 20:17:03,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 421 transitions. [2020-07-10 20:17:04,047 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 421 edges. 421 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:17:04,054 INFO L225 Difference]: With dead ends: 356 [2020-07-10 20:17:04,055 INFO L226 Difference]: Without dead ends: 248 [2020-07-10 20:17:04,055 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:17:04,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2020-07-10 20:17:04,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 223. [2020-07-10 20:17:04,929 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:17:04,929 INFO L82 GeneralOperation]: Start isEquivalent. First operand 248 states. Second operand 223 states. [2020-07-10 20:17:04,929 INFO L74 IsIncluded]: Start isIncluded. First operand 248 states. Second operand 223 states. [2020-07-10 20:17:04,930 INFO L87 Difference]: Start difference. First operand 248 states. Second operand 223 states. [2020-07-10 20:17:04,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:17:04,936 INFO L93 Difference]: Finished difference Result 248 states and 286 transitions. [2020-07-10 20:17:04,936 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 286 transitions. [2020-07-10 20:17:04,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:17:04,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:17:04,937 INFO L74 IsIncluded]: Start isIncluded. First operand 223 states. Second operand 248 states. [2020-07-10 20:17:04,937 INFO L87 Difference]: Start difference. First operand 223 states. Second operand 248 states. [2020-07-10 20:17:04,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:17:04,943 INFO L93 Difference]: Finished difference Result 248 states and 286 transitions. [2020-07-10 20:17:04,944 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 286 transitions. [2020-07-10 20:17:04,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:17:04,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:17:04,945 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:17:04,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:17:04,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2020-07-10 20:17:04,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 262 transitions. [2020-07-10 20:17:04,950 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 262 transitions. Word has length 51 [2020-07-10 20:17:04,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:17:04,951 INFO L479 AbstractCegarLoop]: Abstraction has 223 states and 262 transitions. [2020-07-10 20:17:04,951 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 20:17:04,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 223 states and 262 transitions. [2020-07-10 20:17:05,355 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 262 edges. 262 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:17:05,356 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 262 transitions. [2020-07-10 20:17:05,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-10 20:17:05,357 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:17:05,357 INFO L422 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:17:05,357 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 20:17:05,357 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:17:05,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:17:05,358 INFO L82 PathProgramCache]: Analyzing trace with hash -389028907, now seen corresponding path program 1 times [2020-07-10 20:17:05,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:17:05,358 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [32088919] [2020-07-10 20:17:05,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:17:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:17:05,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:17:05,461 INFO L280 TraceCheckUtils]: 0: Hoare triple {10841#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {10830#true} is VALID [2020-07-10 20:17:05,461 INFO L280 TraceCheckUtils]: 1: Hoare triple {10830#true} ~m_initVerify~0 := 2; {10830#true} is VALID [2020-07-10 20:17:05,462 INFO L280 TraceCheckUtils]: 2: Hoare triple {10830#true} ~m_Signature~0 := 3; {10830#true} is VALID [2020-07-10 20:17:05,462 INFO L280 TraceCheckUtils]: 3: Hoare triple {10830#true} ~m_sign~0 := 4; {10830#true} is VALID [2020-07-10 20:17:05,462 INFO L280 TraceCheckUtils]: 4: Hoare triple {10830#true} ~m_verify~0 := 5; {10830#true} is VALID [2020-07-10 20:17:05,462 INFO L280 TraceCheckUtils]: 5: Hoare triple {10830#true} ~m_update~0 := 6; {10830#true} is VALID [2020-07-10 20:17:05,463 INFO L280 TraceCheckUtils]: 6: Hoare triple {10830#true} assume true; {10830#true} is VALID [2020-07-10 20:17:05,463 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {10830#true} {10830#true} #484#return; {10830#true} is VALID [2020-07-10 20:17:05,464 INFO L263 TraceCheckUtils]: 0: Hoare triple {10830#true} call ULTIMATE.init(); {10841#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID [2020-07-10 20:17:05,464 INFO L280 TraceCheckUtils]: 1: Hoare triple {10841#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {10830#true} is VALID [2020-07-10 20:17:05,465 INFO L280 TraceCheckUtils]: 2: Hoare triple {10830#true} ~m_initVerify~0 := 2; {10830#true} is VALID [2020-07-10 20:17:05,465 INFO L280 TraceCheckUtils]: 3: Hoare triple {10830#true} ~m_Signature~0 := 3; {10830#true} is VALID [2020-07-10 20:17:05,465 INFO L280 TraceCheckUtils]: 4: Hoare triple {10830#true} ~m_sign~0 := 4; {10830#true} is VALID [2020-07-10 20:17:05,465 INFO L280 TraceCheckUtils]: 5: Hoare triple {10830#true} ~m_verify~0 := 5; {10830#true} is VALID [2020-07-10 20:17:05,465 INFO L280 TraceCheckUtils]: 6: Hoare triple {10830#true} ~m_update~0 := 6; {10830#true} is VALID [2020-07-10 20:17:05,466 INFO L280 TraceCheckUtils]: 7: Hoare triple {10830#true} assume true; {10830#true} is VALID [2020-07-10 20:17:05,466 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {10830#true} {10830#true} #484#return; {10830#true} is VALID [2020-07-10 20:17:05,466 INFO L263 TraceCheckUtils]: 9: Hoare triple {10830#true} call #t~ret21 := main(); {10830#true} is VALID [2020-07-10 20:17:05,466 INFO L280 TraceCheckUtils]: 10: Hoare triple {10830#true} ~q~0 := 0; {10830#true} is VALID [2020-07-10 20:17:05,467 INFO L280 TraceCheckUtils]: 11: Hoare triple {10830#true} havoc ~method_id~0; {10830#true} is VALID [2020-07-10 20:17:05,467 INFO L280 TraceCheckUtils]: 12: Hoare triple {10830#true} ~this_state~0 := 0; {10830#true} is VALID [2020-07-10 20:17:05,467 INFO L280 TraceCheckUtils]: 13: Hoare triple {10830#true} goto; {10830#true} is VALID [2020-07-10 20:17:05,467 INFO L280 TraceCheckUtils]: 14: Hoare triple {10830#true} assume !false; {10830#true} is VALID [2020-07-10 20:17:05,467 INFO L280 TraceCheckUtils]: 15: Hoare triple {10830#true} assume 0 == ~q~0; {10830#true} is VALID [2020-07-10 20:17:05,468 INFO L280 TraceCheckUtils]: 16: Hoare triple {10830#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {10830#true} is VALID [2020-07-10 20:17:05,468 INFO L280 TraceCheckUtils]: 17: Hoare triple {10830#true} assume 0 != #t~nondet0; {10830#true} is VALID [2020-07-10 20:17:05,468 INFO L280 TraceCheckUtils]: 18: Hoare triple {10830#true} havoc #t~nondet0; {10830#true} is VALID [2020-07-10 20:17:05,468 INFO L280 TraceCheckUtils]: 19: Hoare triple {10830#true} ~method_id~0 := 3; {10830#true} is VALID [2020-07-10 20:17:05,469 INFO L280 TraceCheckUtils]: 20: Hoare triple {10830#true} assume !false; {10830#true} is VALID [2020-07-10 20:17:05,469 INFO L280 TraceCheckUtils]: 21: Hoare triple {10830#true} ~q~0 := 2; {10830#true} is VALID [2020-07-10 20:17:05,469 INFO L280 TraceCheckUtils]: 22: Hoare triple {10830#true} ~this_state~0 := 0; {10830#true} is VALID [2020-07-10 20:17:05,469 INFO L280 TraceCheckUtils]: 23: Hoare triple {10830#true} assume !false; {10830#true} is VALID [2020-07-10 20:17:05,469 INFO L280 TraceCheckUtils]: 24: Hoare triple {10830#true} assume !(0 == ~q~0); {10830#true} is VALID [2020-07-10 20:17:05,470 INFO L280 TraceCheckUtils]: 25: Hoare triple {10830#true} assume !(1 == ~q~0); {10830#true} is VALID [2020-07-10 20:17:05,470 INFO L280 TraceCheckUtils]: 26: Hoare triple {10830#true} assume 2 == ~q~0; {10830#true} is VALID [2020-07-10 20:17:05,470 INFO L280 TraceCheckUtils]: 27: Hoare triple {10830#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {10830#true} is VALID [2020-07-10 20:17:05,470 INFO L280 TraceCheckUtils]: 28: Hoare triple {10830#true} assume 0 != #t~nondet4; {10830#true} is VALID [2020-07-10 20:17:05,470 INFO L280 TraceCheckUtils]: 29: Hoare triple {10830#true} havoc #t~nondet4; {10830#true} is VALID [2020-07-10 20:17:05,471 INFO L280 TraceCheckUtils]: 30: Hoare triple {10830#true} ~method_id~0 := 1; {10830#true} is VALID [2020-07-10 20:17:05,471 INFO L280 TraceCheckUtils]: 31: Hoare triple {10830#true} assume !false; {10830#true} is VALID [2020-07-10 20:17:05,472 INFO L280 TraceCheckUtils]: 32: Hoare triple {10830#true} ~q~0 := 3; {10840#(= 3 main_~q~0)} is VALID [2020-07-10 20:17:05,472 INFO L280 TraceCheckUtils]: 33: Hoare triple {10840#(= 3 main_~q~0)} ~this_state~0 := 2; {10840#(= 3 main_~q~0)} is VALID [2020-07-10 20:17:05,473 INFO L280 TraceCheckUtils]: 34: Hoare triple {10840#(= 3 main_~q~0)} assume !false; {10840#(= 3 main_~q~0)} is VALID [2020-07-10 20:17:05,473 INFO L280 TraceCheckUtils]: 35: Hoare triple {10840#(= 3 main_~q~0)} assume !(0 == ~q~0); {10840#(= 3 main_~q~0)} is VALID [2020-07-10 20:17:05,474 INFO L280 TraceCheckUtils]: 36: Hoare triple {10840#(= 3 main_~q~0)} assume !(1 == ~q~0); {10840#(= 3 main_~q~0)} is VALID [2020-07-10 20:17:05,474 INFO L280 TraceCheckUtils]: 37: Hoare triple {10840#(= 3 main_~q~0)} assume !(2 == ~q~0); {10840#(= 3 main_~q~0)} is VALID [2020-07-10 20:17:05,475 INFO L280 TraceCheckUtils]: 38: Hoare triple {10840#(= 3 main_~q~0)} assume !(3 == ~q~0); {10831#false} is VALID [2020-07-10 20:17:05,475 INFO L280 TraceCheckUtils]: 39: Hoare triple {10831#false} assume 4 == ~q~0; {10831#false} is VALID [2020-07-10 20:17:05,476 INFO L280 TraceCheckUtils]: 40: Hoare triple {10831#false} assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647; {10831#false} is VALID [2020-07-10 20:17:05,476 INFO L280 TraceCheckUtils]: 41: Hoare triple {10831#false} assume !(0 != #t~nondet15); {10831#false} is VALID [2020-07-10 20:17:05,476 INFO L280 TraceCheckUtils]: 42: Hoare triple {10831#false} havoc #t~nondet15; {10831#false} is VALID [2020-07-10 20:17:05,476 INFO L280 TraceCheckUtils]: 43: Hoare triple {10831#false} assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; {10831#false} is VALID [2020-07-10 20:17:05,477 INFO L280 TraceCheckUtils]: 44: Hoare triple {10831#false} assume !(0 != #t~nondet16); {10831#false} is VALID [2020-07-10 20:17:05,477 INFO L280 TraceCheckUtils]: 45: Hoare triple {10831#false} havoc #t~nondet16; {10831#false} is VALID [2020-07-10 20:17:05,477 INFO L280 TraceCheckUtils]: 46: Hoare triple {10831#false} assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647; {10831#false} is VALID [2020-07-10 20:17:05,477 INFO L280 TraceCheckUtils]: 47: Hoare triple {10831#false} assume 0 != #t~nondet17; {10831#false} is VALID [2020-07-10 20:17:05,477 INFO L280 TraceCheckUtils]: 48: Hoare triple {10831#false} havoc #t~nondet17; {10831#false} is VALID [2020-07-10 20:17:05,478 INFO L280 TraceCheckUtils]: 49: Hoare triple {10831#false} ~method_id~0 := 4; {10831#false} is VALID [2020-07-10 20:17:05,478 INFO L280 TraceCheckUtils]: 50: Hoare triple {10831#false} assume 2 == ~this_state~0; {10831#false} is VALID [2020-07-10 20:17:05,478 INFO L280 TraceCheckUtils]: 51: Hoare triple {10831#false} assume !false; {10831#false} is VALID [2020-07-10 20:17:05,480 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 20:17:05,480 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:17:05,481 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [32088919] [2020-07-10 20:17:05,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:17:05,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 20:17:05,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742712478] [2020-07-10 20:17:05,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2020-07-10 20:17:05,482 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:17:05,482 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 20:17:05,526 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:17:05,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 20:17:05,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:17:05,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 20:17:05,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 20:17:05,528 INFO L87 Difference]: Start difference. First operand 223 states and 262 transitions. Second operand 4 states. [2020-07-10 20:17:06,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:17:06,999 INFO L93 Difference]: Finished difference Result 369 states and 437 transitions. [2020-07-10 20:17:06,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 20:17:07,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2020-07-10 20:17:07,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:17:07,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 20:17:07,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 314 transitions. [2020-07-10 20:17:07,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 20:17:07,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 314 transitions. [2020-07-10 20:17:07,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 314 transitions. [2020-07-10 20:17:07,362 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 314 edges. 314 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:17:07,368 INFO L225 Difference]: With dead ends: 369 [2020-07-10 20:17:07,369 INFO L226 Difference]: Without dead ends: 199 [2020-07-10 20:17:07,370 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:17:07,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2020-07-10 20:17:08,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 197. [2020-07-10 20:17:08,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:17:08,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 199 states. Second operand 197 states. [2020-07-10 20:17:08,170 INFO L74 IsIncluded]: Start isIncluded. First operand 199 states. Second operand 197 states. [2020-07-10 20:17:08,170 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 197 states. [2020-07-10 20:17:08,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:17:08,175 INFO L93 Difference]: Finished difference Result 199 states and 229 transitions. [2020-07-10 20:17:08,175 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 229 transitions. [2020-07-10 20:17:08,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:17:08,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:17:08,176 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand 199 states. [2020-07-10 20:17:08,176 INFO L87 Difference]: Start difference. First operand 197 states. Second operand 199 states. [2020-07-10 20:17:08,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:17:08,181 INFO L93 Difference]: Finished difference Result 199 states and 229 transitions. [2020-07-10 20:17:08,181 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 229 transitions. [2020-07-10 20:17:08,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:17:08,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:17:08,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:17:08,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:17:08,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2020-07-10 20:17:08,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 228 transitions. [2020-07-10 20:17:08,188 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 228 transitions. Word has length 52 [2020-07-10 20:17:08,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:17:08,188 INFO L479 AbstractCegarLoop]: Abstraction has 197 states and 228 transitions. [2020-07-10 20:17:08,188 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 20:17:08,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 197 states and 228 transitions. [2020-07-10 20:17:08,559 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:17:08,559 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 228 transitions. [2020-07-10 20:17:08,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-10 20:17:08,560 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:17:08,561 INFO L422 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:17:08,561 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-10 20:17:08,562 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:17:08,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:17:08,562 INFO L82 PathProgramCache]: Analyzing trace with hash 910217494, now seen corresponding path program 1 times [2020-07-10 20:17:08,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:17:08,563 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [199545801] [2020-07-10 20:17:08,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:17:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:17:08,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:17:08,666 INFO L280 TraceCheckUtils]: 0: Hoare triple {12388#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {12377#true} is VALID [2020-07-10 20:17:08,666 INFO L280 TraceCheckUtils]: 1: Hoare triple {12377#true} ~m_initVerify~0 := 2; {12377#true} is VALID [2020-07-10 20:17:08,667 INFO L280 TraceCheckUtils]: 2: Hoare triple {12377#true} ~m_Signature~0 := 3; {12377#true} is VALID [2020-07-10 20:17:08,667 INFO L280 TraceCheckUtils]: 3: Hoare triple {12377#true} ~m_sign~0 := 4; {12377#true} is VALID [2020-07-10 20:17:08,667 INFO L280 TraceCheckUtils]: 4: Hoare triple {12377#true} ~m_verify~0 := 5; {12377#true} is VALID [2020-07-10 20:17:08,667 INFO L280 TraceCheckUtils]: 5: Hoare triple {12377#true} ~m_update~0 := 6; {12377#true} is VALID [2020-07-10 20:17:08,668 INFO L280 TraceCheckUtils]: 6: Hoare triple {12377#true} assume true; {12377#true} is VALID [2020-07-10 20:17:08,668 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {12377#true} {12377#true} #484#return; {12377#true} is VALID [2020-07-10 20:17:08,671 INFO L263 TraceCheckUtils]: 0: Hoare triple {12377#true} call ULTIMATE.init(); {12388#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID [2020-07-10 20:17:08,671 INFO L280 TraceCheckUtils]: 1: Hoare triple {12388#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {12377#true} is VALID [2020-07-10 20:17:08,672 INFO L280 TraceCheckUtils]: 2: Hoare triple {12377#true} ~m_initVerify~0 := 2; {12377#true} is VALID [2020-07-10 20:17:08,672 INFO L280 TraceCheckUtils]: 3: Hoare triple {12377#true} ~m_Signature~0 := 3; {12377#true} is VALID [2020-07-10 20:17:08,674 INFO L280 TraceCheckUtils]: 4: Hoare triple {12377#true} ~m_sign~0 := 4; {12377#true} is VALID [2020-07-10 20:17:08,675 INFO L280 TraceCheckUtils]: 5: Hoare triple {12377#true} ~m_verify~0 := 5; {12377#true} is VALID [2020-07-10 20:17:08,675 INFO L280 TraceCheckUtils]: 6: Hoare triple {12377#true} ~m_update~0 := 6; {12377#true} is VALID [2020-07-10 20:17:08,675 INFO L280 TraceCheckUtils]: 7: Hoare triple {12377#true} assume true; {12377#true} is VALID [2020-07-10 20:17:08,675 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {12377#true} {12377#true} #484#return; {12377#true} is VALID [2020-07-10 20:17:08,676 INFO L263 TraceCheckUtils]: 9: Hoare triple {12377#true} call #t~ret21 := main(); {12377#true} is VALID [2020-07-10 20:17:08,676 INFO L280 TraceCheckUtils]: 10: Hoare triple {12377#true} ~q~0 := 0; {12377#true} is VALID [2020-07-10 20:17:08,676 INFO L280 TraceCheckUtils]: 11: Hoare triple {12377#true} havoc ~method_id~0; {12377#true} is VALID [2020-07-10 20:17:08,676 INFO L280 TraceCheckUtils]: 12: Hoare triple {12377#true} ~this_state~0 := 0; {12377#true} is VALID [2020-07-10 20:17:08,677 INFO L280 TraceCheckUtils]: 13: Hoare triple {12377#true} goto; {12377#true} is VALID [2020-07-10 20:17:08,677 INFO L280 TraceCheckUtils]: 14: Hoare triple {12377#true} assume !false; {12377#true} is VALID [2020-07-10 20:17:08,680 INFO L280 TraceCheckUtils]: 15: Hoare triple {12377#true} assume 0 == ~q~0; {12377#true} is VALID [2020-07-10 20:17:08,680 INFO L280 TraceCheckUtils]: 16: Hoare triple {12377#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {12377#true} is VALID [2020-07-10 20:17:08,681 INFO L280 TraceCheckUtils]: 17: Hoare triple {12377#true} assume 0 != #t~nondet0; {12377#true} is VALID [2020-07-10 20:17:08,681 INFO L280 TraceCheckUtils]: 18: Hoare triple {12377#true} havoc #t~nondet0; {12377#true} is VALID [2020-07-10 20:17:08,681 INFO L280 TraceCheckUtils]: 19: Hoare triple {12377#true} ~method_id~0 := 3; {12377#true} is VALID [2020-07-10 20:17:08,681 INFO L280 TraceCheckUtils]: 20: Hoare triple {12377#true} assume !false; {12377#true} is VALID [2020-07-10 20:17:08,682 INFO L280 TraceCheckUtils]: 21: Hoare triple {12377#true} ~q~0 := 2; {12377#true} is VALID [2020-07-10 20:17:08,682 INFO L280 TraceCheckUtils]: 22: Hoare triple {12377#true} ~this_state~0 := 0; {12377#true} is VALID [2020-07-10 20:17:08,682 INFO L280 TraceCheckUtils]: 23: Hoare triple {12377#true} assume !false; {12377#true} is VALID [2020-07-10 20:17:08,682 INFO L280 TraceCheckUtils]: 24: Hoare triple {12377#true} assume !(0 == ~q~0); {12377#true} is VALID [2020-07-10 20:17:08,683 INFO L280 TraceCheckUtils]: 25: Hoare triple {12377#true} assume !(1 == ~q~0); {12377#true} is VALID [2020-07-10 20:17:08,683 INFO L280 TraceCheckUtils]: 26: Hoare triple {12377#true} assume 2 == ~q~0; {12377#true} is VALID [2020-07-10 20:17:08,683 INFO L280 TraceCheckUtils]: 27: Hoare triple {12377#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {12377#true} is VALID [2020-07-10 20:17:08,683 INFO L280 TraceCheckUtils]: 28: Hoare triple {12377#true} assume !(0 != #t~nondet4); {12377#true} is VALID [2020-07-10 20:17:08,684 INFO L280 TraceCheckUtils]: 29: Hoare triple {12377#true} havoc #t~nondet4; {12377#true} is VALID [2020-07-10 20:17:08,684 INFO L280 TraceCheckUtils]: 30: Hoare triple {12377#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {12377#true} is VALID [2020-07-10 20:17:08,684 INFO L280 TraceCheckUtils]: 31: Hoare triple {12377#true} assume 0 != #t~nondet5; {12377#true} is VALID [2020-07-10 20:17:08,684 INFO L280 TraceCheckUtils]: 32: Hoare triple {12377#true} havoc #t~nondet5; {12377#true} is VALID [2020-07-10 20:17:08,684 INFO L280 TraceCheckUtils]: 33: Hoare triple {12377#true} ~method_id~0 := 2; {12377#true} is VALID [2020-07-10 20:17:08,685 INFO L280 TraceCheckUtils]: 34: Hoare triple {12377#true} assume !false; {12377#true} is VALID [2020-07-10 20:17:08,694 INFO L280 TraceCheckUtils]: 35: Hoare triple {12377#true} ~q~0 := 4; {12387#(<= 4 main_~q~0)} is VALID [2020-07-10 20:17:08,698 INFO L280 TraceCheckUtils]: 36: Hoare triple {12387#(<= 4 main_~q~0)} ~this_state~0 := 3; {12387#(<= 4 main_~q~0)} is VALID [2020-07-10 20:17:08,700 INFO L280 TraceCheckUtils]: 37: Hoare triple {12387#(<= 4 main_~q~0)} assume !false; {12387#(<= 4 main_~q~0)} is VALID [2020-07-10 20:17:08,700 INFO L280 TraceCheckUtils]: 38: Hoare triple {12387#(<= 4 main_~q~0)} assume !(0 == ~q~0); {12387#(<= 4 main_~q~0)} is VALID [2020-07-10 20:17:08,701 INFO L280 TraceCheckUtils]: 39: Hoare triple {12387#(<= 4 main_~q~0)} assume !(1 == ~q~0); {12387#(<= 4 main_~q~0)} is VALID [2020-07-10 20:17:08,702 INFO L280 TraceCheckUtils]: 40: Hoare triple {12387#(<= 4 main_~q~0)} assume !(2 == ~q~0); {12387#(<= 4 main_~q~0)} is VALID [2020-07-10 20:17:08,702 INFO L280 TraceCheckUtils]: 41: Hoare triple {12387#(<= 4 main_~q~0)} assume 3 == ~q~0; {12378#false} is VALID [2020-07-10 20:17:08,703 INFO L280 TraceCheckUtils]: 42: Hoare triple {12378#false} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {12378#false} is VALID [2020-07-10 20:17:08,703 INFO L280 TraceCheckUtils]: 43: Hoare triple {12378#false} assume !(0 != #t~nondet9); {12378#false} is VALID [2020-07-10 20:17:08,703 INFO L280 TraceCheckUtils]: 44: Hoare triple {12378#false} havoc #t~nondet9; {12378#false} is VALID [2020-07-10 20:17:08,703 INFO L280 TraceCheckUtils]: 45: Hoare triple {12378#false} assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; {12378#false} is VALID [2020-07-10 20:17:08,704 INFO L280 TraceCheckUtils]: 46: Hoare triple {12378#false} assume !(0 != #t~nondet10); {12378#false} is VALID [2020-07-10 20:17:08,704 INFO L280 TraceCheckUtils]: 47: Hoare triple {12378#false} havoc #t~nondet10; {12378#false} is VALID [2020-07-10 20:17:08,704 INFO L280 TraceCheckUtils]: 48: Hoare triple {12378#false} assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; {12378#false} is VALID [2020-07-10 20:17:08,704 INFO L280 TraceCheckUtils]: 49: Hoare triple {12378#false} assume 0 != #t~nondet11; {12378#false} is VALID [2020-07-10 20:17:08,705 INFO L280 TraceCheckUtils]: 50: Hoare triple {12378#false} havoc #t~nondet11; {12378#false} is VALID [2020-07-10 20:17:08,705 INFO L280 TraceCheckUtils]: 51: Hoare triple {12378#false} ~method_id~0 := 4; {12378#false} is VALID [2020-07-10 20:17:08,705 INFO L280 TraceCheckUtils]: 52: Hoare triple {12378#false} assume 2 != ~this_state~0; {12378#false} is VALID [2020-07-10 20:17:08,707 INFO L280 TraceCheckUtils]: 53: Hoare triple {12378#false} assume !false; {12378#false} is VALID [2020-07-10 20:17:08,710 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 20:17:08,711 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:17:08,711 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [199545801] [2020-07-10 20:17:08,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:17:08,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 20:17:08,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23371265] [2020-07-10 20:17:08,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2020-07-10 20:17:08,713 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:17:08,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 20:17:08,758 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:17:08,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 20:17:08,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:17:08,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 20:17:08,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 20:17:08,759 INFO L87 Difference]: Start difference. First operand 197 states and 228 transitions. Second operand 4 states. [2020-07-10 20:17:10,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:17:10,123 INFO L93 Difference]: Finished difference Result 300 states and 348 transitions. [2020-07-10 20:17:10,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 20:17:10,123 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2020-07-10 20:17:10,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:17:10,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 20:17:10,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 300 transitions. [2020-07-10 20:17:10,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 20:17:10,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 300 transitions. [2020-07-10 20:17:10,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 300 transitions. [2020-07-10 20:17:10,481 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 300 edges. 300 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:17:10,483 INFO L225 Difference]: With dead ends: 300 [2020-07-10 20:17:10,484 INFO L226 Difference]: Without dead ends: 156 [2020-07-10 20:17:10,485 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:17:10,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2020-07-10 20:17:11,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2020-07-10 20:17:11,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:17:11,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand 156 states. [2020-07-10 20:17:11,206 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 156 states. [2020-07-10 20:17:11,206 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 156 states. [2020-07-10 20:17:11,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:17:11,216 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2020-07-10 20:17:11,216 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions. [2020-07-10 20:17:11,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:17:11,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:17:11,219 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 156 states. [2020-07-10 20:17:11,219 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 156 states. [2020-07-10 20:17:11,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:17:11,223 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2020-07-10 20:17:11,223 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions. [2020-07-10 20:17:11,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:17:11,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:17:11,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:17:11,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:17:11,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-07-10 20:17:11,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 175 transitions. [2020-07-10 20:17:11,228 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 175 transitions. Word has length 54 [2020-07-10 20:17:11,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:17:11,229 INFO L479 AbstractCegarLoop]: Abstraction has 156 states and 175 transitions. [2020-07-10 20:17:11,229 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 20:17:11,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 156 states and 175 transitions. [2020-07-10 20:17:11,524 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:17:11,524 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions. [2020-07-10 20:17:11,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-10 20:17:11,525 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:17:11,525 INFO L422 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:17:11,526 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-10 20:17:11,526 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:17:11,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:17:11,526 INFO L82 PathProgramCache]: Analyzing trace with hash 57784286, now seen corresponding path program 1 times [2020-07-10 20:17:11,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:17:11,527 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [140580746] [2020-07-10 20:17:11,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:17:11,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:17:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:17:11,624 INFO L280 TraceCheckUtils]: 0: Hoare triple {13629#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {13618#true} is VALID [2020-07-10 20:17:11,624 INFO L280 TraceCheckUtils]: 1: Hoare triple {13618#true} ~m_initVerify~0 := 2; {13618#true} is VALID [2020-07-10 20:17:11,624 INFO L280 TraceCheckUtils]: 2: Hoare triple {13618#true} ~m_Signature~0 := 3; {13618#true} is VALID [2020-07-10 20:17:11,625 INFO L280 TraceCheckUtils]: 3: Hoare triple {13618#true} ~m_sign~0 := 4; {13618#true} is VALID [2020-07-10 20:17:11,625 INFO L280 TraceCheckUtils]: 4: Hoare triple {13618#true} ~m_verify~0 := 5; {13618#true} is VALID [2020-07-10 20:17:11,625 INFO L280 TraceCheckUtils]: 5: Hoare triple {13618#true} ~m_update~0 := 6; {13618#true} is VALID [2020-07-10 20:17:11,625 INFO L280 TraceCheckUtils]: 6: Hoare triple {13618#true} assume true; {13618#true} is VALID [2020-07-10 20:17:11,626 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {13618#true} {13618#true} #484#return; {13618#true} is VALID [2020-07-10 20:17:11,627 INFO L263 TraceCheckUtils]: 0: Hoare triple {13618#true} call ULTIMATE.init(); {13629#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID [2020-07-10 20:17:11,627 INFO L280 TraceCheckUtils]: 1: Hoare triple {13629#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {13618#true} is VALID [2020-07-10 20:17:11,628 INFO L280 TraceCheckUtils]: 2: Hoare triple {13618#true} ~m_initVerify~0 := 2; {13618#true} is VALID [2020-07-10 20:17:11,628 INFO L280 TraceCheckUtils]: 3: Hoare triple {13618#true} ~m_Signature~0 := 3; {13618#true} is VALID [2020-07-10 20:17:11,628 INFO L280 TraceCheckUtils]: 4: Hoare triple {13618#true} ~m_sign~0 := 4; {13618#true} is VALID [2020-07-10 20:17:11,629 INFO L280 TraceCheckUtils]: 5: Hoare triple {13618#true} ~m_verify~0 := 5; {13618#true} is VALID [2020-07-10 20:17:11,629 INFO L280 TraceCheckUtils]: 6: Hoare triple {13618#true} ~m_update~0 := 6; {13618#true} is VALID [2020-07-10 20:17:11,629 INFO L280 TraceCheckUtils]: 7: Hoare triple {13618#true} assume true; {13618#true} is VALID [2020-07-10 20:17:11,629 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {13618#true} {13618#true} #484#return; {13618#true} is VALID [2020-07-10 20:17:11,630 INFO L263 TraceCheckUtils]: 9: Hoare triple {13618#true} call #t~ret21 := main(); {13618#true} is VALID [2020-07-10 20:17:11,630 INFO L280 TraceCheckUtils]: 10: Hoare triple {13618#true} ~q~0 := 0; {13618#true} is VALID [2020-07-10 20:17:11,630 INFO L280 TraceCheckUtils]: 11: Hoare triple {13618#true} havoc ~method_id~0; {13618#true} is VALID [2020-07-10 20:17:11,630 INFO L280 TraceCheckUtils]: 12: Hoare triple {13618#true} ~this_state~0 := 0; {13618#true} is VALID [2020-07-10 20:17:11,631 INFO L280 TraceCheckUtils]: 13: Hoare triple {13618#true} goto; {13618#true} is VALID [2020-07-10 20:17:11,631 INFO L280 TraceCheckUtils]: 14: Hoare triple {13618#true} assume !false; {13618#true} is VALID [2020-07-10 20:17:11,631 INFO L280 TraceCheckUtils]: 15: Hoare triple {13618#true} assume 0 == ~q~0; {13618#true} is VALID [2020-07-10 20:17:11,631 INFO L280 TraceCheckUtils]: 16: Hoare triple {13618#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {13618#true} is VALID [2020-07-10 20:17:11,631 INFO L280 TraceCheckUtils]: 17: Hoare triple {13618#true} assume 0 != #t~nondet0; {13618#true} is VALID [2020-07-10 20:17:11,632 INFO L280 TraceCheckUtils]: 18: Hoare triple {13618#true} havoc #t~nondet0; {13618#true} is VALID [2020-07-10 20:17:11,632 INFO L280 TraceCheckUtils]: 19: Hoare triple {13618#true} ~method_id~0 := 3; {13618#true} is VALID [2020-07-10 20:17:11,632 INFO L280 TraceCheckUtils]: 20: Hoare triple {13618#true} assume !false; {13618#true} is VALID [2020-07-10 20:17:11,632 INFO L280 TraceCheckUtils]: 21: Hoare triple {13618#true} ~q~0 := 2; {13618#true} is VALID [2020-07-10 20:17:11,633 INFO L280 TraceCheckUtils]: 22: Hoare triple {13618#true} ~this_state~0 := 0; {13618#true} is VALID [2020-07-10 20:17:11,633 INFO L280 TraceCheckUtils]: 23: Hoare triple {13618#true} assume !false; {13618#true} is VALID [2020-07-10 20:17:11,633 INFO L280 TraceCheckUtils]: 24: Hoare triple {13618#true} assume !(0 == ~q~0); {13618#true} is VALID [2020-07-10 20:17:11,633 INFO L280 TraceCheckUtils]: 25: Hoare triple {13618#true} assume !(1 == ~q~0); {13618#true} is VALID [2020-07-10 20:17:11,634 INFO L280 TraceCheckUtils]: 26: Hoare triple {13618#true} assume 2 == ~q~0; {13618#true} is VALID [2020-07-10 20:17:11,634 INFO L280 TraceCheckUtils]: 27: Hoare triple {13618#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {13618#true} is VALID [2020-07-10 20:17:11,634 INFO L280 TraceCheckUtils]: 28: Hoare triple {13618#true} assume !(0 != #t~nondet4); {13618#true} is VALID [2020-07-10 20:17:11,634 INFO L280 TraceCheckUtils]: 29: Hoare triple {13618#true} havoc #t~nondet4; {13618#true} is VALID [2020-07-10 20:17:11,635 INFO L280 TraceCheckUtils]: 30: Hoare triple {13618#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {13618#true} is VALID [2020-07-10 20:17:11,635 INFO L280 TraceCheckUtils]: 31: Hoare triple {13618#true} assume 0 != #t~nondet5; {13618#true} is VALID [2020-07-10 20:17:11,635 INFO L280 TraceCheckUtils]: 32: Hoare triple {13618#true} havoc #t~nondet5; {13618#true} is VALID [2020-07-10 20:17:11,635 INFO L280 TraceCheckUtils]: 33: Hoare triple {13618#true} ~method_id~0 := 2; {13618#true} is VALID [2020-07-10 20:17:11,636 INFO L280 TraceCheckUtils]: 34: Hoare triple {13618#true} assume !false; {13618#true} is VALID [2020-07-10 20:17:11,636 INFO L280 TraceCheckUtils]: 35: Hoare triple {13618#true} ~q~0 := 4; {13618#true} is VALID [2020-07-10 20:17:11,637 INFO L280 TraceCheckUtils]: 36: Hoare triple {13618#true} ~this_state~0 := 3; {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-10 20:17:11,638 INFO L280 TraceCheckUtils]: 37: Hoare triple {13628#(<= 3 main_~this_state~0)} assume !false; {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-10 20:17:11,638 INFO L280 TraceCheckUtils]: 38: Hoare triple {13628#(<= 3 main_~this_state~0)} assume !(0 == ~q~0); {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-10 20:17:11,639 INFO L280 TraceCheckUtils]: 39: Hoare triple {13628#(<= 3 main_~this_state~0)} assume !(1 == ~q~0); {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-10 20:17:11,640 INFO L280 TraceCheckUtils]: 40: Hoare triple {13628#(<= 3 main_~this_state~0)} assume !(2 == ~q~0); {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-10 20:17:11,640 INFO L280 TraceCheckUtils]: 41: Hoare triple {13628#(<= 3 main_~this_state~0)} assume !(3 == ~q~0); {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-10 20:17:11,641 INFO L280 TraceCheckUtils]: 42: Hoare triple {13628#(<= 3 main_~this_state~0)} assume 4 == ~q~0; {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-10 20:17:11,641 INFO L280 TraceCheckUtils]: 43: Hoare triple {13628#(<= 3 main_~this_state~0)} assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647; {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-10 20:17:11,642 INFO L280 TraceCheckUtils]: 44: Hoare triple {13628#(<= 3 main_~this_state~0)} assume !(0 != #t~nondet15); {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-10 20:17:11,642 INFO L280 TraceCheckUtils]: 45: Hoare triple {13628#(<= 3 main_~this_state~0)} havoc #t~nondet15; {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-10 20:17:11,643 INFO L280 TraceCheckUtils]: 46: Hoare triple {13628#(<= 3 main_~this_state~0)} assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-10 20:17:11,644 INFO L280 TraceCheckUtils]: 47: Hoare triple {13628#(<= 3 main_~this_state~0)} assume !(0 != #t~nondet16); {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-10 20:17:11,644 INFO L280 TraceCheckUtils]: 48: Hoare triple {13628#(<= 3 main_~this_state~0)} havoc #t~nondet16; {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-10 20:17:11,645 INFO L280 TraceCheckUtils]: 49: Hoare triple {13628#(<= 3 main_~this_state~0)} assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647; {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-10 20:17:11,645 INFO L280 TraceCheckUtils]: 50: Hoare triple {13628#(<= 3 main_~this_state~0)} assume 0 != #t~nondet17; {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-10 20:17:11,646 INFO L280 TraceCheckUtils]: 51: Hoare triple {13628#(<= 3 main_~this_state~0)} havoc #t~nondet17; {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-10 20:17:11,646 INFO L280 TraceCheckUtils]: 52: Hoare triple {13628#(<= 3 main_~this_state~0)} ~method_id~0 := 4; {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-10 20:17:11,647 INFO L280 TraceCheckUtils]: 53: Hoare triple {13628#(<= 3 main_~this_state~0)} assume 2 == ~this_state~0; {13619#false} is VALID [2020-07-10 20:17:11,647 INFO L280 TraceCheckUtils]: 54: Hoare triple {13619#false} assume !false; {13619#false} is VALID [2020-07-10 20:17:11,650 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 20:17:11,650 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:17:11,650 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [140580746] [2020-07-10 20:17:11,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:17:11,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 20:17:11,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861092361] [2020-07-10 20:17:11,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2020-07-10 20:17:11,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:17:11,652 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 20:17:11,707 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:17:11,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 20:17:11,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:17:11,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 20:17:11,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 20:17:11,708 INFO L87 Difference]: Start difference. First operand 156 states and 175 transitions. Second operand 4 states. [2020-07-10 20:17:12,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:17:12,972 INFO L93 Difference]: Finished difference Result 158 states and 176 transitions. [2020-07-10 20:17:12,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 20:17:12,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2020-07-10 20:17:12,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:17:12,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 20:17:12,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2020-07-10 20:17:12,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 20:17:12,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2020-07-10 20:17:12,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 172 transitions. [2020-07-10 20:17:13,219 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:17:13,222 INFO L225 Difference]: With dead ends: 158 [2020-07-10 20:17:13,222 INFO L226 Difference]: Without dead ends: 153 [2020-07-10 20:17:13,223 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:17:13,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2020-07-10 20:17:13,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2020-07-10 20:17:13,928 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:17:13,929 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand 153 states. [2020-07-10 20:17:13,929 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 153 states. [2020-07-10 20:17:13,929 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 153 states. [2020-07-10 20:17:13,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:17:13,932 INFO L93 Difference]: Finished difference Result 153 states and 171 transitions. [2020-07-10 20:17:13,932 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 171 transitions. [2020-07-10 20:17:13,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:17:13,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:17:13,932 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 153 states. [2020-07-10 20:17:13,932 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 153 states. [2020-07-10 20:17:13,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:17:13,935 INFO L93 Difference]: Finished difference Result 153 states and 171 transitions. [2020-07-10 20:17:13,935 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 171 transitions. [2020-07-10 20:17:13,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:17:13,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:17:13,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:17:13,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:17:13,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-07-10 20:17:13,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 171 transitions. [2020-07-10 20:17:13,940 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 171 transitions. Word has length 55 [2020-07-10 20:17:13,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:17:13,940 INFO L479 AbstractCegarLoop]: Abstraction has 153 states and 171 transitions. [2020-07-10 20:17:13,940 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 20:17:13,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 153 states and 171 transitions. [2020-07-10 20:17:14,232 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:17:14,232 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 171 transitions. [2020-07-10 20:17:14,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-10 20:17:14,234 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:17:14,234 INFO L422 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:17:14,234 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-10 20:17:14,235 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:17:14,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:17:14,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1987485698, now seen corresponding path program 1 times [2020-07-10 20:17:14,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:17:14,235 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1839966119] [2020-07-10 20:17:14,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:17:14,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:17:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:17:14,311 INFO L280 TraceCheckUtils]: 0: Hoare triple {14574#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {14563#true} is VALID [2020-07-10 20:17:14,312 INFO L280 TraceCheckUtils]: 1: Hoare triple {14563#true} ~m_initVerify~0 := 2; {14563#true} is VALID [2020-07-10 20:17:14,312 INFO L280 TraceCheckUtils]: 2: Hoare triple {14563#true} ~m_Signature~0 := 3; {14563#true} is VALID [2020-07-10 20:17:14,312 INFO L280 TraceCheckUtils]: 3: Hoare triple {14563#true} ~m_sign~0 := 4; {14563#true} is VALID [2020-07-10 20:17:14,312 INFO L280 TraceCheckUtils]: 4: Hoare triple {14563#true} ~m_verify~0 := 5; {14563#true} is VALID [2020-07-10 20:17:14,312 INFO L280 TraceCheckUtils]: 5: Hoare triple {14563#true} ~m_update~0 := 6; {14563#true} is VALID [2020-07-10 20:17:14,313 INFO L280 TraceCheckUtils]: 6: Hoare triple {14563#true} assume true; {14563#true} is VALID [2020-07-10 20:17:14,313 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {14563#true} {14563#true} #484#return; {14563#true} is VALID [2020-07-10 20:17:14,314 INFO L263 TraceCheckUtils]: 0: Hoare triple {14563#true} call ULTIMATE.init(); {14574#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID [2020-07-10 20:17:14,314 INFO L280 TraceCheckUtils]: 1: Hoare triple {14574#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {14563#true} is VALID [2020-07-10 20:17:14,314 INFO L280 TraceCheckUtils]: 2: Hoare triple {14563#true} ~m_initVerify~0 := 2; {14563#true} is VALID [2020-07-10 20:17:14,314 INFO L280 TraceCheckUtils]: 3: Hoare triple {14563#true} ~m_Signature~0 := 3; {14563#true} is VALID [2020-07-10 20:17:14,315 INFO L280 TraceCheckUtils]: 4: Hoare triple {14563#true} ~m_sign~0 := 4; {14563#true} is VALID [2020-07-10 20:17:14,315 INFO L280 TraceCheckUtils]: 5: Hoare triple {14563#true} ~m_verify~0 := 5; {14563#true} is VALID [2020-07-10 20:17:14,315 INFO L280 TraceCheckUtils]: 6: Hoare triple {14563#true} ~m_update~0 := 6; {14563#true} is VALID [2020-07-10 20:17:14,315 INFO L280 TraceCheckUtils]: 7: Hoare triple {14563#true} assume true; {14563#true} is VALID [2020-07-10 20:17:14,316 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {14563#true} {14563#true} #484#return; {14563#true} is VALID [2020-07-10 20:17:14,316 INFO L263 TraceCheckUtils]: 9: Hoare triple {14563#true} call #t~ret21 := main(); {14563#true} is VALID [2020-07-10 20:17:14,316 INFO L280 TraceCheckUtils]: 10: Hoare triple {14563#true} ~q~0 := 0; {14563#true} is VALID [2020-07-10 20:17:14,316 INFO L280 TraceCheckUtils]: 11: Hoare triple {14563#true} havoc ~method_id~0; {14563#true} is VALID [2020-07-10 20:17:14,317 INFO L280 TraceCheckUtils]: 12: Hoare triple {14563#true} ~this_state~0 := 0; {14563#true} is VALID [2020-07-10 20:17:14,317 INFO L280 TraceCheckUtils]: 13: Hoare triple {14563#true} goto; {14563#true} is VALID [2020-07-10 20:17:14,317 INFO L280 TraceCheckUtils]: 14: Hoare triple {14563#true} assume !false; {14563#true} is VALID [2020-07-10 20:17:14,317 INFO L280 TraceCheckUtils]: 15: Hoare triple {14563#true} assume 0 == ~q~0; {14563#true} is VALID [2020-07-10 20:17:14,317 INFO L280 TraceCheckUtils]: 16: Hoare triple {14563#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {14563#true} is VALID [2020-07-10 20:17:14,318 INFO L280 TraceCheckUtils]: 17: Hoare triple {14563#true} assume 0 != #t~nondet0; {14563#true} is VALID [2020-07-10 20:17:14,318 INFO L280 TraceCheckUtils]: 18: Hoare triple {14563#true} havoc #t~nondet0; {14563#true} is VALID [2020-07-10 20:17:14,318 INFO L280 TraceCheckUtils]: 19: Hoare triple {14563#true} ~method_id~0 := 3; {14563#true} is VALID [2020-07-10 20:17:14,318 INFO L280 TraceCheckUtils]: 20: Hoare triple {14563#true} assume !false; {14563#true} is VALID [2020-07-10 20:17:14,319 INFO L280 TraceCheckUtils]: 21: Hoare triple {14563#true} ~q~0 := 2; {14563#true} is VALID [2020-07-10 20:17:14,319 INFO L280 TraceCheckUtils]: 22: Hoare triple {14563#true} ~this_state~0 := 0; {14563#true} is VALID [2020-07-10 20:17:14,319 INFO L280 TraceCheckUtils]: 23: Hoare triple {14563#true} assume !false; {14563#true} is VALID [2020-07-10 20:17:14,319 INFO L280 TraceCheckUtils]: 24: Hoare triple {14563#true} assume !(0 == ~q~0); {14563#true} is VALID [2020-07-10 20:17:14,319 INFO L280 TraceCheckUtils]: 25: Hoare triple {14563#true} assume !(1 == ~q~0); {14563#true} is VALID [2020-07-10 20:17:14,320 INFO L280 TraceCheckUtils]: 26: Hoare triple {14563#true} assume 2 == ~q~0; {14563#true} is VALID [2020-07-10 20:17:14,320 INFO L280 TraceCheckUtils]: 27: Hoare triple {14563#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {14563#true} is VALID [2020-07-10 20:17:14,320 INFO L280 TraceCheckUtils]: 28: Hoare triple {14563#true} assume !(0 != #t~nondet4); {14563#true} is VALID [2020-07-10 20:17:14,320 INFO L280 TraceCheckUtils]: 29: Hoare triple {14563#true} havoc #t~nondet4; {14563#true} is VALID [2020-07-10 20:17:14,320 INFO L280 TraceCheckUtils]: 30: Hoare triple {14563#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {14563#true} is VALID [2020-07-10 20:17:14,320 INFO L280 TraceCheckUtils]: 31: Hoare triple {14563#true} assume 0 != #t~nondet5; {14563#true} is VALID [2020-07-10 20:17:14,320 INFO L280 TraceCheckUtils]: 32: Hoare triple {14563#true} havoc #t~nondet5; {14563#true} is VALID [2020-07-10 20:17:14,321 INFO L280 TraceCheckUtils]: 33: Hoare triple {14563#true} ~method_id~0 := 2; {14563#true} is VALID [2020-07-10 20:17:14,321 INFO L280 TraceCheckUtils]: 34: Hoare triple {14563#true} assume !false; {14563#true} is VALID [2020-07-10 20:17:14,321 INFO L280 TraceCheckUtils]: 35: Hoare triple {14563#true} ~q~0 := 4; {14563#true} is VALID [2020-07-10 20:17:14,321 INFO L280 TraceCheckUtils]: 36: Hoare triple {14563#true} ~this_state~0 := 3; {14573#(= 3 main_~this_state~0)} is VALID [2020-07-10 20:17:14,322 INFO L280 TraceCheckUtils]: 37: Hoare triple {14573#(= 3 main_~this_state~0)} assume !false; {14573#(= 3 main_~this_state~0)} is VALID [2020-07-10 20:17:14,322 INFO L280 TraceCheckUtils]: 38: Hoare triple {14573#(= 3 main_~this_state~0)} assume !(0 == ~q~0); {14573#(= 3 main_~this_state~0)} is VALID [2020-07-10 20:17:14,323 INFO L280 TraceCheckUtils]: 39: Hoare triple {14573#(= 3 main_~this_state~0)} assume !(1 == ~q~0); {14573#(= 3 main_~this_state~0)} is VALID [2020-07-10 20:17:14,323 INFO L280 TraceCheckUtils]: 40: Hoare triple {14573#(= 3 main_~this_state~0)} assume !(2 == ~q~0); {14573#(= 3 main_~this_state~0)} is VALID [2020-07-10 20:17:14,323 INFO L280 TraceCheckUtils]: 41: Hoare triple {14573#(= 3 main_~this_state~0)} assume !(3 == ~q~0); {14573#(= 3 main_~this_state~0)} is VALID [2020-07-10 20:17:14,324 INFO L280 TraceCheckUtils]: 42: Hoare triple {14573#(= 3 main_~this_state~0)} assume 4 == ~q~0; {14573#(= 3 main_~this_state~0)} is VALID [2020-07-10 20:17:14,325 INFO L280 TraceCheckUtils]: 43: Hoare triple {14573#(= 3 main_~this_state~0)} assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647; {14573#(= 3 main_~this_state~0)} is VALID [2020-07-10 20:17:14,325 INFO L280 TraceCheckUtils]: 44: Hoare triple {14573#(= 3 main_~this_state~0)} assume !(0 != #t~nondet15); {14573#(= 3 main_~this_state~0)} is VALID [2020-07-10 20:17:14,326 INFO L280 TraceCheckUtils]: 45: Hoare triple {14573#(= 3 main_~this_state~0)} havoc #t~nondet15; {14573#(= 3 main_~this_state~0)} is VALID [2020-07-10 20:17:14,326 INFO L280 TraceCheckUtils]: 46: Hoare triple {14573#(= 3 main_~this_state~0)} assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; {14573#(= 3 main_~this_state~0)} is VALID [2020-07-10 20:17:14,327 INFO L280 TraceCheckUtils]: 47: Hoare triple {14573#(= 3 main_~this_state~0)} assume !(0 != #t~nondet16); {14573#(= 3 main_~this_state~0)} is VALID [2020-07-10 20:17:14,328 INFO L280 TraceCheckUtils]: 48: Hoare triple {14573#(= 3 main_~this_state~0)} havoc #t~nondet16; {14573#(= 3 main_~this_state~0)} is VALID [2020-07-10 20:17:14,328 INFO L280 TraceCheckUtils]: 49: Hoare triple {14573#(= 3 main_~this_state~0)} assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647; {14573#(= 3 main_~this_state~0)} is VALID [2020-07-10 20:17:14,329 INFO L280 TraceCheckUtils]: 50: Hoare triple {14573#(= 3 main_~this_state~0)} assume !(0 != #t~nondet17); {14573#(= 3 main_~this_state~0)} is VALID [2020-07-10 20:17:14,329 INFO L280 TraceCheckUtils]: 51: Hoare triple {14573#(= 3 main_~this_state~0)} havoc #t~nondet17; {14573#(= 3 main_~this_state~0)} is VALID [2020-07-10 20:17:14,330 INFO L280 TraceCheckUtils]: 52: Hoare triple {14573#(= 3 main_~this_state~0)} assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647; {14573#(= 3 main_~this_state~0)} is VALID [2020-07-10 20:17:14,330 INFO L280 TraceCheckUtils]: 53: Hoare triple {14573#(= 3 main_~this_state~0)} assume 0 != #t~nondet18; {14573#(= 3 main_~this_state~0)} is VALID [2020-07-10 20:17:14,330 INFO L280 TraceCheckUtils]: 54: Hoare triple {14573#(= 3 main_~this_state~0)} havoc #t~nondet18; {14573#(= 3 main_~this_state~0)} is VALID [2020-07-10 20:17:14,331 INFO L280 TraceCheckUtils]: 55: Hoare triple {14573#(= 3 main_~this_state~0)} ~method_id~0 := 5; {14573#(= 3 main_~this_state~0)} is VALID [2020-07-10 20:17:14,332 INFO L280 TraceCheckUtils]: 56: Hoare triple {14573#(= 3 main_~this_state~0)} assume 3 != ~this_state~0; {14564#false} is VALID [2020-07-10 20:17:14,332 INFO L280 TraceCheckUtils]: 57: Hoare triple {14564#false} assume !false; {14564#false} is VALID [2020-07-10 20:17:14,334 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 20:17:14,334 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:17:14,335 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1839966119] [2020-07-10 20:17:14,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:17:14,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 20:17:14,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882330950] [2020-07-10 20:17:14,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2020-07-10 20:17:14,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:17:14,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 20:17:14,391 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:17:14,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 20:17:14,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:17:14,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 20:17:14,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 20:17:14,393 INFO L87 Difference]: Start difference. First operand 153 states and 171 transitions. Second operand 4 states. [2020-07-10 20:17:15,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:17:15,616 INFO L93 Difference]: Finished difference Result 243 states and 275 transitions. [2020-07-10 20:17:15,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 20:17:15,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2020-07-10 20:17:15,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:17:15,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 20:17:15,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 267 transitions. [2020-07-10 20:17:15,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 20:17:15,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 267 transitions. [2020-07-10 20:17:15,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 267 transitions. [2020-07-10 20:17:15,947 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 267 edges. 267 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:17:15,947 INFO L225 Difference]: With dead ends: 243 [2020-07-10 20:17:15,947 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 20:17:15,949 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:17:15,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 20:17:15,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 20:17:15,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:17:15,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 20:17:15,950 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:17:15,950 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:17:15,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:17:15,950 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:17:15,950 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:17:15,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:17:15,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:17:15,950 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:17:15,950 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:17:15,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:17:15,951 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:17:15,951 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:17:15,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:17:15,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:17:15,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:17:15,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:17:15,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 20:17:15,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 20:17:15,952 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2020-07-10 20:17:15,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:17:15,952 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 20:17:15,952 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 20:17:15,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-10 20:17:15,952 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 20:17:15,952 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:17:15,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:17:15,952 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-10 20:17:15,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 20:17:19,568 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:17:19,569 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-07-10 20:17:19,569 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|)) [2020-07-10 20:17:19,569 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-07-10 20:17:19,569 INFO L271 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: true [2020-07-10 20:17:19,570 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-07-10 20:17:19,570 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-10 20:17:19,570 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:17:19,570 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:17:19,570 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 20:17:19,570 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 20:17:19,571 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:17:19,571 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 390) the Hoare annotation is: true [2020-07-10 20:17:19,571 INFO L264 CegarLoopResult]: At program point L366(lines 366 377) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-10 20:17:19,571 INFO L264 CegarLoopResult]: At program point L300(line 300) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-10 20:17:19,572 INFO L264 CegarLoopResult]: At program point L300-1(lines 300 315) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-10 20:17:19,572 INFO L264 CegarLoopResult]: At program point L234(lines 234 245) the Hoare annotation is: (or (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) (and (<= 3 main_~q~0) (= 2 main_~this_state~0))) [2020-07-10 20:17:19,572 INFO L264 CegarLoopResult]: At program point L300-2(line 300) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-10 20:17:19,572 INFO L264 CegarLoopResult]: At program point L300-3(line 300) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-10 20:17:19,572 INFO L264 CegarLoopResult]: At program point L102(lines 102 113) the Hoare annotation is: (= 2 main_~q~0) [2020-07-10 20:17:19,572 INFO L264 CegarLoopResult]: At program point L334(lines 334 345) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-10 20:17:19,572 INFO L264 CegarLoopResult]: At program point L268(line 268) the Hoare annotation is: false [2020-07-10 20:17:19,572 INFO L264 CegarLoopResult]: At program point L202(lines 202 213) the Hoare annotation is: (= 3 main_~q~0) [2020-07-10 20:17:19,573 INFO L264 CegarLoopResult]: At program point L70(lines 70 72) the Hoare annotation is: false [2020-07-10 20:17:19,573 INFO L264 CegarLoopResult]: At program point L368(line 368) the Hoare annotation is: false [2020-07-10 20:17:19,573 INFO L264 CegarLoopResult]: At program point L302(lines 302 313) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-10 20:17:19,573 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 390) the Hoare annotation is: true [2020-07-10 20:17:19,573 INFO L264 CegarLoopResult]: At program point L170(lines 170 172) the Hoare annotation is: (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) [2020-07-10 20:17:19,573 INFO L264 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: (and (= 0 main_~q~0) (<= main_~this_state~0 0)) [2020-07-10 20:17:19,573 INFO L264 CegarLoopResult]: At program point L270(lines 270 272) the Hoare annotation is: false [2020-07-10 20:17:19,573 INFO L264 CegarLoopResult]: At program point L138(lines 138 140) the Hoare annotation is: (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) [2020-07-10 20:17:19,574 INFO L264 CegarLoopResult]: At program point L370(lines 370 372) the Hoare annotation is: false [2020-07-10 20:17:19,574 INFO L264 CegarLoopResult]: At program point L238(lines 238 240) the Hoare annotation is: (or (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) (and (<= 3 main_~q~0) (= 2 main_~this_state~0))) [2020-07-10 20:17:19,574 INFO L264 CegarLoopResult]: At program point L106(lines 106 108) the Hoare annotation is: (= 2 main_~q~0) [2020-07-10 20:17:19,574 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-10 20:17:19,574 INFO L264 CegarLoopResult]: At program point L371(lines 13 390) the Hoare annotation is: false [2020-07-10 20:17:19,574 INFO L264 CegarLoopResult]: At program point L338(lines 338 340) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-10 20:17:19,574 INFO L264 CegarLoopResult]: At program point L206(lines 206 208) the Hoare annotation is: (= 3 main_~q~0) [2020-07-10 20:17:19,574 INFO L271 CegarLoopResult]: At program point L74(line 74) the Hoare annotation is: true [2020-07-10 20:17:19,575 INFO L264 CegarLoopResult]: At program point L306(lines 306 308) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-10 20:17:19,575 INFO L271 CegarLoopResult]: At program point L174(line 174) the Hoare annotation is: true [2020-07-10 20:17:19,575 INFO L264 CegarLoopResult]: At program point L274(line 274) the Hoare annotation is: false [2020-07-10 20:17:19,575 INFO L271 CegarLoopResult]: At program point L142(line 142) the Hoare annotation is: true [2020-07-10 20:17:19,575 INFO L264 CegarLoopResult]: At program point L374(line 374) the Hoare annotation is: false [2020-07-10 20:17:19,575 INFO L271 CegarLoopResult]: At program point L242(line 242) the Hoare annotation is: true [2020-07-10 20:17:19,575 INFO L264 CegarLoopResult]: At program point L110(line 110) the Hoare annotation is: (= 2 main_~q~0) [2020-07-10 20:17:19,575 INFO L264 CegarLoopResult]: At program point L342(line 342) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-10 20:17:19,575 INFO L264 CegarLoopResult]: At program point L276(line 276) the Hoare annotation is: false [2020-07-10 20:17:19,575 INFO L264 CegarLoopResult]: At program point L210(line 210) the Hoare annotation is: (= 3 main_~q~0) [2020-07-10 20:17:19,575 INFO L264 CegarLoopResult]: At program point L376(line 376) the Hoare annotation is: false [2020-07-10 20:17:19,576 INFO L264 CegarLoopResult]: At program point L310(line 310) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-10 20:17:19,576 INFO L264 CegarLoopResult]: At program point L112(line 112) the Hoare annotation is: (= 3 main_~q~0) [2020-07-10 20:17:19,576 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 389) the Hoare annotation is: false [2020-07-10 20:17:19,576 INFO L264 CegarLoopResult]: At program point L344(line 344) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-10 20:17:19,576 INFO L264 CegarLoopResult]: At program point L212(line 212) the Hoare annotation is: (<= 4 main_~q~0) [2020-07-10 20:17:19,576 INFO L264 CegarLoopResult]: At program point L80(line 80) the Hoare annotation is: false [2020-07-10 20:17:19,576 INFO L264 CegarLoopResult]: At program point L47(lines 47 98) the Hoare annotation is: (or (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) (and (= 3 main_~q~0) (= 2 main_~this_state~0)) (and (<= main_~this_state~0 0) (= 2 main_~q~0))) [2020-07-10 20:17:19,576 INFO L264 CegarLoopResult]: At program point L80-1(lines 80 95) the Hoare annotation is: false [2020-07-10 20:17:19,577 INFO L264 CegarLoopResult]: At program point L80-2(line 80) the Hoare annotation is: false [2020-07-10 20:17:19,577 INFO L264 CegarLoopResult]: At program point L80-3(line 80) the Hoare annotation is: false [2020-07-10 20:17:19,577 INFO L264 CegarLoopResult]: At program point L312(line 312) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-10 20:17:19,577 INFO L264 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: false [2020-07-10 20:17:19,577 INFO L264 CegarLoopResult]: At program point L48-1(lines 48 63) the Hoare annotation is: false [2020-07-10 20:17:19,577 INFO L264 CegarLoopResult]: At program point L48-2(line 48) the Hoare annotation is: false [2020-07-10 20:17:19,577 INFO L264 CegarLoopResult]: At program point L48-3(line 48) the Hoare annotation is: false [2020-07-10 20:17:19,577 INFO L264 CegarLoopResult]: At program point L148(line 148) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-10 20:17:19,577 INFO L264 CegarLoopResult]: At program point L148-1(lines 148 163) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-10 20:17:19,577 INFO L264 CegarLoopResult]: At program point L82(lines 82 93) the Hoare annotation is: false [2020-07-10 20:17:19,578 INFO L264 CegarLoopResult]: At program point L148-2(line 148) the Hoare annotation is: (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) [2020-07-10 20:17:19,578 INFO L264 CegarLoopResult]: At program point L148-3(line 148) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-10 20:17:19,578 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (= 0 main_~q~0) [2020-07-10 20:17:19,578 INFO L264 CegarLoopResult]: At program point L248(line 248) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-10 20:17:19,578 INFO L264 CegarLoopResult]: At program point L248-1(lines 248 263) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-10 20:17:19,578 INFO L264 CegarLoopResult]: At program point L248-2(line 248) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-10 20:17:19,578 INFO L264 CegarLoopResult]: At program point L248-3(line 248) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-10 20:17:19,579 INFO L264 CegarLoopResult]: At program point L116(line 116) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-10 20:17:19,579 INFO L264 CegarLoopResult]: At program point L116-1(lines 116 131) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-10 20:17:19,579 INFO L264 CegarLoopResult]: At program point L50(lines 50 61) the Hoare annotation is: false [2020-07-10 20:17:19,579 INFO L264 CegarLoopResult]: At program point L116-2(line 116) the Hoare annotation is: (= 2 main_~q~0) [2020-07-10 20:17:19,579 INFO L264 CegarLoopResult]: At program point L116-3(line 116) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-10 20:17:19,579 INFO L264 CegarLoopResult]: At program point L381(lines 22 385) the Hoare annotation is: (let ((.cse0 (<= main_~this_state~0 0))) (or (and (= 0 main_~q~0) .cse0) (and (= 3 main_~q~0) (= 2 main_~this_state~0)) (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) (and .cse0 (= 2 main_~q~0)))) [2020-07-10 20:17:19,579 INFO L264 CegarLoopResult]: At program point L348(line 348) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-10 20:17:19,579 INFO L264 CegarLoopResult]: At program point L348-1(lines 348 363) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-10 20:17:19,579 INFO L264 CegarLoopResult]: At program point L348-2(line 348) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-10 20:17:19,580 INFO L264 CegarLoopResult]: At program point L348-3(line 348) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-10 20:17:19,580 INFO L264 CegarLoopResult]: At program point L216(line 216) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-10 20:17:19,580 INFO L264 CegarLoopResult]: At program point L183(lines 183 282) the Hoare annotation is: (or (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) (and (= 3 main_~q~0) (= 2 main_~this_state~0))) [2020-07-10 20:17:19,580 INFO L264 CegarLoopResult]: At program point L216-1(lines 216 231) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-10 20:17:19,580 INFO L264 CegarLoopResult]: At program point L150(lines 150 161) the Hoare annotation is: (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) [2020-07-10 20:17:19,580 INFO L264 CegarLoopResult]: At program point L216-2(line 216) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-10 20:17:19,580 INFO L264 CegarLoopResult]: At program point L216-3(line 216) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-10 20:17:19,580 INFO L264 CegarLoopResult]: At program point L316(line 316) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-10 20:17:19,580 INFO L264 CegarLoopResult]: At program point L283(lines 283 382) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-10 20:17:19,581 INFO L264 CegarLoopResult]: At program point L316-1(lines 316 331) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-10 20:17:19,581 INFO L264 CegarLoopResult]: At program point L250(lines 250 261) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-10 20:17:19,581 INFO L264 CegarLoopResult]: At program point L316-2(line 316) the Hoare annotation is: (or (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) (and (<= 4 main_~q~0) (<= 3 main_~this_state~0))) [2020-07-10 20:17:19,581 INFO L264 CegarLoopResult]: At program point L316-3(line 316) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-10 20:17:19,581 INFO L264 CegarLoopResult]: At program point L184(line 184) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-10 20:17:19,581 INFO L264 CegarLoopResult]: At program point L184-1(lines 184 199) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-10 20:17:19,581 INFO L264 CegarLoopResult]: At program point L118(lines 118 129) the Hoare annotation is: (= 2 main_~q~0) [2020-07-10 20:17:19,581 INFO L264 CegarLoopResult]: At program point L184-2(line 184) the Hoare annotation is: (= 3 main_~q~0) [2020-07-10 20:17:19,581 INFO L264 CegarLoopResult]: At program point L184-3(line 184) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-10 20:17:19,581 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (= 0 main_~q~0) [2020-07-10 20:17:19,581 INFO L264 CegarLoopResult]: At program point L350(lines 350 361) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-10 20:17:19,581 INFO L264 CegarLoopResult]: At program point L284(line 284) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-10 20:17:19,582 INFO L264 CegarLoopResult]: At program point L284-1(lines 284 299) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-10 20:17:19,582 INFO L264 CegarLoopResult]: At program point L218(lines 218 229) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-10 20:17:19,582 INFO L264 CegarLoopResult]: At program point L284-2(line 284) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-10 20:17:19,582 INFO L264 CegarLoopResult]: At program point L284-3(line 284) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-10 20:17:19,582 INFO L264 CegarLoopResult]: At program point L86(lines 86 88) the Hoare annotation is: false [2020-07-10 20:17:19,582 INFO L264 CegarLoopResult]: At program point L318(lines 318 329) the Hoare annotation is: (or (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) (and (<= 4 main_~q~0) (<= 3 main_~this_state~0))) [2020-07-10 20:17:19,582 INFO L264 CegarLoopResult]: At program point L252(line 252) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-10 20:17:19,582 INFO L264 CegarLoopResult]: At program point L186(lines 186 197) the Hoare annotation is: (= 3 main_~q~0) [2020-07-10 20:17:19,582 INFO L264 CegarLoopResult]: At program point L54(lines 54 56) the Hoare annotation is: false [2020-07-10 20:17:19,582 INFO L264 CegarLoopResult]: At program point L352(line 352) the Hoare annotation is: false [2020-07-10 20:17:19,582 INFO L264 CegarLoopResult]: At program point L286(lines 286 297) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-10 20:17:19,583 INFO L264 CegarLoopResult]: At program point L154(lines 154 156) the Hoare annotation is: (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) [2020-07-10 20:17:19,583 INFO L264 CegarLoopResult]: At program point L22-2(lines 22 385) the Hoare annotation is: (or (and (= 0 main_~q~0) (<= main_~this_state~0 0)) (and (<= 4 main_~q~0) (= 3 main_~this_state~0))) [2020-07-10 20:17:19,583 INFO L271 CegarLoopResult]: At program point L22-3(lines 22 385) the Hoare annotation is: true [2020-07-10 20:17:19,583 INFO L264 CegarLoopResult]: At program point L254(lines 254 256) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-10 20:17:19,583 INFO L264 CegarLoopResult]: At program point L122(lines 122 124) the Hoare annotation is: (= 2 main_~q~0) [2020-07-10 20:17:19,583 INFO L264 CegarLoopResult]: At program point L354(lines 354 356) the Hoare annotation is: false [2020-07-10 20:17:19,583 INFO L264 CegarLoopResult]: At program point L222(lines 222 224) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-10 20:17:19,583 INFO L271 CegarLoopResult]: At program point L90(line 90) the Hoare annotation is: true [2020-07-10 20:17:19,583 INFO L264 CegarLoopResult]: At program point L322(lines 322 324) the Hoare annotation is: (or (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) (and (<= 4 main_~q~0) (<= 3 main_~this_state~0))) [2020-07-10 20:17:19,583 INFO L264 CegarLoopResult]: At program point L190(lines 190 192) the Hoare annotation is: (= 3 main_~q~0) [2020-07-10 20:17:19,583 INFO L271 CegarLoopResult]: At program point L58(line 58) the Hoare annotation is: true [2020-07-10 20:17:19,583 INFO L264 CegarLoopResult]: At program point L290(lines 290 292) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-10 20:17:19,584 INFO L271 CegarLoopResult]: At program point L158(line 158) the Hoare annotation is: true [2020-07-10 20:17:19,584 INFO L264 CegarLoopResult]: At program point L258(line 258) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-10 20:17:19,584 INFO L264 CegarLoopResult]: At program point L126(line 126) the Hoare annotation is: (= 2 main_~q~0) [2020-07-10 20:17:19,584 INFO L264 CegarLoopResult]: At program point L27(lines 27 46) the Hoare annotation is: (let ((.cse0 (<= main_~this_state~0 0))) (or (and (= 0 main_~q~0) .cse0) (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) (and (= 3 main_~q~0) (= 2 main_~this_state~0)) (and .cse0 (= 2 main_~q~0)))) [2020-07-10 20:17:19,584 INFO L264 CegarLoopResult]: At program point L358(line 358) the Hoare annotation is: false [2020-07-10 20:17:19,584 INFO L264 CegarLoopResult]: At program point L226(line 226) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-10 20:17:19,584 INFO L264 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: (and (= 0 main_~q~0) (<= main_~this_state~0 0)) [2020-07-10 20:17:19,585 INFO L264 CegarLoopResult]: At program point L28-1(lines 28 43) the Hoare annotation is: (and (= 0 main_~q~0) (<= main_~this_state~0 0)) [2020-07-10 20:17:19,585 INFO L264 CegarLoopResult]: At program point L28-2(line 28) the Hoare annotation is: (and (= 0 main_~q~0) (<= main_~this_state~0 0)) [2020-07-10 20:17:19,585 INFO L264 CegarLoopResult]: At program point L28-3(line 28) the Hoare annotation is: (and (= 0 main_~q~0) (<= main_~this_state~0 0)) [2020-07-10 20:17:19,585 INFO L271 CegarLoopResult]: At program point L326(line 326) the Hoare annotation is: true [2020-07-10 20:17:19,585 INFO L264 CegarLoopResult]: At program point L260(line 260) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-10 20:17:19,585 INFO L264 CegarLoopResult]: At program point L194(line 194) the Hoare annotation is: (= 3 main_~q~0) [2020-07-10 20:17:19,585 INFO L264 CegarLoopResult]: At program point L128(line 128) the Hoare annotation is: (<= 4 main_~q~0) [2020-07-10 20:17:19,585 INFO L264 CegarLoopResult]: At program point L360(line 360) the Hoare annotation is: false [2020-07-10 20:17:19,585 INFO L264 CegarLoopResult]: At program point L294(line 294) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-10 20:17:19,585 INFO L264 CegarLoopResult]: At program point L228(line 228) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-10 20:17:19,586 INFO L264 CegarLoopResult]: At program point L30(lines 30 41) the Hoare annotation is: (and (= 0 main_~q~0) (<= main_~this_state~0 0)) [2020-07-10 20:17:19,586 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 390) the Hoare annotation is: true [2020-07-10 20:17:19,586 INFO L264 CegarLoopResult]: At program point L196(line 196) the Hoare annotation is: (= 3 main_~q~0) [2020-07-10 20:17:19,586 INFO L264 CegarLoopResult]: At program point L64(line 64) the Hoare annotation is: false [2020-07-10 20:17:19,586 INFO L264 CegarLoopResult]: At program point L64-1(lines 64 79) the Hoare annotation is: false [2020-07-10 20:17:19,586 INFO L264 CegarLoopResult]: At program point L64-2(line 64) the Hoare annotation is: false [2020-07-10 20:17:19,586 INFO L264 CegarLoopResult]: At program point L64-3(line 64) the Hoare annotation is: false [2020-07-10 20:17:19,586 INFO L264 CegarLoopResult]: At program point L296(line 296) the Hoare annotation is: (and (= 3 main_~q~0) (= 3 main_~this_state~0)) [2020-07-10 20:17:19,586 INFO L264 CegarLoopResult]: At program point L164(line 164) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-10 20:17:19,586 INFO L264 CegarLoopResult]: At program point L164-1(lines 164 179) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-10 20:17:19,586 INFO L264 CegarLoopResult]: At program point L164-2(line 164) the Hoare annotation is: (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) [2020-07-10 20:17:19,586 INFO L264 CegarLoopResult]: At program point L164-3(line 164) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-10 20:17:19,586 INFO L264 CegarLoopResult]: At program point L264(line 264) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-10 20:17:19,587 INFO L264 CegarLoopResult]: At program point L264-1(lines 264 279) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-10 20:17:19,587 INFO L264 CegarLoopResult]: At program point L264-2(line 264) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-10 20:17:19,587 INFO L264 CegarLoopResult]: At program point L264-3(line 264) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-10 20:17:19,587 INFO L264 CegarLoopResult]: At program point L132(line 132) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-10 20:17:19,587 INFO L264 CegarLoopResult]: At program point L99(lines 99 182) the Hoare annotation is: (or (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) (and (= 3 main_~q~0) (= 2 main_~this_state~0)) (and (<= main_~this_state~0 0) (= 2 main_~q~0))) [2020-07-10 20:17:19,587 INFO L264 CegarLoopResult]: At program point L132-1(lines 132 147) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-10 20:17:19,587 INFO L264 CegarLoopResult]: At program point L66(lines 66 77) the Hoare annotation is: false [2020-07-10 20:17:19,587 INFO L264 CegarLoopResult]: At program point L132-2(line 132) the Hoare annotation is: (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) [2020-07-10 20:17:19,587 INFO L264 CegarLoopResult]: At program point L132-3(line 132) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-10 20:17:19,587 INFO L264 CegarLoopResult]: At program point L364(line 364) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-10 20:17:19,587 INFO L264 CegarLoopResult]: At program point L364-1(lines 364 379) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-10 20:17:19,587 INFO L264 CegarLoopResult]: At program point L364-2(line 364) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-10 20:17:19,588 INFO L264 CegarLoopResult]: At program point L364-3(line 364) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-10 20:17:19,588 INFO L264 CegarLoopResult]: At program point L232(line 232) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-10 20:17:19,588 INFO L264 CegarLoopResult]: At program point L232-1(lines 232 247) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-10 20:17:19,588 INFO L264 CegarLoopResult]: At program point L166(lines 166 177) the Hoare annotation is: (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) [2020-07-10 20:17:19,588 INFO L264 CegarLoopResult]: At program point L232-2(line 232) the Hoare annotation is: (or (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) (and (<= 3 main_~q~0) (= 2 main_~this_state~0))) [2020-07-10 20:17:19,588 INFO L264 CegarLoopResult]: At program point L232-3(line 232) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-10 20:17:19,588 INFO L264 CegarLoopResult]: At program point L100(line 100) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-10 20:17:19,588 INFO L264 CegarLoopResult]: At program point L100-1(lines 100 115) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-10 20:17:19,588 INFO L264 CegarLoopResult]: At program point L34(lines 34 36) the Hoare annotation is: (and (= 0 main_~q~0) (<= main_~this_state~0 0)) [2020-07-10 20:17:19,588 INFO L264 CegarLoopResult]: At program point L100-2(line 100) the Hoare annotation is: (= 2 main_~q~0) [2020-07-10 20:17:19,588 INFO L264 CegarLoopResult]: At program point L100-3(line 100) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-10 20:17:19,588 INFO L264 CegarLoopResult]: At program point L332(line 332) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-10 20:17:19,589 INFO L264 CegarLoopResult]: At program point L332-1(lines 332 347) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-10 20:17:19,589 INFO L264 CegarLoopResult]: At program point L266(lines 266 277) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-10 20:17:19,589 INFO L264 CegarLoopResult]: At program point L332-2(line 332) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-10 20:17:19,589 INFO L264 CegarLoopResult]: At program point L332-3(line 332) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-10 20:17:19,589 INFO L264 CegarLoopResult]: At program point L200(line 200) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-10 20:17:19,589 INFO L264 CegarLoopResult]: At program point L200-1(lines 200 215) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-10 20:17:19,589 INFO L264 CegarLoopResult]: At program point L134(lines 134 145) the Hoare annotation is: (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) [2020-07-10 20:17:19,589 INFO L264 CegarLoopResult]: At program point L200-2(line 200) the Hoare annotation is: (= 3 main_~q~0) [2020-07-10 20:17:19,589 INFO L264 CegarLoopResult]: At program point L200-3(line 200) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-10 20:17:19,691 INFO L163 areAnnotationChecker]: CFG has 260 edges. 260 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 20:17:19,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 08:17:19 BoogieIcfgContainer [2020-07-10 20:17:19,722 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 20:17:19,727 INFO L168 Benchmark]: Toolchain (without parser) took 40314.16 ms. Allocated memory was 136.8 MB in the beginning and 531.1 MB in the end (delta: 394.3 MB). Free memory was 101.5 MB in the beginning and 107.9 MB in the end (delta: -6.4 MB). Peak memory consumption was 387.9 MB. Max. memory is 7.1 GB. [2020-07-10 20:17:19,728 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 136.8 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 20:17:19,731 INFO L168 Benchmark]: CACSL2BoogieTranslator took 491.27 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 101.3 MB in the beginning and 179.9 MB in the end (delta: -78.6 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. [2020-07-10 20:17:19,732 INFO L168 Benchmark]: Boogie Preprocessor took 67.04 ms. Allocated memory is still 201.3 MB. Free memory was 179.9 MB in the beginning and 177.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-07-10 20:17:19,733 INFO L168 Benchmark]: RCFGBuilder took 994.03 ms. Allocated memory is still 201.3 MB. Free memory was 177.2 MB in the beginning and 112.4 MB in the end (delta: 64.9 MB). Peak memory consumption was 64.9 MB. Max. memory is 7.1 GB. [2020-07-10 20:17:19,741 INFO L168 Benchmark]: TraceAbstraction took 38755.53 ms. Allocated memory was 201.3 MB in the beginning and 531.1 MB in the end (delta: 329.8 MB). Free memory was 112.4 MB in the beginning and 107.9 MB in the end (delta: 4.5 MB). Peak memory consumption was 334.3 MB. Max. memory is 7.1 GB. [2020-07-10 20:17:19,748 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.33 ms. Allocated memory is still 136.8 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 491.27 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 101.3 MB in the beginning and 179.9 MB in the end (delta: -78.6 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 67.04 ms. Allocated memory is still 201.3 MB. Free memory was 179.9 MB in the beginning and 177.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 994.03 ms. Allocated memory is still 201.3 MB. Free memory was 177.2 MB in the beginning and 112.4 MB in the end (delta: 64.9 MB). Peak memory consumption was 64.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 38755.53 ms. Allocated memory was 201.3 MB in the beginning and 531.1 MB in the end (delta: 329.8 MB). Free memory was 112.4 MB in the beginning and 107.9 MB in the end (delta: 4.5 MB). Peak memory consumption was 334.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 389]: 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: 22]: Loop Invariant Derived loop invariant: (((0 == q && this_state <= 0) || (3 == q && 2 == this_state)) || (4 <= q && 3 == this_state)) || (this_state <= 0 && 2 == q) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (0 == q && this_state <= 0) || (4 <= q && 3 == this_state) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 191 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 34.9s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 21.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1996 SDtfs, 2887 SDslu, 123 SDs, 0 SdLazy, 1238 SolverSat, 97 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=243occurred 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: 7.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 61 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 191 LocationsWithAnnotation, 191 PreInvPairs, 355 NumberOfFragments, 1069 HoareAnnotationTreeSize, 191 FomulaSimplifications, 3354 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 191 FomulaSimplificationsInter, 3787 FormulaSimplificationTreeSizeReductionInter, 2.7s 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...