/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/psyco/psyco_security.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:46:09,156 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:46:09,159 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:46:09,171 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:46:09,172 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:46:09,173 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:46:09,174 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:46:09,176 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:46:09,178 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:46:09,179 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:46:09,179 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:46:09,181 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:46:09,181 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:46:09,182 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:46:09,183 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:46:09,184 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:46:09,185 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:46:09,186 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:46:09,188 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:46:09,190 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:46:09,191 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:46:09,192 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:46:09,193 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:46:09,194 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:46:09,196 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:46:09,196 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:46:09,197 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:46:09,198 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:46:09,198 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:46:09,199 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:46:09,199 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:46:09,200 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:46:09,201 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:46:09,201 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:46:09,203 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:46:09,203 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:46:09,203 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:46:09,204 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:46:09,204 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:46:09,205 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:46:09,205 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:46:09,206 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:46:09,220 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:46:09,221 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:46:09,222 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:46:09,222 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:46:09,222 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:46:09,223 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:46:09,223 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:46:09,223 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:46:09,223 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:46:09,223 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:46:09,224 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:46:09,224 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:46:09,224 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:46:09,224 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:46:09,224 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:46:09,225 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:46:09,225 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:46:09,225 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:46:09,225 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:46:09,225 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:46:09,226 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:46:09,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:46:09,226 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:46:09,226 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:46:09,226 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:46:09,226 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:46:09,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:46:09,227 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:46:09,227 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:46:09,227 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:46:09,519 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:46:09,533 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:46:09,537 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:46:09,538 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:46:09,539 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:46:09,539 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-17 22:46:09,605 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe3d0f641/7b5eae1f570f40b58cc8013a66f728a4/FLAG7cec5f03c [2020-07-17 22:46:10,105 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:46:10,106 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_security.c [2020-07-17 22:46:10,118 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe3d0f641/7b5eae1f570f40b58cc8013a66f728a4/FLAG7cec5f03c [2020-07-17 22:46:10,460 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe3d0f641/7b5eae1f570f40b58cc8013a66f728a4 [2020-07-17 22:46:10,470 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:46:10,473 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:46:10,475 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:46:10,475 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:46:10,478 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:46:10,480 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:46:10" (1/1) ... [2020-07-17 22:46:10,484 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11e615c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:46:10, skipping insertion in model container [2020-07-17 22:46:10,484 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:46:10" (1/1) ... [2020-07-17 22:46:10,492 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:46:10,536 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:46:10,837 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:46:10,846 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:46:10,881 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:46:10,977 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:46:10,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:46:10 WrapperNode [2020-07-17 22:46:10,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:46:10,978 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:46:10,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:46:10,978 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:46:10,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:46:10" (1/1) ... [2020-07-17 22:46:10,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:46:10" (1/1) ... [2020-07-17 22:46:11,002 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:46:10" (1/1) ... [2020-07-17 22:46:11,002 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:46:10" (1/1) ... [2020-07-17 22:46:11,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:46:10" (1/1) ... [2020-07-17 22:46:11,031 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:46:10" (1/1) ... [2020-07-17 22:46:11,034 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:46:10" (1/1) ... [2020-07-17 22:46:11,037 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:46:11,037 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:46:11,038 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:46:11,038 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:46:11,039 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:46:10" (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-17 22:46:11,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:46:11,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:46:11,116 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:46:11,116 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:46:11,116 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:46:11,116 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:46:11,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:46:11,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:46:11,909 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:46:11,910 INFO L295 CfgBuilder]: Removed 18 assume(true) statements. [2020-07-17 22:46:11,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:46:11 BoogieIcfgContainer [2020-07-17 22:46:11,915 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:46:11,916 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:46:11,916 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:46:11,920 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:46:11,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:46:10" (1/3) ... [2020-07-17 22:46:11,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a928018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:46:11, skipping insertion in model container [2020-07-17 22:46:11,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:46:10" (2/3) ... [2020-07-17 22:46:11,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a928018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:46:11, skipping insertion in model container [2020-07-17 22:46:11,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:46:11" (3/3) ... [2020-07-17 22:46:11,924 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_security.c [2020-07-17 22:46:11,935 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:46:11,943 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:46:11,957 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:46:11,982 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:46:11,982 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:46:11,983 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:46:11,983 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:46:11,983 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:46:11,983 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:46:11,984 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:46:11,984 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:46:12,006 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states. [2020-07-17 22:46:12,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-17 22:46:12,013 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:46:12,014 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:46:12,015 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:46:12,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:46:12,021 INFO L82 PathProgramCache]: Analyzing trace with hash -105811556, now seen corresponding path program 1 times [2020-07-17 22:46:12,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:46:12,031 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907757107] [2020-07-17 22:46:12,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:46:12,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:46:12,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:46:12,226 INFO L280 TraceCheckUtils]: 0: Hoare triple {91#(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;~m_initVerify~0 := 2;~m_Signature~0 := 3;~m_sign~0 := 4;~m_verify~0 := 5;~m_update~0 := 6; {86#true} is VALID [2020-07-17 22:46:12,226 INFO L280 TraceCheckUtils]: 1: Hoare triple {86#true} assume true; {86#true} is VALID [2020-07-17 22:46:12,227 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {86#true} {86#true} #376#return; {86#true} is VALID [2020-07-17 22:46:12,230 INFO L263 TraceCheckUtils]: 0: Hoare triple {86#true} call ULTIMATE.init(); {91#(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-17 22:46:12,230 INFO L280 TraceCheckUtils]: 1: Hoare triple {91#(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;~m_initVerify~0 := 2;~m_Signature~0 := 3;~m_sign~0 := 4;~m_verify~0 := 5;~m_update~0 := 6; {86#true} is VALID [2020-07-17 22:46:12,231 INFO L280 TraceCheckUtils]: 2: Hoare triple {86#true} assume true; {86#true} is VALID [2020-07-17 22:46:12,231 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {86#true} {86#true} #376#return; {86#true} is VALID [2020-07-17 22:46:12,231 INFO L263 TraceCheckUtils]: 4: Hoare triple {86#true} call #t~ret21 := main(); {86#true} is VALID [2020-07-17 22:46:12,232 INFO L280 TraceCheckUtils]: 5: Hoare triple {86#true} ~q~0 := 0;havoc ~method_id~0;~this_state~0 := 0; {86#true} is VALID [2020-07-17 22:46:12,232 INFO L280 TraceCheckUtils]: 6: Hoare triple {86#true} goto; {86#true} is VALID [2020-07-17 22:46:12,232 INFO L280 TraceCheckUtils]: 7: Hoare triple {86#true} assume !false; {86#true} is VALID [2020-07-17 22:46:12,233 INFO L280 TraceCheckUtils]: 8: Hoare triple {86#true} assume 0 == ~q~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {86#true} is VALID [2020-07-17 22:46:12,233 INFO L280 TraceCheckUtils]: 9: Hoare triple {86#true} assume 0 != #t~nondet0;havoc #t~nondet0; {86#true} is VALID [2020-07-17 22:46:12,233 INFO L280 TraceCheckUtils]: 10: Hoare triple {86#true} ~method_id~0 := 3; {86#true} is VALID [2020-07-17 22:46:12,240 INFO L280 TraceCheckUtils]: 11: Hoare triple {86#true} assume false; {87#false} is VALID [2020-07-17 22:46:12,240 INFO L280 TraceCheckUtils]: 12: Hoare triple {87#false} assume !false; {87#false} is VALID [2020-07-17 22:46:12,242 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-17 22:46:12,243 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907757107] [2020-07-17 22:46:12,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:46:12,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:46:12,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093103338] [2020-07-17 22:46:12,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-07-17 22:46:12,256 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:46:12,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:46:12,285 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:46:12,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:46:12,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:46:12,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:46:12,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:46:12,296 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 3 states. [2020-07-17 22:46:12,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:12,721 INFO L93 Difference]: Finished difference Result 160 states and 298 transitions. [2020-07-17 22:46:12,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:46:12,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-07-17 22:46:12,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:46:12,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:46:12,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2020-07-17 22:46:12,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:46:12,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2020-07-17 22:46:12,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 298 transitions. [2020-07-17 22:46:13,165 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 298 edges. 298 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:46:13,198 INFO L225 Difference]: With dead ends: 160 [2020-07-17 22:46:13,198 INFO L226 Difference]: Without dead ends: 78 [2020-07-17 22:46:13,202 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-17 22:46:13,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-17 22:46:13,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-07-17 22:46:13,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:46:13,267 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 78 states. [2020-07-17 22:46:13,267 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2020-07-17 22:46:13,268 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2020-07-17 22:46:13,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:13,276 INFO L93 Difference]: Finished difference Result 78 states and 113 transitions. [2020-07-17 22:46:13,277 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 113 transitions. [2020-07-17 22:46:13,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:46:13,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:46:13,279 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2020-07-17 22:46:13,279 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2020-07-17 22:46:13,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:13,288 INFO L93 Difference]: Finished difference Result 78 states and 113 transitions. [2020-07-17 22:46:13,288 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 113 transitions. [2020-07-17 22:46:13,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:46:13,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:46:13,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:46:13,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:46:13,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-07-17 22:46:13,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 113 transitions. [2020-07-17 22:46:13,298 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 113 transitions. Word has length 13 [2020-07-17 22:46:13,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:46:13,299 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 113 transitions. [2020-07-17 22:46:13,299 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:46:13,299 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 113 transitions. [2020-07-17 22:46:13,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-17 22:46:13,301 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:46:13,301 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:46:13,301 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:46:13,302 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:46:13,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:46:13,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1547300989, now seen corresponding path program 1 times [2020-07-17 22:46:13,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:46:13,303 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880336] [2020-07-17 22:46:13,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:46:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:46:13,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:46:13,419 INFO L280 TraceCheckUtils]: 0: Hoare triple {511#(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;~m_initVerify~0 := 2;~m_Signature~0 := 3;~m_sign~0 := 4;~m_verify~0 := 5;~m_update~0 := 6; {505#true} is VALID [2020-07-17 22:46:13,419 INFO L280 TraceCheckUtils]: 1: Hoare triple {505#true} assume true; {505#true} is VALID [2020-07-17 22:46:13,420 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {505#true} {505#true} #376#return; {505#true} is VALID [2020-07-17 22:46:13,423 INFO L263 TraceCheckUtils]: 0: Hoare triple {505#true} call ULTIMATE.init(); {511#(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-17 22:46:13,424 INFO L280 TraceCheckUtils]: 1: Hoare triple {511#(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;~m_initVerify~0 := 2;~m_Signature~0 := 3;~m_sign~0 := 4;~m_verify~0 := 5;~m_update~0 := 6; {505#true} is VALID [2020-07-17 22:46:13,424 INFO L280 TraceCheckUtils]: 2: Hoare triple {505#true} assume true; {505#true} is VALID [2020-07-17 22:46:13,425 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {505#true} {505#true} #376#return; {505#true} is VALID [2020-07-17 22:46:13,425 INFO L263 TraceCheckUtils]: 4: Hoare triple {505#true} call #t~ret21 := main(); {505#true} is VALID [2020-07-17 22:46:13,426 INFO L280 TraceCheckUtils]: 5: Hoare triple {505#true} ~q~0 := 0;havoc ~method_id~0;~this_state~0 := 0; {510#(= 0 main_~q~0)} is VALID [2020-07-17 22:46:13,427 INFO L280 TraceCheckUtils]: 6: Hoare triple {510#(= 0 main_~q~0)} goto; {510#(= 0 main_~q~0)} is VALID [2020-07-17 22:46:13,428 INFO L280 TraceCheckUtils]: 7: Hoare triple {510#(= 0 main_~q~0)} assume !false; {510#(= 0 main_~q~0)} is VALID [2020-07-17 22:46:13,429 INFO L280 TraceCheckUtils]: 8: Hoare triple {510#(= 0 main_~q~0)} assume !(0 == ~q~0); {506#false} is VALID [2020-07-17 22:46:13,429 INFO L280 TraceCheckUtils]: 9: Hoare triple {506#false} assume 1 == ~q~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {506#false} is VALID [2020-07-17 22:46:13,430 INFO L280 TraceCheckUtils]: 10: Hoare triple {506#false} assume 0 != #t~nondet1;havoc #t~nondet1; {506#false} is VALID [2020-07-17 22:46:13,431 INFO L280 TraceCheckUtils]: 11: Hoare triple {506#false} ~method_id~0 := 4; {506#false} is VALID [2020-07-17 22:46:13,432 INFO L280 TraceCheckUtils]: 12: Hoare triple {506#false} assume 2 == ~this_state~0; {506#false} is VALID [2020-07-17 22:46:13,432 INFO L280 TraceCheckUtils]: 13: Hoare triple {506#false} assume !false; {506#false} is VALID [2020-07-17 22:46:13,437 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-17 22:46:13,437 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880336] [2020-07-17 22:46:13,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:46:13,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:46:13,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482383776] [2020-07-17 22:46:13,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-17 22:46:13,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:46:13,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:46:13,462 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:46:13,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:46:13,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:46:13,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:46:13,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:46:13,465 INFO L87 Difference]: Start difference. First operand 78 states and 113 transitions. Second operand 4 states. [2020-07-17 22:46:14,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:14,057 INFO L93 Difference]: Finished difference Result 153 states and 224 transitions. [2020-07-17 22:46:14,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:46:14,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-17 22:46:14,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:46:14,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:46:14,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 224 transitions. [2020-07-17 22:46:14,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:46:14,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 224 transitions. [2020-07-17 22:46:14,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 224 transitions. [2020-07-17 22:46:14,387 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 224 edges. 224 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:46:14,392 INFO L225 Difference]: With dead ends: 153 [2020-07-17 22:46:14,392 INFO L226 Difference]: Without dead ends: 81 [2020-07-17 22:46:14,394 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-17 22:46:14,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-17 22:46:14,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2020-07-17 22:46:14,434 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:46:14,434 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 81 states. [2020-07-17 22:46:14,434 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2020-07-17 22:46:14,435 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2020-07-17 22:46:14,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:14,439 INFO L93 Difference]: Finished difference Result 81 states and 116 transitions. [2020-07-17 22:46:14,439 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 116 transitions. [2020-07-17 22:46:14,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:46:14,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:46:14,441 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2020-07-17 22:46:14,441 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2020-07-17 22:46:14,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:14,446 INFO L93 Difference]: Finished difference Result 81 states and 116 transitions. [2020-07-17 22:46:14,446 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 116 transitions. [2020-07-17 22:46:14,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:46:14,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:46:14,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:46:14,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:46:14,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-17 22:46:14,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 116 transitions. [2020-07-17 22:46:14,452 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 116 transitions. Word has length 14 [2020-07-17 22:46:14,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:46:14,453 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 116 transitions. [2020-07-17 22:46:14,453 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:46:14,453 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 116 transitions. [2020-07-17 22:46:14,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-17 22:46:14,454 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:46:14,454 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:46:14,454 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:46:14,455 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:46:14,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:46:14,455 INFO L82 PathProgramCache]: Analyzing trace with hash 555004895, now seen corresponding path program 1 times [2020-07-17 22:46:14,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:46:14,456 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824414668] [2020-07-17 22:46:14,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:46:14,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:46:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:46:14,542 INFO L280 TraceCheckUtils]: 0: Hoare triple {939#(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;~m_initVerify~0 := 2;~m_Signature~0 := 3;~m_sign~0 := 4;~m_verify~0 := 5;~m_update~0 := 6; {933#true} is VALID [2020-07-17 22:46:14,543 INFO L280 TraceCheckUtils]: 1: Hoare triple {933#true} assume true; {933#true} is VALID [2020-07-17 22:46:14,543 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {933#true} {933#true} #376#return; {933#true} is VALID [2020-07-17 22:46:14,545 INFO L263 TraceCheckUtils]: 0: Hoare triple {933#true} call ULTIMATE.init(); {939#(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-17 22:46:14,545 INFO L280 TraceCheckUtils]: 1: Hoare triple {939#(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;~m_initVerify~0 := 2;~m_Signature~0 := 3;~m_sign~0 := 4;~m_verify~0 := 5;~m_update~0 := 6; {933#true} is VALID [2020-07-17 22:46:14,545 INFO L280 TraceCheckUtils]: 2: Hoare triple {933#true} assume true; {933#true} is VALID [2020-07-17 22:46:14,546 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {933#true} {933#true} #376#return; {933#true} is VALID [2020-07-17 22:46:14,546 INFO L263 TraceCheckUtils]: 4: Hoare triple {933#true} call #t~ret21 := main(); {933#true} is VALID [2020-07-17 22:46:14,546 INFO L280 TraceCheckUtils]: 5: Hoare triple {933#true} ~q~0 := 0;havoc ~method_id~0;~this_state~0 := 0; {933#true} is VALID [2020-07-17 22:46:14,546 INFO L280 TraceCheckUtils]: 6: Hoare triple {933#true} goto; {933#true} is VALID [2020-07-17 22:46:14,547 INFO L280 TraceCheckUtils]: 7: Hoare triple {933#true} assume !false; {933#true} is VALID [2020-07-17 22:46:14,547 INFO L280 TraceCheckUtils]: 8: Hoare triple {933#true} assume 0 == ~q~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {933#true} is VALID [2020-07-17 22:46:14,547 INFO L280 TraceCheckUtils]: 9: Hoare triple {933#true} assume 0 != #t~nondet0;havoc #t~nondet0; {933#true} is VALID [2020-07-17 22:46:14,548 INFO L280 TraceCheckUtils]: 10: Hoare triple {933#true} ~method_id~0 := 3; {933#true} is VALID [2020-07-17 22:46:14,548 INFO L280 TraceCheckUtils]: 11: Hoare triple {933#true} assume !false;~q~0 := 2;~this_state~0 := 0; {938#(<= 2 main_~q~0)} is VALID [2020-07-17 22:46:14,549 INFO L280 TraceCheckUtils]: 12: Hoare triple {938#(<= 2 main_~q~0)} assume !false; {938#(<= 2 main_~q~0)} is VALID [2020-07-17 22:46:14,550 INFO L280 TraceCheckUtils]: 13: Hoare triple {938#(<= 2 main_~q~0)} assume !(0 == ~q~0); {938#(<= 2 main_~q~0)} is VALID [2020-07-17 22:46:14,551 INFO L280 TraceCheckUtils]: 14: Hoare triple {938#(<= 2 main_~q~0)} assume 1 == ~q~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {934#false} is VALID [2020-07-17 22:46:14,551 INFO L280 TraceCheckUtils]: 15: Hoare triple {934#false} assume 0 != #t~nondet1;havoc #t~nondet1; {934#false} is VALID [2020-07-17 22:46:14,551 INFO L280 TraceCheckUtils]: 16: Hoare triple {934#false} ~method_id~0 := 4; {934#false} is VALID [2020-07-17 22:46:14,551 INFO L280 TraceCheckUtils]: 17: Hoare triple {934#false} assume 2 == ~this_state~0; {934#false} is VALID [2020-07-17 22:46:14,552 INFO L280 TraceCheckUtils]: 18: Hoare triple {934#false} assume !false; {934#false} is VALID [2020-07-17 22:46:14,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:46:14,553 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824414668] [2020-07-17 22:46:14,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:46:14,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:46:14,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624937916] [2020-07-17 22:46:14,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-07-17 22:46:14,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:46:14,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:46:14,573 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:46:14,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:46:14,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:46:14,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:46:14,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:46:14,574 INFO L87 Difference]: Start difference. First operand 81 states and 116 transitions. Second operand 4 states. [2020-07-17 22:46:14,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:14,895 INFO L93 Difference]: Finished difference Result 146 states and 213 transitions. [2020-07-17 22:46:14,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:46:14,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-07-17 22:46:14,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:46:14,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:46:14,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2020-07-17 22:46:14,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:46:14,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2020-07-17 22:46:14,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 211 transitions. [2020-07-17 22:46:15,163 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:46:15,165 INFO L225 Difference]: With dead ends: 146 [2020-07-17 22:46:15,165 INFO L226 Difference]: Without dead ends: 72 [2020-07-17 22:46:15,166 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-17 22:46:15,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-07-17 22:46:15,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-07-17 22:46:15,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:46:15,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 72 states. [2020-07-17 22:46:15,208 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2020-07-17 22:46:15,208 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2020-07-17 22:46:15,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:15,213 INFO L93 Difference]: Finished difference Result 72 states and 102 transitions. [2020-07-17 22:46:15,213 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 102 transitions. [2020-07-17 22:46:15,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:46:15,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:46:15,214 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2020-07-17 22:46:15,221 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2020-07-17 22:46:15,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:15,226 INFO L93 Difference]: Finished difference Result 72 states and 102 transitions. [2020-07-17 22:46:15,227 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 102 transitions. [2020-07-17 22:46:15,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:46:15,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:46:15,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:46:15,228 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:46:15,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-07-17 22:46:15,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 102 transitions. [2020-07-17 22:46:15,232 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 102 transitions. Word has length 19 [2020-07-17 22:46:15,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:46:15,232 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 102 transitions. [2020-07-17 22:46:15,233 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:46:15,233 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 102 transitions. [2020-07-17 22:46:15,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:46:15,234 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:46:15,235 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:46:15,235 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:46:15,235 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:46:15,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:46:15,235 INFO L82 PathProgramCache]: Analyzing trace with hash -624681896, now seen corresponding path program 1 times [2020-07-17 22:46:15,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:46:15,237 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666985178] [2020-07-17 22:46:15,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:46:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:46:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:46:15,320 INFO L280 TraceCheckUtils]: 0: Hoare triple {1335#(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;~m_initVerify~0 := 2;~m_Signature~0 := 3;~m_sign~0 := 4;~m_verify~0 := 5;~m_update~0 := 6; {1329#true} is VALID [2020-07-17 22:46:15,320 INFO L280 TraceCheckUtils]: 1: Hoare triple {1329#true} assume true; {1329#true} is VALID [2020-07-17 22:46:15,320 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1329#true} {1329#true} #376#return; {1329#true} is VALID [2020-07-17 22:46:15,322 INFO L263 TraceCheckUtils]: 0: Hoare triple {1329#true} call ULTIMATE.init(); {1335#(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-17 22:46:15,322 INFO L280 TraceCheckUtils]: 1: Hoare triple {1335#(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;~m_initVerify~0 := 2;~m_Signature~0 := 3;~m_sign~0 := 4;~m_verify~0 := 5;~m_update~0 := 6; {1329#true} is VALID [2020-07-17 22:46:15,322 INFO L280 TraceCheckUtils]: 2: Hoare triple {1329#true} assume true; {1329#true} is VALID [2020-07-17 22:46:15,323 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1329#true} {1329#true} #376#return; {1329#true} is VALID [2020-07-17 22:46:15,323 INFO L263 TraceCheckUtils]: 4: Hoare triple {1329#true} call #t~ret21 := main(); {1329#true} is VALID [2020-07-17 22:46:15,323 INFO L280 TraceCheckUtils]: 5: Hoare triple {1329#true} ~q~0 := 0;havoc ~method_id~0;~this_state~0 := 0; {1329#true} is VALID [2020-07-17 22:46:15,323 INFO L280 TraceCheckUtils]: 6: Hoare triple {1329#true} goto; {1329#true} is VALID [2020-07-17 22:46:15,324 INFO L280 TraceCheckUtils]: 7: Hoare triple {1329#true} assume !false; {1329#true} is VALID [2020-07-17 22:46:15,324 INFO L280 TraceCheckUtils]: 8: Hoare triple {1329#true} assume 0 == ~q~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1329#true} is VALID [2020-07-17 22:46:15,324 INFO L280 TraceCheckUtils]: 9: Hoare triple {1329#true} assume 0 != #t~nondet0;havoc #t~nondet0; {1329#true} is VALID [2020-07-17 22:46:15,324 INFO L280 TraceCheckUtils]: 10: Hoare triple {1329#true} ~method_id~0 := 3; {1329#true} is VALID [2020-07-17 22:46:15,325 INFO L280 TraceCheckUtils]: 11: Hoare triple {1329#true} assume !false;~q~0 := 2;~this_state~0 := 0; {1334#(<= main_~this_state~0 0)} is VALID [2020-07-17 22:46:15,326 INFO L280 TraceCheckUtils]: 12: Hoare triple {1334#(<= main_~this_state~0 0)} assume !false; {1334#(<= main_~this_state~0 0)} is VALID [2020-07-17 22:46:15,326 INFO L280 TraceCheckUtils]: 13: Hoare triple {1334#(<= main_~this_state~0 0)} assume !(0 == ~q~0); {1334#(<= main_~this_state~0 0)} is VALID [2020-07-17 22:46:15,327 INFO L280 TraceCheckUtils]: 14: Hoare triple {1334#(<= main_~this_state~0 0)} assume !(1 == ~q~0); {1334#(<= main_~this_state~0 0)} is VALID [2020-07-17 22:46:15,328 INFO L280 TraceCheckUtils]: 15: Hoare triple {1334#(<= main_~this_state~0 0)} assume 2 == ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1334#(<= main_~this_state~0 0)} is VALID [2020-07-17 22:46:15,328 INFO L280 TraceCheckUtils]: 16: Hoare triple {1334#(<= main_~this_state~0 0)} assume !(0 != #t~nondet4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1334#(<= main_~this_state~0 0)} is VALID [2020-07-17 22:46:15,329 INFO L280 TraceCheckUtils]: 17: Hoare triple {1334#(<= main_~this_state~0 0)} assume !(0 != #t~nondet5);havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {1334#(<= main_~this_state~0 0)} is VALID [2020-07-17 22:46:15,329 INFO L280 TraceCheckUtils]: 18: Hoare triple {1334#(<= main_~this_state~0 0)} assume 0 != #t~nondet6;havoc #t~nondet6; {1334#(<= main_~this_state~0 0)} is VALID [2020-07-17 22:46:15,330 INFO L280 TraceCheckUtils]: 19: Hoare triple {1334#(<= main_~this_state~0 0)} ~method_id~0 := 4; {1334#(<= main_~this_state~0 0)} is VALID [2020-07-17 22:46:15,331 INFO L280 TraceCheckUtils]: 20: Hoare triple {1334#(<= main_~this_state~0 0)} assume 2 == ~this_state~0; {1330#false} is VALID [2020-07-17 22:46:15,331 INFO L280 TraceCheckUtils]: 21: Hoare triple {1330#false} assume !false; {1330#false} is VALID [2020-07-17 22:46:15,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:46:15,332 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666985178] [2020-07-17 22:46:15,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:46:15,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:46:15,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572846782] [2020-07-17 22:46:15,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-17 22:46:15,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:46:15,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:46:15,354 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-17 22:46:15,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:46:15,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:46:15,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:46:15,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:46:15,355 INFO L87 Difference]: Start difference. First operand 72 states and 102 transitions. Second operand 4 states. [2020-07-17 22:46:15,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:15,950 INFO L93 Difference]: Finished difference Result 192 states and 280 transitions. [2020-07-17 22:46:15,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:46:15,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-17 22:46:15,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:46:15,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:46:15,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 278 transitions. [2020-07-17 22:46:15,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:46:15,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 278 transitions. [2020-07-17 22:46:15,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 278 transitions. [2020-07-17 22:46:16,368 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 278 edges. 278 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:46:16,371 INFO L225 Difference]: With dead ends: 192 [2020-07-17 22:46:16,372 INFO L226 Difference]: Without dead ends: 122 [2020-07-17 22:46:16,373 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-17 22:46:16,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-07-17 22:46:16,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 108. [2020-07-17 22:46:16,434 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:46:16,434 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 108 states. [2020-07-17 22:46:16,435 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 108 states. [2020-07-17 22:46:16,435 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 108 states. [2020-07-17 22:46:16,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:16,440 INFO L93 Difference]: Finished difference Result 122 states and 166 transitions. [2020-07-17 22:46:16,441 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 166 transitions. [2020-07-17 22:46:16,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:46:16,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:46:16,442 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 122 states. [2020-07-17 22:46:16,442 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 122 states. [2020-07-17 22:46:16,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:16,447 INFO L93 Difference]: Finished difference Result 122 states and 166 transitions. [2020-07-17 22:46:16,448 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 166 transitions. [2020-07-17 22:46:16,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:46:16,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:46:16,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:46:16,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:46:16,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-07-17 22:46:16,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2020-07-17 22:46:16,454 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 22 [2020-07-17 22:46:16,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:46:16,454 INFO L479 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2020-07-17 22:46:16,454 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:46:16,454 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2020-07-17 22:46:16,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-17 22:46:16,455 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:46:16,455 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] [2020-07-17 22:46:16,456 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 22:46:16,456 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:46:16,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:46:16,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1531598883, now seen corresponding path program 1 times [2020-07-17 22:46:16,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:46:16,457 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118722669] [2020-07-17 22:46:16,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:46:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:46:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:46:16,519 INFO L280 TraceCheckUtils]: 0: Hoare triple {1917#(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;~m_initVerify~0 := 2;~m_Signature~0 := 3;~m_sign~0 := 4;~m_verify~0 := 5;~m_update~0 := 6; {1911#true} is VALID [2020-07-17 22:46:16,520 INFO L280 TraceCheckUtils]: 1: Hoare triple {1911#true} assume true; {1911#true} is VALID [2020-07-17 22:46:16,520 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1911#true} {1911#true} #376#return; {1911#true} is VALID [2020-07-17 22:46:16,521 INFO L263 TraceCheckUtils]: 0: Hoare triple {1911#true} call ULTIMATE.init(); {1917#(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-17 22:46:16,522 INFO L280 TraceCheckUtils]: 1: Hoare triple {1917#(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;~m_initVerify~0 := 2;~m_Signature~0 := 3;~m_sign~0 := 4;~m_verify~0 := 5;~m_update~0 := 6; {1911#true} is VALID [2020-07-17 22:46:16,522 INFO L280 TraceCheckUtils]: 2: Hoare triple {1911#true} assume true; {1911#true} is VALID [2020-07-17 22:46:16,523 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1911#true} {1911#true} #376#return; {1911#true} is VALID [2020-07-17 22:46:16,523 INFO L263 TraceCheckUtils]: 4: Hoare triple {1911#true} call #t~ret21 := main(); {1911#true} is VALID [2020-07-17 22:46:16,523 INFO L280 TraceCheckUtils]: 5: Hoare triple {1911#true} ~q~0 := 0;havoc ~method_id~0;~this_state~0 := 0; {1911#true} is VALID [2020-07-17 22:46:16,524 INFO L280 TraceCheckUtils]: 6: Hoare triple {1911#true} goto; {1911#true} is VALID [2020-07-17 22:46:16,524 INFO L280 TraceCheckUtils]: 7: Hoare triple {1911#true} assume !false; {1911#true} is VALID [2020-07-17 22:46:16,524 INFO L280 TraceCheckUtils]: 8: Hoare triple {1911#true} assume 0 == ~q~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1911#true} is VALID [2020-07-17 22:46:16,525 INFO L280 TraceCheckUtils]: 9: Hoare triple {1911#true} assume 0 != #t~nondet0;havoc #t~nondet0; {1911#true} is VALID [2020-07-17 22:46:16,525 INFO L280 TraceCheckUtils]: 10: Hoare triple {1911#true} ~method_id~0 := 3; {1911#true} is VALID [2020-07-17 22:46:16,536 INFO L280 TraceCheckUtils]: 11: Hoare triple {1911#true} assume !false;~q~0 := 2;~this_state~0 := 0; {1916#(= 2 main_~q~0)} is VALID [2020-07-17 22:46:16,537 INFO L280 TraceCheckUtils]: 12: Hoare triple {1916#(= 2 main_~q~0)} assume !false; {1916#(= 2 main_~q~0)} is VALID [2020-07-17 22:46:16,538 INFO L280 TraceCheckUtils]: 13: Hoare triple {1916#(= 2 main_~q~0)} assume !(0 == ~q~0); {1916#(= 2 main_~q~0)} is VALID [2020-07-17 22:46:16,539 INFO L280 TraceCheckUtils]: 14: Hoare triple {1916#(= 2 main_~q~0)} assume !(1 == ~q~0); {1916#(= 2 main_~q~0)} is VALID [2020-07-17 22:46:16,540 INFO L280 TraceCheckUtils]: 15: Hoare triple {1916#(= 2 main_~q~0)} assume !(2 == ~q~0); {1912#false} is VALID [2020-07-17 22:46:16,541 INFO L280 TraceCheckUtils]: 16: Hoare triple {1912#false} assume 3 == ~q~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {1912#false} is VALID [2020-07-17 22:46:16,541 INFO L280 TraceCheckUtils]: 17: Hoare triple {1912#false} assume !(0 != #t~nondet9);havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; {1912#false} is VALID [2020-07-17 22:46:16,541 INFO L280 TraceCheckUtils]: 18: Hoare triple {1912#false} assume !(0 != #t~nondet10);havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; {1912#false} is VALID [2020-07-17 22:46:16,541 INFO L280 TraceCheckUtils]: 19: Hoare triple {1912#false} assume 0 != #t~nondet11;havoc #t~nondet11; {1912#false} is VALID [2020-07-17 22:46:16,541 INFO L280 TraceCheckUtils]: 20: Hoare triple {1912#false} ~method_id~0 := 4; {1912#false} is VALID [2020-07-17 22:46:16,542 INFO L280 TraceCheckUtils]: 21: Hoare triple {1912#false} assume 2 != ~this_state~0; {1912#false} is VALID [2020-07-17 22:46:16,542 INFO L280 TraceCheckUtils]: 22: Hoare triple {1912#false} assume !false; {1912#false} is VALID [2020-07-17 22:46:16,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:46:16,543 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118722669] [2020-07-17 22:46:16,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:46:16,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:46:16,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510467667] [2020-07-17 22:46:16,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-07-17 22:46:16,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:46:16,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:46:16,572 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-17 22:46:16,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:46:16,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:46:16,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:46:16,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:46:16,573 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand 4 states. [2020-07-17 22:46:17,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:17,003 INFO L93 Difference]: Finished difference Result 183 states and 260 transitions. [2020-07-17 22:46:17,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:46:17,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-07-17 22:46:17,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:46:17,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:46:17,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2020-07-17 22:46:17,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:46:17,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2020-07-17 22:46:17,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 195 transitions. [2020-07-17 22:46:17,295 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:46:17,297 INFO L225 Difference]: With dead ends: 183 [2020-07-17 22:46:17,298 INFO L226 Difference]: Without dead ends: 87 [2020-07-17 22:46:17,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-17 22:46:17,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-07-17 22:46:17,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2020-07-17 22:46:17,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:46:17,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 85 states. [2020-07-17 22:46:17,356 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 85 states. [2020-07-17 22:46:17,356 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 85 states. [2020-07-17 22:46:17,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:17,361 INFO L93 Difference]: Finished difference Result 87 states and 118 transitions. [2020-07-17 22:46:17,362 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 118 transitions. [2020-07-17 22:46:17,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:46:17,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:46:17,363 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 87 states. [2020-07-17 22:46:17,363 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 87 states. [2020-07-17 22:46:17,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:17,368 INFO L93 Difference]: Finished difference Result 87 states and 118 transitions. [2020-07-17 22:46:17,368 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 118 transitions. [2020-07-17 22:46:17,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:46:17,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:46:17,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:46:17,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:46:17,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-17 22:46:17,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 117 transitions. [2020-07-17 22:46:17,374 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 117 transitions. Word has length 23 [2020-07-17 22:46:17,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:46:17,374 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 117 transitions. [2020-07-17 22:46:17,374 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:46:17,375 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2020-07-17 22:46:17,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-17 22:46:17,376 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:46:17,376 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:46:17,376 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 22:46:17,377 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:46:17,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:46:17,377 INFO L82 PathProgramCache]: Analyzing trace with hash -576284788, now seen corresponding path program 1 times [2020-07-17 22:46:17,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:46:17,378 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320157074] [2020-07-17 22:46:17,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:46:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:46:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:46:17,509 INFO L280 TraceCheckUtils]: 0: Hoare triple {2399#(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;~m_initVerify~0 := 2;~m_Signature~0 := 3;~m_sign~0 := 4;~m_verify~0 := 5;~m_update~0 := 6; {2393#true} is VALID [2020-07-17 22:46:17,509 INFO L280 TraceCheckUtils]: 1: Hoare triple {2393#true} assume true; {2393#true} is VALID [2020-07-17 22:46:17,510 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2393#true} {2393#true} #376#return; {2393#true} is VALID [2020-07-17 22:46:17,514 INFO L263 TraceCheckUtils]: 0: Hoare triple {2393#true} call ULTIMATE.init(); {2399#(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-17 22:46:17,515 INFO L280 TraceCheckUtils]: 1: Hoare triple {2399#(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;~m_initVerify~0 := 2;~m_Signature~0 := 3;~m_sign~0 := 4;~m_verify~0 := 5;~m_update~0 := 6; {2393#true} is VALID [2020-07-17 22:46:17,515 INFO L280 TraceCheckUtils]: 2: Hoare triple {2393#true} assume true; {2393#true} is VALID [2020-07-17 22:46:17,516 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2393#true} {2393#true} #376#return; {2393#true} is VALID [2020-07-17 22:46:17,517 INFO L263 TraceCheckUtils]: 4: Hoare triple {2393#true} call #t~ret21 := main(); {2393#true} is VALID [2020-07-17 22:46:17,517 INFO L280 TraceCheckUtils]: 5: Hoare triple {2393#true} ~q~0 := 0;havoc ~method_id~0;~this_state~0 := 0; {2393#true} is VALID [2020-07-17 22:46:17,517 INFO L280 TraceCheckUtils]: 6: Hoare triple {2393#true} goto; {2393#true} is VALID [2020-07-17 22:46:17,518 INFO L280 TraceCheckUtils]: 7: Hoare triple {2393#true} assume !false; {2393#true} is VALID [2020-07-17 22:46:17,518 INFO L280 TraceCheckUtils]: 8: Hoare triple {2393#true} assume 0 == ~q~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2393#true} is VALID [2020-07-17 22:46:17,519 INFO L280 TraceCheckUtils]: 9: Hoare triple {2393#true} assume 0 != #t~nondet0;havoc #t~nondet0; {2393#true} is VALID [2020-07-17 22:46:17,519 INFO L280 TraceCheckUtils]: 10: Hoare triple {2393#true} ~method_id~0 := 3; {2393#true} is VALID [2020-07-17 22:46:17,526 INFO L280 TraceCheckUtils]: 11: Hoare triple {2393#true} assume !false;~q~0 := 2;~this_state~0 := 0; {2393#true} is VALID [2020-07-17 22:46:17,527 INFO L280 TraceCheckUtils]: 12: Hoare triple {2393#true} assume !false; {2393#true} is VALID [2020-07-17 22:46:17,527 INFO L280 TraceCheckUtils]: 13: Hoare triple {2393#true} assume !(0 == ~q~0); {2393#true} is VALID [2020-07-17 22:46:17,528 INFO L280 TraceCheckUtils]: 14: Hoare triple {2393#true} assume !(1 == ~q~0); {2393#true} is VALID [2020-07-17 22:46:17,528 INFO L280 TraceCheckUtils]: 15: Hoare triple {2393#true} assume 2 == ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2393#true} is VALID [2020-07-17 22:46:17,528 INFO L280 TraceCheckUtils]: 16: Hoare triple {2393#true} assume 0 != #t~nondet4;havoc #t~nondet4; {2393#true} is VALID [2020-07-17 22:46:17,529 INFO L280 TraceCheckUtils]: 17: Hoare triple {2393#true} ~method_id~0 := 1; {2393#true} is VALID [2020-07-17 22:46:17,543 INFO L280 TraceCheckUtils]: 18: Hoare triple {2393#true} assume !false;~q~0 := 3;~this_state~0 := 2; {2398#(<= 3 main_~q~0)} is VALID [2020-07-17 22:46:17,546 INFO L280 TraceCheckUtils]: 19: Hoare triple {2398#(<= 3 main_~q~0)} assume !false; {2398#(<= 3 main_~q~0)} is VALID [2020-07-17 22:46:17,547 INFO L280 TraceCheckUtils]: 20: Hoare triple {2398#(<= 3 main_~q~0)} assume !(0 == ~q~0); {2398#(<= 3 main_~q~0)} is VALID [2020-07-17 22:46:17,547 INFO L280 TraceCheckUtils]: 21: Hoare triple {2398#(<= 3 main_~q~0)} assume !(1 == ~q~0); {2398#(<= 3 main_~q~0)} is VALID [2020-07-17 22:46:17,548 INFO L280 TraceCheckUtils]: 22: Hoare triple {2398#(<= 3 main_~q~0)} assume 2 == ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2394#false} is VALID [2020-07-17 22:46:17,548 INFO L280 TraceCheckUtils]: 23: Hoare triple {2394#false} assume !(0 != #t~nondet4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2394#false} is VALID [2020-07-17 22:46:17,548 INFO L280 TraceCheckUtils]: 24: Hoare triple {2394#false} assume !(0 != #t~nondet5);havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {2394#false} is VALID [2020-07-17 22:46:17,549 INFO L280 TraceCheckUtils]: 25: Hoare triple {2394#false} assume 0 != #t~nondet6;havoc #t~nondet6; {2394#false} is VALID [2020-07-17 22:46:17,549 INFO L280 TraceCheckUtils]: 26: Hoare triple {2394#false} ~method_id~0 := 4; {2394#false} is VALID [2020-07-17 22:46:17,549 INFO L280 TraceCheckUtils]: 27: Hoare triple {2394#false} assume 2 == ~this_state~0; {2394#false} is VALID [2020-07-17 22:46:17,550 INFO L280 TraceCheckUtils]: 28: Hoare triple {2394#false} assume !false; {2394#false} is VALID [2020-07-17 22:46:17,551 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-17 22:46:17,552 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320157074] [2020-07-17 22:46:17,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:46:17,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:46:17,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810664626] [2020-07-17 22:46:17,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-07-17 22:46:17,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:46:17,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:46:17,584 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:46:17,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:46:17,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:46:17,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:46:17,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:46:17,589 INFO L87 Difference]: Start difference. First operand 85 states and 117 transitions. Second operand 4 states. [2020-07-17 22:46:17,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:17,882 INFO L93 Difference]: Finished difference Result 134 states and 190 transitions. [2020-07-17 22:46:17,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:46:17,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-07-17 22:46:17,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:46:17,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:46:17,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 185 transitions. [2020-07-17 22:46:17,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:46:17,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 185 transitions. [2020-07-17 22:46:17,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 185 transitions. [2020-07-17 22:46:18,117 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:46:18,119 INFO L225 Difference]: With dead ends: 134 [2020-07-17 22:46:18,120 INFO L226 Difference]: Without dead ends: 70 [2020-07-17 22:46:18,121 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-17 22:46:18,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-17 22:46:18,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-07-17 22:46:18,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:46:18,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 70 states. [2020-07-17 22:46:18,160 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2020-07-17 22:46:18,160 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2020-07-17 22:46:18,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:18,164 INFO L93 Difference]: Finished difference Result 70 states and 96 transitions. [2020-07-17 22:46:18,164 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2020-07-17 22:46:18,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:46:18,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:46:18,165 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2020-07-17 22:46:18,165 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2020-07-17 22:46:18,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:18,168 INFO L93 Difference]: Finished difference Result 70 states and 96 transitions. [2020-07-17 22:46:18,168 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2020-07-17 22:46:18,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:46:18,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:46:18,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:46:18,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:46:18,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-17 22:46:18,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2020-07-17 22:46:18,172 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 96 transitions. Word has length 29 [2020-07-17 22:46:18,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:46:18,172 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 96 transitions. [2020-07-17 22:46:18,172 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:46:18,172 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2020-07-17 22:46:18,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-17 22:46:18,173 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:46:18,173 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] [2020-07-17 22:46:18,173 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 22:46:18,174 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:46:18,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:46:18,174 INFO L82 PathProgramCache]: Analyzing trace with hash -31288535, now seen corresponding path program 1 times [2020-07-17 22:46:18,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:46:18,175 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151157398] [2020-07-17 22:46:18,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:46:18,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:46:18,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:46:18,232 INFO L280 TraceCheckUtils]: 0: Hoare triple {2779#(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;~m_initVerify~0 := 2;~m_Signature~0 := 3;~m_sign~0 := 4;~m_verify~0 := 5;~m_update~0 := 6; {2773#true} is VALID [2020-07-17 22:46:18,232 INFO L280 TraceCheckUtils]: 1: Hoare triple {2773#true} assume true; {2773#true} is VALID [2020-07-17 22:46:18,232 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2773#true} {2773#true} #376#return; {2773#true} is VALID [2020-07-17 22:46:18,234 INFO L263 TraceCheckUtils]: 0: Hoare triple {2773#true} call ULTIMATE.init(); {2779#(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-17 22:46:18,234 INFO L280 TraceCheckUtils]: 1: Hoare triple {2779#(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;~m_initVerify~0 := 2;~m_Signature~0 := 3;~m_sign~0 := 4;~m_verify~0 := 5;~m_update~0 := 6; {2773#true} is VALID [2020-07-17 22:46:18,235 INFO L280 TraceCheckUtils]: 2: Hoare triple {2773#true} assume true; {2773#true} is VALID [2020-07-17 22:46:18,235 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2773#true} {2773#true} #376#return; {2773#true} is VALID [2020-07-17 22:46:18,235 INFO L263 TraceCheckUtils]: 4: Hoare triple {2773#true} call #t~ret21 := main(); {2773#true} is VALID [2020-07-17 22:46:18,235 INFO L280 TraceCheckUtils]: 5: Hoare triple {2773#true} ~q~0 := 0;havoc ~method_id~0;~this_state~0 := 0; {2773#true} is VALID [2020-07-17 22:46:18,235 INFO L280 TraceCheckUtils]: 6: Hoare triple {2773#true} goto; {2773#true} is VALID [2020-07-17 22:46:18,236 INFO L280 TraceCheckUtils]: 7: Hoare triple {2773#true} assume !false; {2773#true} is VALID [2020-07-17 22:46:18,236 INFO L280 TraceCheckUtils]: 8: Hoare triple {2773#true} assume 0 == ~q~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2773#true} is VALID [2020-07-17 22:46:18,236 INFO L280 TraceCheckUtils]: 9: Hoare triple {2773#true} assume 0 != #t~nondet0;havoc #t~nondet0; {2773#true} is VALID [2020-07-17 22:46:18,236 INFO L280 TraceCheckUtils]: 10: Hoare triple {2773#true} ~method_id~0 := 3; {2773#true} is VALID [2020-07-17 22:46:18,236 INFO L280 TraceCheckUtils]: 11: Hoare triple {2773#true} assume !false;~q~0 := 2;~this_state~0 := 0; {2773#true} is VALID [2020-07-17 22:46:18,237 INFO L280 TraceCheckUtils]: 12: Hoare triple {2773#true} assume !false; {2773#true} is VALID [2020-07-17 22:46:18,237 INFO L280 TraceCheckUtils]: 13: Hoare triple {2773#true} assume !(0 == ~q~0); {2773#true} is VALID [2020-07-17 22:46:18,237 INFO L280 TraceCheckUtils]: 14: Hoare triple {2773#true} assume !(1 == ~q~0); {2773#true} is VALID [2020-07-17 22:46:18,237 INFO L280 TraceCheckUtils]: 15: Hoare triple {2773#true} assume 2 == ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2773#true} is VALID [2020-07-17 22:46:18,238 INFO L280 TraceCheckUtils]: 16: Hoare triple {2773#true} assume 0 != #t~nondet4;havoc #t~nondet4; {2773#true} is VALID [2020-07-17 22:46:18,238 INFO L280 TraceCheckUtils]: 17: Hoare triple {2773#true} ~method_id~0 := 1; {2773#true} is VALID [2020-07-17 22:46:18,239 INFO L280 TraceCheckUtils]: 18: Hoare triple {2773#true} assume !false;~q~0 := 3;~this_state~0 := 2; {2778#(= 2 main_~this_state~0)} is VALID [2020-07-17 22:46:18,239 INFO L280 TraceCheckUtils]: 19: Hoare triple {2778#(= 2 main_~this_state~0)} assume !false; {2778#(= 2 main_~this_state~0)} is VALID [2020-07-17 22:46:18,240 INFO L280 TraceCheckUtils]: 20: Hoare triple {2778#(= 2 main_~this_state~0)} assume !(0 == ~q~0); {2778#(= 2 main_~this_state~0)} is VALID [2020-07-17 22:46:18,240 INFO L280 TraceCheckUtils]: 21: Hoare triple {2778#(= 2 main_~this_state~0)} assume !(1 == ~q~0); {2778#(= 2 main_~this_state~0)} is VALID [2020-07-17 22:46:18,241 INFO L280 TraceCheckUtils]: 22: Hoare triple {2778#(= 2 main_~this_state~0)} assume !(2 == ~q~0); {2778#(= 2 main_~this_state~0)} is VALID [2020-07-17 22:46:18,241 INFO L280 TraceCheckUtils]: 23: Hoare triple {2778#(= 2 main_~this_state~0)} assume 3 == ~q~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {2778#(= 2 main_~this_state~0)} is VALID [2020-07-17 22:46:18,242 INFO L280 TraceCheckUtils]: 24: Hoare triple {2778#(= 2 main_~this_state~0)} assume !(0 != #t~nondet9);havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; {2778#(= 2 main_~this_state~0)} is VALID [2020-07-17 22:46:18,242 INFO L280 TraceCheckUtils]: 25: Hoare triple {2778#(= 2 main_~this_state~0)} assume !(0 != #t~nondet10);havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; {2778#(= 2 main_~this_state~0)} is VALID [2020-07-17 22:46:18,243 INFO L280 TraceCheckUtils]: 26: Hoare triple {2778#(= 2 main_~this_state~0)} assume 0 != #t~nondet11;havoc #t~nondet11; {2778#(= 2 main_~this_state~0)} is VALID [2020-07-17 22:46:18,244 INFO L280 TraceCheckUtils]: 27: Hoare triple {2778#(= 2 main_~this_state~0)} ~method_id~0 := 4; {2778#(= 2 main_~this_state~0)} is VALID [2020-07-17 22:46:18,249 INFO L280 TraceCheckUtils]: 28: Hoare triple {2778#(= 2 main_~this_state~0)} assume 2 != ~this_state~0; {2774#false} is VALID [2020-07-17 22:46:18,250 INFO L280 TraceCheckUtils]: 29: Hoare triple {2774#false} assume !false; {2774#false} is VALID [2020-07-17 22:46:18,251 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-17 22:46:18,251 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151157398] [2020-07-17 22:46:18,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:46:18,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:46:18,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638752876] [2020-07-17 22:46:18,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2020-07-17 22:46:18,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:46:18,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:46:18,284 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:46:18,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:46:18,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:46:18,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:46:18,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:46:18,286 INFO L87 Difference]: Start difference. First operand 70 states and 96 transitions. Second operand 4 states. [2020-07-17 22:46:18,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:18,840 INFO L93 Difference]: Finished difference Result 158 states and 228 transitions. [2020-07-17 22:46:18,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:46:18,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2020-07-17 22:46:18,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:46:18,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:46:18,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions. [2020-07-17 22:46:18,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:46:18,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions. [2020-07-17 22:46:18,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 223 transitions. [2020-07-17 22:46:19,189 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:46:19,192 INFO L225 Difference]: With dead ends: 158 [2020-07-17 22:46:19,193 INFO L226 Difference]: Without dead ends: 111 [2020-07-17 22:46:19,193 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-17 22:46:19,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-07-17 22:46:19,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2020-07-17 22:46:19,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:46:19,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand 99 states. [2020-07-17 22:46:19,251 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 99 states. [2020-07-17 22:46:19,251 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 99 states. [2020-07-17 22:46:19,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:19,254 INFO L93 Difference]: Finished difference Result 111 states and 149 transitions. [2020-07-17 22:46:19,255 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 149 transitions. [2020-07-17 22:46:19,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:46:19,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:46:19,255 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 111 states. [2020-07-17 22:46:19,256 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 111 states. [2020-07-17 22:46:19,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:19,259 INFO L93 Difference]: Finished difference Result 111 states and 149 transitions. [2020-07-17 22:46:19,260 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 149 transitions. [2020-07-17 22:46:19,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:46:19,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:46:19,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:46:19,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:46:19,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-07-17 22:46:19,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 138 transitions. [2020-07-17 22:46:19,264 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 138 transitions. Word has length 30 [2020-07-17 22:46:19,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:46:19,264 INFO L479 AbstractCegarLoop]: Abstraction has 99 states and 138 transitions. [2020-07-17 22:46:19,264 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:46:19,265 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 138 transitions. [2020-07-17 22:46:19,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-17 22:46:19,265 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:46:19,265 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] [2020-07-17 22:46:19,266 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-17 22:46:19,266 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:46:19,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:46:19,266 INFO L82 PathProgramCache]: Analyzing trace with hash 180888733, now seen corresponding path program 1 times [2020-07-17 22:46:19,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:46:19,267 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713987399] [2020-07-17 22:46:19,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:46:19,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:46:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:46:19,348 INFO L280 TraceCheckUtils]: 0: Hoare triple {3298#(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;~m_initVerify~0 := 2;~m_Signature~0 := 3;~m_sign~0 := 4;~m_verify~0 := 5;~m_update~0 := 6; {3292#true} is VALID [2020-07-17 22:46:19,349 INFO L280 TraceCheckUtils]: 1: Hoare triple {3292#true} assume true; {3292#true} is VALID [2020-07-17 22:46:19,349 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3292#true} {3292#true} #376#return; {3292#true} is VALID [2020-07-17 22:46:19,350 INFO L263 TraceCheckUtils]: 0: Hoare triple {3292#true} call ULTIMATE.init(); {3298#(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-17 22:46:19,350 INFO L280 TraceCheckUtils]: 1: Hoare triple {3298#(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;~m_initVerify~0 := 2;~m_Signature~0 := 3;~m_sign~0 := 4;~m_verify~0 := 5;~m_update~0 := 6; {3292#true} is VALID [2020-07-17 22:46:19,351 INFO L280 TraceCheckUtils]: 2: Hoare triple {3292#true} assume true; {3292#true} is VALID [2020-07-17 22:46:19,351 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3292#true} {3292#true} #376#return; {3292#true} is VALID [2020-07-17 22:46:19,351 INFO L263 TraceCheckUtils]: 4: Hoare triple {3292#true} call #t~ret21 := main(); {3292#true} is VALID [2020-07-17 22:46:19,351 INFO L280 TraceCheckUtils]: 5: Hoare triple {3292#true} ~q~0 := 0;havoc ~method_id~0;~this_state~0 := 0; {3292#true} is VALID [2020-07-17 22:46:19,352 INFO L280 TraceCheckUtils]: 6: Hoare triple {3292#true} goto; {3292#true} is VALID [2020-07-17 22:46:19,352 INFO L280 TraceCheckUtils]: 7: Hoare triple {3292#true} assume !false; {3292#true} is VALID [2020-07-17 22:46:19,352 INFO L280 TraceCheckUtils]: 8: Hoare triple {3292#true} assume 0 == ~q~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3292#true} is VALID [2020-07-17 22:46:19,352 INFO L280 TraceCheckUtils]: 9: Hoare triple {3292#true} assume 0 != #t~nondet0;havoc #t~nondet0; {3292#true} is VALID [2020-07-17 22:46:19,352 INFO L280 TraceCheckUtils]: 10: Hoare triple {3292#true} ~method_id~0 := 3; {3292#true} is VALID [2020-07-17 22:46:19,353 INFO L280 TraceCheckUtils]: 11: Hoare triple {3292#true} assume !false;~q~0 := 2;~this_state~0 := 0; {3292#true} is VALID [2020-07-17 22:46:19,353 INFO L280 TraceCheckUtils]: 12: Hoare triple {3292#true} assume !false; {3292#true} is VALID [2020-07-17 22:46:19,353 INFO L280 TraceCheckUtils]: 13: Hoare triple {3292#true} assume !(0 == ~q~0); {3292#true} is VALID [2020-07-17 22:46:19,353 INFO L280 TraceCheckUtils]: 14: Hoare triple {3292#true} assume !(1 == ~q~0); {3292#true} is VALID [2020-07-17 22:46:19,353 INFO L280 TraceCheckUtils]: 15: Hoare triple {3292#true} assume 2 == ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {3292#true} is VALID [2020-07-17 22:46:19,354 INFO L280 TraceCheckUtils]: 16: Hoare triple {3292#true} assume !(0 != #t~nondet4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3292#true} is VALID [2020-07-17 22:46:19,354 INFO L280 TraceCheckUtils]: 17: Hoare triple {3292#true} assume 0 != #t~nondet5;havoc #t~nondet5; {3292#true} is VALID [2020-07-17 22:46:19,354 INFO L280 TraceCheckUtils]: 18: Hoare triple {3292#true} ~method_id~0 := 2; {3292#true} is VALID [2020-07-17 22:46:19,355 INFO L280 TraceCheckUtils]: 19: Hoare triple {3292#true} assume !false;~q~0 := 4;~this_state~0 := 3; {3297#(<= 4 main_~q~0)} is VALID [2020-07-17 22:46:19,356 INFO L280 TraceCheckUtils]: 20: Hoare triple {3297#(<= 4 main_~q~0)} assume !false; {3297#(<= 4 main_~q~0)} is VALID [2020-07-17 22:46:19,357 INFO L280 TraceCheckUtils]: 21: Hoare triple {3297#(<= 4 main_~q~0)} assume !(0 == ~q~0); {3297#(<= 4 main_~q~0)} is VALID [2020-07-17 22:46:19,357 INFO L280 TraceCheckUtils]: 22: Hoare triple {3297#(<= 4 main_~q~0)} assume !(1 == ~q~0); {3297#(<= 4 main_~q~0)} is VALID [2020-07-17 22:46:19,358 INFO L280 TraceCheckUtils]: 23: Hoare triple {3297#(<= 4 main_~q~0)} assume !(2 == ~q~0); {3297#(<= 4 main_~q~0)} is VALID [2020-07-17 22:46:19,359 INFO L280 TraceCheckUtils]: 24: Hoare triple {3297#(<= 4 main_~q~0)} assume 3 == ~q~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {3293#false} is VALID [2020-07-17 22:46:19,359 INFO L280 TraceCheckUtils]: 25: Hoare triple {3293#false} assume !(0 != #t~nondet9);havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; {3293#false} is VALID [2020-07-17 22:46:19,359 INFO L280 TraceCheckUtils]: 26: Hoare triple {3293#false} assume !(0 != #t~nondet10);havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; {3293#false} is VALID [2020-07-17 22:46:19,360 INFO L280 TraceCheckUtils]: 27: Hoare triple {3293#false} assume 0 != #t~nondet11;havoc #t~nondet11; {3293#false} is VALID [2020-07-17 22:46:19,360 INFO L280 TraceCheckUtils]: 28: Hoare triple {3293#false} ~method_id~0 := 4; {3293#false} is VALID [2020-07-17 22:46:19,360 INFO L280 TraceCheckUtils]: 29: Hoare triple {3293#false} assume 2 != ~this_state~0; {3293#false} is VALID [2020-07-17 22:46:19,360 INFO L280 TraceCheckUtils]: 30: Hoare triple {3293#false} assume !false; {3293#false} is VALID [2020-07-17 22:46:19,362 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-17 22:46:19,362 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713987399] [2020-07-17 22:46:19,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:46:19,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:46:19,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567104359] [2020-07-17 22:46:19,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2020-07-17 22:46:19,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:46:19,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:46:19,392 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:46:19,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:46:19,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:46:19,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:46:19,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:46:19,393 INFO L87 Difference]: Start difference. First operand 99 states and 138 transitions. Second operand 4 states. [2020-07-17 22:46:19,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:19,774 INFO L93 Difference]: Finished difference Result 166 states and 232 transitions. [2020-07-17 22:46:19,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:46:19,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2020-07-17 22:46:19,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:46:19,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:46:19,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2020-07-17 22:46:19,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:46:19,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2020-07-17 22:46:19,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 159 transitions. [2020-07-17 22:46:19,992 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:46:19,994 INFO L225 Difference]: With dead ends: 166 [2020-07-17 22:46:19,994 INFO L226 Difference]: Without dead ends: 92 [2020-07-17 22:46:19,995 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-17 22:46:19,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-07-17 22:46:20,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-07-17 22:46:20,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:46:20,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 92 states. [2020-07-17 22:46:20,058 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 92 states. [2020-07-17 22:46:20,058 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 92 states. [2020-07-17 22:46:20,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:20,062 INFO L93 Difference]: Finished difference Result 92 states and 120 transitions. [2020-07-17 22:46:20,063 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 120 transitions. [2020-07-17 22:46:20,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:46:20,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:46:20,063 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 92 states. [2020-07-17 22:46:20,063 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 92 states. [2020-07-17 22:46:20,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:20,067 INFO L93 Difference]: Finished difference Result 92 states and 120 transitions. [2020-07-17 22:46:20,067 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 120 transitions. [2020-07-17 22:46:20,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:46:20,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:46:20,068 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:46:20,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:46:20,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-07-17 22:46:20,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 120 transitions. [2020-07-17 22:46:20,071 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 120 transitions. Word has length 31 [2020-07-17 22:46:20,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:46:20,071 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 120 transitions. [2020-07-17 22:46:20,072 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:46:20,072 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 120 transitions. [2020-07-17 22:46:20,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-17 22:46:20,072 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:46:20,073 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] [2020-07-17 22:46:20,073 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-17 22:46:20,073 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:46:20,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:46:20,073 INFO L82 PathProgramCache]: Analyzing trace with hash 317242888, now seen corresponding path program 1 times [2020-07-17 22:46:20,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:46:20,074 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896042115] [2020-07-17 22:46:20,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:46:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:46:20,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:46:20,141 INFO L280 TraceCheckUtils]: 0: Hoare triple {3785#(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;~m_initVerify~0 := 2;~m_Signature~0 := 3;~m_sign~0 := 4;~m_verify~0 := 5;~m_update~0 := 6; {3779#true} is VALID [2020-07-17 22:46:20,141 INFO L280 TraceCheckUtils]: 1: Hoare triple {3779#true} assume true; {3779#true} is VALID [2020-07-17 22:46:20,141 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3779#true} {3779#true} #376#return; {3779#true} is VALID [2020-07-17 22:46:20,142 INFO L263 TraceCheckUtils]: 0: Hoare triple {3779#true} call ULTIMATE.init(); {3785#(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-17 22:46:20,142 INFO L280 TraceCheckUtils]: 1: Hoare triple {3785#(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;~m_initVerify~0 := 2;~m_Signature~0 := 3;~m_sign~0 := 4;~m_verify~0 := 5;~m_update~0 := 6; {3779#true} is VALID [2020-07-17 22:46:20,142 INFO L280 TraceCheckUtils]: 2: Hoare triple {3779#true} assume true; {3779#true} is VALID [2020-07-17 22:46:20,142 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3779#true} {3779#true} #376#return; {3779#true} is VALID [2020-07-17 22:46:20,143 INFO L263 TraceCheckUtils]: 4: Hoare triple {3779#true} call #t~ret21 := main(); {3779#true} is VALID [2020-07-17 22:46:20,143 INFO L280 TraceCheckUtils]: 5: Hoare triple {3779#true} ~q~0 := 0;havoc ~method_id~0;~this_state~0 := 0; {3779#true} is VALID [2020-07-17 22:46:20,143 INFO L280 TraceCheckUtils]: 6: Hoare triple {3779#true} goto; {3779#true} is VALID [2020-07-17 22:46:20,143 INFO L280 TraceCheckUtils]: 7: Hoare triple {3779#true} assume !false; {3779#true} is VALID [2020-07-17 22:46:20,143 INFO L280 TraceCheckUtils]: 8: Hoare triple {3779#true} assume 0 == ~q~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3779#true} is VALID [2020-07-17 22:46:20,143 INFO L280 TraceCheckUtils]: 9: Hoare triple {3779#true} assume 0 != #t~nondet0;havoc #t~nondet0; {3779#true} is VALID [2020-07-17 22:46:20,144 INFO L280 TraceCheckUtils]: 10: Hoare triple {3779#true} ~method_id~0 := 3; {3779#true} is VALID [2020-07-17 22:46:20,144 INFO L280 TraceCheckUtils]: 11: Hoare triple {3779#true} assume !false;~q~0 := 2;~this_state~0 := 0; {3779#true} is VALID [2020-07-17 22:46:20,144 INFO L280 TraceCheckUtils]: 12: Hoare triple {3779#true} assume !false; {3779#true} is VALID [2020-07-17 22:46:20,144 INFO L280 TraceCheckUtils]: 13: Hoare triple {3779#true} assume !(0 == ~q~0); {3779#true} is VALID [2020-07-17 22:46:20,144 INFO L280 TraceCheckUtils]: 14: Hoare triple {3779#true} assume !(1 == ~q~0); {3779#true} is VALID [2020-07-17 22:46:20,144 INFO L280 TraceCheckUtils]: 15: Hoare triple {3779#true} assume 2 == ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {3779#true} is VALID [2020-07-17 22:46:20,145 INFO L280 TraceCheckUtils]: 16: Hoare triple {3779#true} assume 0 != #t~nondet4;havoc #t~nondet4; {3779#true} is VALID [2020-07-17 22:46:20,145 INFO L280 TraceCheckUtils]: 17: Hoare triple {3779#true} ~method_id~0 := 1; {3779#true} is VALID [2020-07-17 22:46:20,145 INFO L280 TraceCheckUtils]: 18: Hoare triple {3779#true} assume !false;~q~0 := 3;~this_state~0 := 2; {3784#(= 3 main_~q~0)} is VALID [2020-07-17 22:46:20,146 INFO L280 TraceCheckUtils]: 19: Hoare triple {3784#(= 3 main_~q~0)} assume !false; {3784#(= 3 main_~q~0)} is VALID [2020-07-17 22:46:20,146 INFO L280 TraceCheckUtils]: 20: Hoare triple {3784#(= 3 main_~q~0)} assume !(0 == ~q~0); {3784#(= 3 main_~q~0)} is VALID [2020-07-17 22:46:20,147 INFO L280 TraceCheckUtils]: 21: Hoare triple {3784#(= 3 main_~q~0)} assume !(1 == ~q~0); {3784#(= 3 main_~q~0)} is VALID [2020-07-17 22:46:20,147 INFO L280 TraceCheckUtils]: 22: Hoare triple {3784#(= 3 main_~q~0)} assume !(2 == ~q~0); {3784#(= 3 main_~q~0)} is VALID [2020-07-17 22:46:20,148 INFO L280 TraceCheckUtils]: 23: Hoare triple {3784#(= 3 main_~q~0)} assume !(3 == ~q~0); {3780#false} is VALID [2020-07-17 22:46:20,148 INFO L280 TraceCheckUtils]: 24: Hoare triple {3780#false} assume 4 == ~q~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647; {3780#false} is VALID [2020-07-17 22:46:20,148 INFO L280 TraceCheckUtils]: 25: Hoare triple {3780#false} assume !(0 != #t~nondet15);havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; {3780#false} is VALID [2020-07-17 22:46:20,148 INFO L280 TraceCheckUtils]: 26: Hoare triple {3780#false} assume !(0 != #t~nondet16);havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647; {3780#false} is VALID [2020-07-17 22:46:20,148 INFO L280 TraceCheckUtils]: 27: Hoare triple {3780#false} assume 0 != #t~nondet17;havoc #t~nondet17; {3780#false} is VALID [2020-07-17 22:46:20,149 INFO L280 TraceCheckUtils]: 28: Hoare triple {3780#false} ~method_id~0 := 4; {3780#false} is VALID [2020-07-17 22:46:20,149 INFO L280 TraceCheckUtils]: 29: Hoare triple {3780#false} assume 2 == ~this_state~0; {3780#false} is VALID [2020-07-17 22:46:20,149 INFO L280 TraceCheckUtils]: 30: Hoare triple {3780#false} assume !false; {3780#false} is VALID [2020-07-17 22:46:20,150 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-17 22:46:20,150 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896042115] [2020-07-17 22:46:20,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:46:20,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:46:20,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617974192] [2020-07-17 22:46:20,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2020-07-17 22:46:20,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:46:20,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:46:20,184 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:46:20,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:46:20,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:46:20,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:46:20,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:46:20,186 INFO L87 Difference]: Start difference. First operand 92 states and 120 transitions. Second operand 4 states. [2020-07-17 22:46:20,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:20,536 INFO L93 Difference]: Finished difference Result 139 states and 184 transitions. [2020-07-17 22:46:20,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:46:20,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2020-07-17 22:46:20,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:46:20,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:46:20,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2020-07-17 22:46:20,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:46:20,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2020-07-17 22:46:20,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 146 transitions. [2020-07-17 22:46:20,721 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:46:20,723 INFO L225 Difference]: With dead ends: 139 [2020-07-17 22:46:20,723 INFO L226 Difference]: Without dead ends: 72 [2020-07-17 22:46:20,724 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-17 22:46:20,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-07-17 22:46:20,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-07-17 22:46:20,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:46:20,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 72 states. [2020-07-17 22:46:20,763 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2020-07-17 22:46:20,763 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2020-07-17 22:46:20,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:20,765 INFO L93 Difference]: Finished difference Result 72 states and 91 transitions. [2020-07-17 22:46:20,765 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2020-07-17 22:46:20,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:46:20,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:46:20,766 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2020-07-17 22:46:20,766 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2020-07-17 22:46:20,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:20,768 INFO L93 Difference]: Finished difference Result 72 states and 91 transitions. [2020-07-17 22:46:20,768 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2020-07-17 22:46:20,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:46:20,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:46:20,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:46:20,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:46:20,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-07-17 22:46:20,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 91 transitions. [2020-07-17 22:46:20,771 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 91 transitions. Word has length 31 [2020-07-17 22:46:20,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:46:20,771 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 91 transitions. [2020-07-17 22:46:20,771 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:46:20,772 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2020-07-17 22:46:20,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-17 22:46:20,772 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:46:20,773 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] [2020-07-17 22:46:20,773 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-17 22:46:20,773 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:46:20,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:46:20,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1695196396, now seen corresponding path program 1 times [2020-07-17 22:46:20,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:46:20,774 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515650012] [2020-07-17 22:46:20,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:46:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:46:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:46:20,831 INFO L280 TraceCheckUtils]: 0: Hoare triple {4181#(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;~m_initVerify~0 := 2;~m_Signature~0 := 3;~m_sign~0 := 4;~m_verify~0 := 5;~m_update~0 := 6; {4175#true} is VALID [2020-07-17 22:46:20,832 INFO L280 TraceCheckUtils]: 1: Hoare triple {4175#true} assume true; {4175#true} is VALID [2020-07-17 22:46:20,832 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4175#true} {4175#true} #376#return; {4175#true} is VALID [2020-07-17 22:46:20,833 INFO L263 TraceCheckUtils]: 0: Hoare triple {4175#true} call ULTIMATE.init(); {4181#(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-17 22:46:20,833 INFO L280 TraceCheckUtils]: 1: Hoare triple {4181#(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;~m_initVerify~0 := 2;~m_Signature~0 := 3;~m_sign~0 := 4;~m_verify~0 := 5;~m_update~0 := 6; {4175#true} is VALID [2020-07-17 22:46:20,833 INFO L280 TraceCheckUtils]: 2: Hoare triple {4175#true} assume true; {4175#true} is VALID [2020-07-17 22:46:20,833 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4175#true} {4175#true} #376#return; {4175#true} is VALID [2020-07-17 22:46:20,833 INFO L263 TraceCheckUtils]: 4: Hoare triple {4175#true} call #t~ret21 := main(); {4175#true} is VALID [2020-07-17 22:46:20,833 INFO L280 TraceCheckUtils]: 5: Hoare triple {4175#true} ~q~0 := 0;havoc ~method_id~0;~this_state~0 := 0; {4175#true} is VALID [2020-07-17 22:46:20,834 INFO L280 TraceCheckUtils]: 6: Hoare triple {4175#true} goto; {4175#true} is VALID [2020-07-17 22:46:20,834 INFO L280 TraceCheckUtils]: 7: Hoare triple {4175#true} assume !false; {4175#true} is VALID [2020-07-17 22:46:20,834 INFO L280 TraceCheckUtils]: 8: Hoare triple {4175#true} assume 0 == ~q~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {4175#true} is VALID [2020-07-17 22:46:20,834 INFO L280 TraceCheckUtils]: 9: Hoare triple {4175#true} assume 0 != #t~nondet0;havoc #t~nondet0; {4175#true} is VALID [2020-07-17 22:46:20,835 INFO L280 TraceCheckUtils]: 10: Hoare triple {4175#true} ~method_id~0 := 3; {4175#true} is VALID [2020-07-17 22:46:20,835 INFO L280 TraceCheckUtils]: 11: Hoare triple {4175#true} assume !false;~q~0 := 2;~this_state~0 := 0; {4175#true} is VALID [2020-07-17 22:46:20,835 INFO L280 TraceCheckUtils]: 12: Hoare triple {4175#true} assume !false; {4175#true} is VALID [2020-07-17 22:46:20,835 INFO L280 TraceCheckUtils]: 13: Hoare triple {4175#true} assume !(0 == ~q~0); {4175#true} is VALID [2020-07-17 22:46:20,835 INFO L280 TraceCheckUtils]: 14: Hoare triple {4175#true} assume !(1 == ~q~0); {4175#true} is VALID [2020-07-17 22:46:20,836 INFO L280 TraceCheckUtils]: 15: Hoare triple {4175#true} assume 2 == ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {4175#true} is VALID [2020-07-17 22:46:20,836 INFO L280 TraceCheckUtils]: 16: Hoare triple {4175#true} assume !(0 != #t~nondet4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {4175#true} is VALID [2020-07-17 22:46:20,836 INFO L280 TraceCheckUtils]: 17: Hoare triple {4175#true} assume 0 != #t~nondet5;havoc #t~nondet5; {4175#true} is VALID [2020-07-17 22:46:20,836 INFO L280 TraceCheckUtils]: 18: Hoare triple {4175#true} ~method_id~0 := 2; {4175#true} is VALID [2020-07-17 22:46:20,839 INFO L280 TraceCheckUtils]: 19: Hoare triple {4175#true} assume !false;~q~0 := 4;~this_state~0 := 3; {4180#(<= 3 main_~this_state~0)} is VALID [2020-07-17 22:46:20,840 INFO L280 TraceCheckUtils]: 20: Hoare triple {4180#(<= 3 main_~this_state~0)} assume !false; {4180#(<= 3 main_~this_state~0)} is VALID [2020-07-17 22:46:20,840 INFO L280 TraceCheckUtils]: 21: Hoare triple {4180#(<= 3 main_~this_state~0)} assume !(0 == ~q~0); {4180#(<= 3 main_~this_state~0)} is VALID [2020-07-17 22:46:20,840 INFO L280 TraceCheckUtils]: 22: Hoare triple {4180#(<= 3 main_~this_state~0)} assume !(1 == ~q~0); {4180#(<= 3 main_~this_state~0)} is VALID [2020-07-17 22:46:20,841 INFO L280 TraceCheckUtils]: 23: Hoare triple {4180#(<= 3 main_~this_state~0)} assume !(2 == ~q~0); {4180#(<= 3 main_~this_state~0)} is VALID [2020-07-17 22:46:20,841 INFO L280 TraceCheckUtils]: 24: Hoare triple {4180#(<= 3 main_~this_state~0)} assume !(3 == ~q~0); {4180#(<= 3 main_~this_state~0)} is VALID [2020-07-17 22:46:20,842 INFO L280 TraceCheckUtils]: 25: Hoare triple {4180#(<= 3 main_~this_state~0)} assume 4 == ~q~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647; {4180#(<= 3 main_~this_state~0)} is VALID [2020-07-17 22:46:20,842 INFO L280 TraceCheckUtils]: 26: Hoare triple {4180#(<= 3 main_~this_state~0)} assume !(0 != #t~nondet15);havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; {4180#(<= 3 main_~this_state~0)} is VALID [2020-07-17 22:46:20,843 INFO L280 TraceCheckUtils]: 27: Hoare triple {4180#(<= 3 main_~this_state~0)} assume !(0 != #t~nondet16);havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647; {4180#(<= 3 main_~this_state~0)} is VALID [2020-07-17 22:46:20,843 INFO L280 TraceCheckUtils]: 28: Hoare triple {4180#(<= 3 main_~this_state~0)} assume 0 != #t~nondet17;havoc #t~nondet17; {4180#(<= 3 main_~this_state~0)} is VALID [2020-07-17 22:46:20,844 INFO L280 TraceCheckUtils]: 29: Hoare triple {4180#(<= 3 main_~this_state~0)} ~method_id~0 := 4; {4180#(<= 3 main_~this_state~0)} is VALID [2020-07-17 22:46:20,851 INFO L280 TraceCheckUtils]: 30: Hoare triple {4180#(<= 3 main_~this_state~0)} assume 2 == ~this_state~0; {4176#false} is VALID [2020-07-17 22:46:20,851 INFO L280 TraceCheckUtils]: 31: Hoare triple {4176#false} assume !false; {4176#false} is VALID [2020-07-17 22:46:20,852 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-17 22:46:20,853 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515650012] [2020-07-17 22:46:20,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:46:20,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:46:20,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913837980] [2020-07-17 22:46:20,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2020-07-17 22:46:20,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:46:20,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:46:20,885 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:46:20,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:46:20,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:46:20,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:46:20,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:46:20,886 INFO L87 Difference]: Start difference. First operand 72 states and 91 transitions. Second operand 4 states. [2020-07-17 22:46:21,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:21,219 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2020-07-17 22:46:21,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:46:21,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2020-07-17 22:46:21,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:46:21,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:46:21,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2020-07-17 22:46:21,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:46:21,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2020-07-17 22:46:21,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 88 transitions. [2020-07-17 22:46:21,350 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:46:21,352 INFO L225 Difference]: With dead ends: 74 [2020-07-17 22:46:21,352 INFO L226 Difference]: Without dead ends: 70 [2020-07-17 22:46:21,352 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-17 22:46:21,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-17 22:46:21,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-07-17 22:46:21,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:46:21,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 70 states. [2020-07-17 22:46:21,397 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2020-07-17 22:46:21,398 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2020-07-17 22:46:21,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:21,400 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2020-07-17 22:46:21,400 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2020-07-17 22:46:21,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:46:21,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:46:21,400 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2020-07-17 22:46:21,401 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2020-07-17 22:46:21,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:21,402 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2020-07-17 22:46:21,402 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2020-07-17 22:46:21,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:46:21,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:46:21,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:46:21,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:46:21,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-17 22:46:21,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2020-07-17 22:46:21,405 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 32 [2020-07-17 22:46:21,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:46:21,405 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2020-07-17 22:46:21,405 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:46:21,406 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2020-07-17 22:46:21,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-17 22:46:21,406 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:46:21,407 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] [2020-07-17 22:46:21,409 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-17 22:46:21,410 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:46:21,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:46:21,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1000030502, now seen corresponding path program 1 times [2020-07-17 22:46:21,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:46:21,411 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3398187] [2020-07-17 22:46:21,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:46:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:46:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:46:21,512 INFO L280 TraceCheckUtils]: 0: Hoare triple {4500#(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;~m_initVerify~0 := 2;~m_Signature~0 := 3;~m_sign~0 := 4;~m_verify~0 := 5;~m_update~0 := 6; {4494#true} is VALID [2020-07-17 22:46:21,513 INFO L280 TraceCheckUtils]: 1: Hoare triple {4494#true} assume true; {4494#true} is VALID [2020-07-17 22:46:21,513 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4494#true} {4494#true} #376#return; {4494#true} is VALID [2020-07-17 22:46:21,514 INFO L263 TraceCheckUtils]: 0: Hoare triple {4494#true} call ULTIMATE.init(); {4500#(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-17 22:46:21,514 INFO L280 TraceCheckUtils]: 1: Hoare triple {4500#(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;~m_initVerify~0 := 2;~m_Signature~0 := 3;~m_sign~0 := 4;~m_verify~0 := 5;~m_update~0 := 6; {4494#true} is VALID [2020-07-17 22:46:21,514 INFO L280 TraceCheckUtils]: 2: Hoare triple {4494#true} assume true; {4494#true} is VALID [2020-07-17 22:46:21,515 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4494#true} {4494#true} #376#return; {4494#true} is VALID [2020-07-17 22:46:21,515 INFO L263 TraceCheckUtils]: 4: Hoare triple {4494#true} call #t~ret21 := main(); {4494#true} is VALID [2020-07-17 22:46:21,515 INFO L280 TraceCheckUtils]: 5: Hoare triple {4494#true} ~q~0 := 0;havoc ~method_id~0;~this_state~0 := 0; {4494#true} is VALID [2020-07-17 22:46:21,515 INFO L280 TraceCheckUtils]: 6: Hoare triple {4494#true} goto; {4494#true} is VALID [2020-07-17 22:46:21,515 INFO L280 TraceCheckUtils]: 7: Hoare triple {4494#true} assume !false; {4494#true} is VALID [2020-07-17 22:46:21,515 INFO L280 TraceCheckUtils]: 8: Hoare triple {4494#true} assume 0 == ~q~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {4494#true} is VALID [2020-07-17 22:46:21,516 INFO L280 TraceCheckUtils]: 9: Hoare triple {4494#true} assume 0 != #t~nondet0;havoc #t~nondet0; {4494#true} is VALID [2020-07-17 22:46:21,516 INFO L280 TraceCheckUtils]: 10: Hoare triple {4494#true} ~method_id~0 := 3; {4494#true} is VALID [2020-07-17 22:46:21,516 INFO L280 TraceCheckUtils]: 11: Hoare triple {4494#true} assume !false;~q~0 := 2;~this_state~0 := 0; {4494#true} is VALID [2020-07-17 22:46:21,516 INFO L280 TraceCheckUtils]: 12: Hoare triple {4494#true} assume !false; {4494#true} is VALID [2020-07-17 22:46:21,516 INFO L280 TraceCheckUtils]: 13: Hoare triple {4494#true} assume !(0 == ~q~0); {4494#true} is VALID [2020-07-17 22:46:21,516 INFO L280 TraceCheckUtils]: 14: Hoare triple {4494#true} assume !(1 == ~q~0); {4494#true} is VALID [2020-07-17 22:46:21,517 INFO L280 TraceCheckUtils]: 15: Hoare triple {4494#true} assume 2 == ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {4494#true} is VALID [2020-07-17 22:46:21,517 INFO L280 TraceCheckUtils]: 16: Hoare triple {4494#true} assume !(0 != #t~nondet4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {4494#true} is VALID [2020-07-17 22:46:21,517 INFO L280 TraceCheckUtils]: 17: Hoare triple {4494#true} assume 0 != #t~nondet5;havoc #t~nondet5; {4494#true} is VALID [2020-07-17 22:46:21,517 INFO L280 TraceCheckUtils]: 18: Hoare triple {4494#true} ~method_id~0 := 2; {4494#true} is VALID [2020-07-17 22:46:21,518 INFO L280 TraceCheckUtils]: 19: Hoare triple {4494#true} assume !false;~q~0 := 4;~this_state~0 := 3; {4499#(= 3 main_~this_state~0)} is VALID [2020-07-17 22:46:21,519 INFO L280 TraceCheckUtils]: 20: Hoare triple {4499#(= 3 main_~this_state~0)} assume !false; {4499#(= 3 main_~this_state~0)} is VALID [2020-07-17 22:46:21,519 INFO L280 TraceCheckUtils]: 21: Hoare triple {4499#(= 3 main_~this_state~0)} assume !(0 == ~q~0); {4499#(= 3 main_~this_state~0)} is VALID [2020-07-17 22:46:21,520 INFO L280 TraceCheckUtils]: 22: Hoare triple {4499#(= 3 main_~this_state~0)} assume !(1 == ~q~0); {4499#(= 3 main_~this_state~0)} is VALID [2020-07-17 22:46:21,521 INFO L280 TraceCheckUtils]: 23: Hoare triple {4499#(= 3 main_~this_state~0)} assume !(2 == ~q~0); {4499#(= 3 main_~this_state~0)} is VALID [2020-07-17 22:46:21,521 INFO L280 TraceCheckUtils]: 24: Hoare triple {4499#(= 3 main_~this_state~0)} assume !(3 == ~q~0); {4499#(= 3 main_~this_state~0)} is VALID [2020-07-17 22:46:21,522 INFO L280 TraceCheckUtils]: 25: Hoare triple {4499#(= 3 main_~this_state~0)} assume 4 == ~q~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647; {4499#(= 3 main_~this_state~0)} is VALID [2020-07-17 22:46:21,522 INFO L280 TraceCheckUtils]: 26: Hoare triple {4499#(= 3 main_~this_state~0)} assume !(0 != #t~nondet15);havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; {4499#(= 3 main_~this_state~0)} is VALID [2020-07-17 22:46:21,523 INFO L280 TraceCheckUtils]: 27: Hoare triple {4499#(= 3 main_~this_state~0)} assume !(0 != #t~nondet16);havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647; {4499#(= 3 main_~this_state~0)} is VALID [2020-07-17 22:46:21,524 INFO L280 TraceCheckUtils]: 28: Hoare triple {4499#(= 3 main_~this_state~0)} assume !(0 != #t~nondet17);havoc #t~nondet17;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647; {4499#(= 3 main_~this_state~0)} is VALID [2020-07-17 22:46:21,524 INFO L280 TraceCheckUtils]: 29: Hoare triple {4499#(= 3 main_~this_state~0)} assume 0 != #t~nondet18;havoc #t~nondet18; {4499#(= 3 main_~this_state~0)} is VALID [2020-07-17 22:46:21,525 INFO L280 TraceCheckUtils]: 30: Hoare triple {4499#(= 3 main_~this_state~0)} ~method_id~0 := 5; {4499#(= 3 main_~this_state~0)} is VALID [2020-07-17 22:46:21,526 INFO L280 TraceCheckUtils]: 31: Hoare triple {4499#(= 3 main_~this_state~0)} assume 3 != ~this_state~0; {4495#false} is VALID [2020-07-17 22:46:21,526 INFO L280 TraceCheckUtils]: 32: Hoare triple {4495#false} assume !false; {4495#false} is VALID [2020-07-17 22:46:21,528 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-17 22:46:21,528 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3398187] [2020-07-17 22:46:21,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:46:21,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:46:21,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530782266] [2020-07-17 22:46:21,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-07-17 22:46:21,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:46:21,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:46:21,570 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-17 22:46:21,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:46:21,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:46:21,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:46:21,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:46:21,572 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand 4 states. [2020-07-17 22:46:21,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:21,891 INFO L93 Difference]: Finished difference Result 111 states and 143 transitions. [2020-07-17 22:46:21,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:46:21,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-07-17 22:46:21,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:46:21,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:46:21,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2020-07-17 22:46:21,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:46:21,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2020-07-17 22:46:21,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 135 transitions. [2020-07-17 22:46:22,060 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:46:22,061 INFO L225 Difference]: With dead ends: 111 [2020-07-17 22:46:22,061 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:46:22,062 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-17 22:46:22,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:46:22,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:46:22,062 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:46:22,062 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:46:22,062 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:46:22,063 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:46:22,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:22,063 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:46:22,063 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:46:22,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:46:22,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:46:22,064 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:46:22,064 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:46:22,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:22,064 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:46:22,064 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:46:22,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:46:22,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:46:22,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:46:22,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:46:22,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:46:22,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:46:22,067 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2020-07-17 22:46:22,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:46:22,068 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:46:22,068 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:46:22,068 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:46:22,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:46:22,068 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-17 22:46:22,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:46:22,308 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:46:22,308 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-17 22:46:22,308 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:46:22,309 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:46:22,309 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:46:22,309 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:46:22,309 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:46:22,309 INFO L268 CegarLoopResult]: For program point L316(lines 316 331) no Hoare annotation was computed. [2020-07-17 22:46:22,309 INFO L268 CegarLoopResult]: For program point L283(lines 283 382) no Hoare annotation was computed. [2020-07-17 22:46:22,310 INFO L268 CegarLoopResult]: For program point L250(lines 250 261) no Hoare annotation was computed. [2020-07-17 22:46:22,310 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 13 390) no Hoare annotation was computed. [2020-07-17 22:46:22,310 INFO L268 CegarLoopResult]: For program point L184(lines 184 199) no Hoare annotation was computed. [2020-07-17 22:46:22,310 INFO L268 CegarLoopResult]: For program point L118(lines 118 129) no Hoare annotation was computed. [2020-07-17 22:46:22,310 INFO L268 CegarLoopResult]: For program point L366(lines 366 377) no Hoare annotation was computed. [2020-07-17 22:46:22,310 INFO L268 CegarLoopResult]: For program point L300(lines 300 315) no Hoare annotation was computed. [2020-07-17 22:46:22,310 INFO L268 CegarLoopResult]: For program point L234(lines 234 245) no Hoare annotation was computed. [2020-07-17 22:46:22,310 INFO L268 CegarLoopResult]: For program point L102(lines 102 113) no Hoare annotation was computed. [2020-07-17 22:46:22,311 INFO L268 CegarLoopResult]: For program point L350(lines 350 361) no Hoare annotation was computed. [2020-07-17 22:46:22,311 INFO L268 CegarLoopResult]: For program point L284(lines 284 299) no Hoare annotation was computed. [2020-07-17 22:46:22,311 INFO L268 CegarLoopResult]: For program point L218(lines 218 229) no Hoare annotation was computed. [2020-07-17 22:46:22,311 INFO L268 CegarLoopResult]: For program point L86(lines 86 88) no Hoare annotation was computed. [2020-07-17 22:46:22,311 INFO L268 CegarLoopResult]: For program point L334(lines 334 345) no Hoare annotation was computed. [2020-07-17 22:46:22,311 INFO L268 CegarLoopResult]: For program point L202(lines 202 213) no Hoare annotation was computed. [2020-07-17 22:46:22,311 INFO L268 CegarLoopResult]: For program point L70(lines 70 72) no Hoare annotation was computed. [2020-07-17 22:46:22,311 INFO L268 CegarLoopResult]: For program point L318(lines 318 329) no Hoare annotation was computed. [2020-07-17 22:46:22,311 INFO L268 CegarLoopResult]: For program point L186(lines 186 197) no Hoare annotation was computed. [2020-07-17 22:46:22,312 INFO L268 CegarLoopResult]: For program point L54(lines 54 56) no Hoare annotation was computed. [2020-07-17 22:46:22,312 INFO L268 CegarLoopResult]: For program point L302(lines 302 313) no Hoare annotation was computed. [2020-07-17 22:46:22,312 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 13 390) no Hoare annotation was computed. [2020-07-17 22:46:22,312 INFO L268 CegarLoopResult]: For program point L170(lines 170 172) no Hoare annotation was computed. [2020-07-17 22:46:22,313 INFO L268 CegarLoopResult]: For program point L286(lines 286 297) no Hoare annotation was computed. [2020-07-17 22:46:22,313 INFO L268 CegarLoopResult]: For program point L154(lines 154 156) no Hoare annotation was computed. [2020-07-17 22:46:22,314 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-17 22:46:22,314 INFO L268 CegarLoopResult]: For program point L22-3(lines 22 385) no Hoare annotation was computed. [2020-07-17 22:46:22,314 INFO L268 CegarLoopResult]: For program point L270(lines 270 272) no Hoare annotation was computed. [2020-07-17 22:46:22,314 INFO L268 CegarLoopResult]: For program point L138(lines 138 140) no Hoare annotation was computed. [2020-07-17 22:46:22,314 INFO L268 CegarLoopResult]: For program point L254(lines 254 256) no Hoare annotation was computed. [2020-07-17 22:46:22,314 INFO L268 CegarLoopResult]: For program point L122(lines 122 124) no Hoare annotation was computed. [2020-07-17 22:46:22,314 INFO L268 CegarLoopResult]: For program point L370(lines 370 372) no Hoare annotation was computed. [2020-07-17 22:46:22,314 INFO L268 CegarLoopResult]: For program point L238(lines 238 240) no Hoare annotation was computed. [2020-07-17 22:46:22,315 INFO L268 CegarLoopResult]: For program point L106(lines 106 108) no Hoare annotation was computed. [2020-07-17 22:46:22,315 INFO L268 CegarLoopResult]: For program point L354(lines 354 356) no Hoare annotation was computed. [2020-07-17 22:46:22,315 INFO L268 CegarLoopResult]: For program point L222(lines 222 224) no Hoare annotation was computed. [2020-07-17 22:46:22,315 INFO L264 CegarLoopResult]: At program point L371(lines 13 390) the Hoare annotation is: false [2020-07-17 22:46:22,315 INFO L268 CegarLoopResult]: For program point L338(lines 338 340) no Hoare annotation was computed. [2020-07-17 22:46:22,315 INFO L268 CegarLoopResult]: For program point L206(lines 206 208) no Hoare annotation was computed. [2020-07-17 22:46:22,315 INFO L268 CegarLoopResult]: For program point L322(lines 322 324) no Hoare annotation was computed. [2020-07-17 22:46:22,316 INFO L268 CegarLoopResult]: For program point L190(lines 190 192) no Hoare annotation was computed. [2020-07-17 22:46:22,316 INFO L268 CegarLoopResult]: For program point L306(lines 306 308) no Hoare annotation was computed. [2020-07-17 22:46:22,316 INFO L268 CegarLoopResult]: For program point L290(lines 290 292) no Hoare annotation was computed. [2020-07-17 22:46:22,316 INFO L268 CegarLoopResult]: For program point L27(lines 27 46) no Hoare annotation was computed. [2020-07-17 22:46:22,317 INFO L268 CegarLoopResult]: For program point L28(lines 28 43) no Hoare annotation was computed. [2020-07-17 22:46:22,317 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 389) no Hoare annotation was computed. [2020-07-17 22:46:22,317 INFO L268 CegarLoopResult]: For program point L30(lines 30 41) no Hoare annotation was computed. [2020-07-17 22:46:22,317 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 390) the Hoare annotation is: true [2020-07-17 22:46:22,317 INFO L268 CegarLoopResult]: For program point L80(lines 80 95) no Hoare annotation was computed. [2020-07-17 22:46:22,318 INFO L268 CegarLoopResult]: For program point L47(lines 47 98) no Hoare annotation was computed. [2020-07-17 22:46:22,318 INFO L268 CegarLoopResult]: For program point L64(lines 64 79) no Hoare annotation was computed. [2020-07-17 22:46:22,318 INFO L268 CegarLoopResult]: For program point L48(lines 48 63) no Hoare annotation was computed. [2020-07-17 22:46:22,318 INFO L268 CegarLoopResult]: For program point L164(lines 164 179) no Hoare annotation was computed. [2020-07-17 22:46:22,318 INFO L268 CegarLoopResult]: For program point L148(lines 148 163) no Hoare annotation was computed. [2020-07-17 22:46:22,318 INFO L268 CegarLoopResult]: For program point L82(lines 82 93) no Hoare annotation was computed. [2020-07-17 22:46:22,318 INFO L268 CegarLoopResult]: For program point L264(lines 264 279) no Hoare annotation was computed. [2020-07-17 22:46:22,319 INFO L268 CegarLoopResult]: For program point L132(lines 132 147) no Hoare annotation was computed. [2020-07-17 22:46:22,319 INFO L268 CegarLoopResult]: For program point L99(lines 99 182) no Hoare annotation was computed. [2020-07-17 22:46:22,319 INFO L268 CegarLoopResult]: For program point L66(lines 66 77) no Hoare annotation was computed. [2020-07-17 22:46:22,319 INFO L268 CegarLoopResult]: For program point L248(lines 248 263) no Hoare annotation was computed. [2020-07-17 22:46:22,321 INFO L268 CegarLoopResult]: For program point L116(lines 116 131) no Hoare annotation was computed. [2020-07-17 22:46:22,321 INFO L268 CegarLoopResult]: For program point L50(lines 50 61) no Hoare annotation was computed. [2020-07-17 22:46:22,321 INFO L268 CegarLoopResult]: For program point L364(lines 364 379) no Hoare annotation was computed. [2020-07-17 22:46:22,321 INFO L268 CegarLoopResult]: For program point L232(lines 232 247) no Hoare annotation was computed. [2020-07-17 22:46:22,321 INFO L268 CegarLoopResult]: For program point L166(lines 166 177) no Hoare annotation was computed. [2020-07-17 22:46:22,321 INFO L268 CegarLoopResult]: For program point L100(lines 100 115) no Hoare annotation was computed. [2020-07-17 22:46:22,321 INFO L268 CegarLoopResult]: For program point L34(lines 34 36) no Hoare annotation was computed. [2020-07-17 22:46:22,322 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-17 22:46:22,322 INFO L268 CegarLoopResult]: For program point L348(lines 348 363) no Hoare annotation was computed. [2020-07-17 22:46:22,322 INFO L268 CegarLoopResult]: For program point L216(lines 216 231) no Hoare annotation was computed. [2020-07-17 22:46:22,323 INFO L268 CegarLoopResult]: For program point L183(lines 183 282) no Hoare annotation was computed. [2020-07-17 22:46:22,323 INFO L268 CegarLoopResult]: For program point L150(lines 150 161) no Hoare annotation was computed. [2020-07-17 22:46:22,323 INFO L268 CegarLoopResult]: For program point L332(lines 332 347) no Hoare annotation was computed. [2020-07-17 22:46:22,323 INFO L268 CegarLoopResult]: For program point L266(lines 266 277) no Hoare annotation was computed. [2020-07-17 22:46:22,323 INFO L268 CegarLoopResult]: For program point L200(lines 200 215) no Hoare annotation was computed. [2020-07-17 22:46:22,323 INFO L268 CegarLoopResult]: For program point L134(lines 134 145) no Hoare annotation was computed. [2020-07-17 22:46:22,328 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:46:22,332 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:46:22,332 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:46:22,333 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2020-07-17 22:46:22,333 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:46:22,333 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:46:22,333 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2020-07-17 22:46:22,333 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-17 22:46:22,334 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2020-07-17 22:46:22,334 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-17 22:46:22,334 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-17 22:46:22,334 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:46:22,334 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-17 22:46:22,334 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-17 22:46:22,334 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-17 22:46:22,334 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-17 22:46:22,334 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:46:22,335 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-17 22:46:22,335 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-17 22:46:22,335 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2020-07-17 22:46:22,335 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2020-07-17 22:46:22,335 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2020-07-17 22:46:22,335 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2020-07-17 22:46:22,335 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-17 22:46:22,335 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-17 22:46:22,336 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-17 22:46:22,336 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-17 22:46:22,336 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2020-07-17 22:46:22,336 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2020-07-17 22:46:22,336 WARN L170 areAnnotationChecker]: L100 has no Hoare annotation [2020-07-17 22:46:22,336 WARN L170 areAnnotationChecker]: L100 has no Hoare annotation [2020-07-17 22:46:22,336 WARN L170 areAnnotationChecker]: L183 has no Hoare annotation [2020-07-17 22:46:22,336 WARN L170 areAnnotationChecker]: L183 has no Hoare annotation [2020-07-17 22:46:22,337 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2020-07-17 22:46:22,337 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:46:22,337 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-17 22:46:22,337 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-17 22:46:22,337 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2020-07-17 22:46:22,337 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2020-07-17 22:46:22,337 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2020-07-17 22:46:22,337 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2020-07-17 22:46:22,338 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2020-07-17 22:46:22,338 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2020-07-17 22:46:22,338 WARN L170 areAnnotationChecker]: L116 has no Hoare annotation [2020-07-17 22:46:22,338 WARN L170 areAnnotationChecker]: L116 has no Hoare annotation [2020-07-17 22:46:22,338 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2020-07-17 22:46:22,338 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2020-07-17 22:46:22,338 WARN L170 areAnnotationChecker]: L283 has no Hoare annotation [2020-07-17 22:46:22,338 WARN L170 areAnnotationChecker]: L283 has no Hoare annotation [2020-07-17 22:46:22,338 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2020-07-17 22:46:22,338 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2020-07-17 22:46:22,338 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2020-07-17 22:46:22,339 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2020-07-17 22:46:22,339 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2020-07-17 22:46:22,339 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2020-07-17 22:46:22,339 WARN L170 areAnnotationChecker]: L118 has no Hoare annotation [2020-07-17 22:46:22,339 WARN L170 areAnnotationChecker]: L118 has no Hoare annotation [2020-07-17 22:46:22,339 WARN L170 areAnnotationChecker]: L132 has no Hoare annotation [2020-07-17 22:46:22,339 WARN L170 areAnnotationChecker]: L132 has no Hoare annotation [2020-07-17 22:46:22,339 WARN L170 areAnnotationChecker]: L186 has no Hoare annotation [2020-07-17 22:46:22,339 WARN L170 areAnnotationChecker]: L186 has no Hoare annotation [2020-07-17 22:46:22,340 WARN L170 areAnnotationChecker]: L200 has no Hoare annotation [2020-07-17 22:46:22,340 WARN L170 areAnnotationChecker]: L200 has no Hoare annotation [2020-07-17 22:46:22,340 WARN L170 areAnnotationChecker]: L284 has no Hoare annotation [2020-07-17 22:46:22,340 WARN L170 areAnnotationChecker]: L284 has no Hoare annotation [2020-07-17 22:46:22,340 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2020-07-17 22:46:22,340 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2020-07-17 22:46:22,340 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2020-07-17 22:46:22,340 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2020-07-17 22:46:22,340 WARN L170 areAnnotationChecker]: L134 has no Hoare annotation [2020-07-17 22:46:22,340 WARN L170 areAnnotationChecker]: L134 has no Hoare annotation [2020-07-17 22:46:22,341 WARN L170 areAnnotationChecker]: L148 has no Hoare annotation [2020-07-17 22:46:22,341 WARN L170 areAnnotationChecker]: L148 has no Hoare annotation [2020-07-17 22:46:22,341 WARN L170 areAnnotationChecker]: L190 has no Hoare annotation [2020-07-17 22:46:22,341 WARN L170 areAnnotationChecker]: L190 has no Hoare annotation [2020-07-17 22:46:22,341 WARN L170 areAnnotationChecker]: L202 has no Hoare annotation [2020-07-17 22:46:22,341 WARN L170 areAnnotationChecker]: L202 has no Hoare annotation [2020-07-17 22:46:22,341 WARN L170 areAnnotationChecker]: L216 has no Hoare annotation [2020-07-17 22:46:22,341 WARN L170 areAnnotationChecker]: L216 has no Hoare annotation [2020-07-17 22:46:22,341 WARN L170 areAnnotationChecker]: L286 has no Hoare annotation [2020-07-17 22:46:22,342 WARN L170 areAnnotationChecker]: L286 has no Hoare annotation [2020-07-17 22:46:22,342 WARN L170 areAnnotationChecker]: L300 has no Hoare annotation [2020-07-17 22:46:22,342 WARN L170 areAnnotationChecker]: L300 has no Hoare annotation [2020-07-17 22:46:22,342 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2020-07-17 22:46:22,342 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2020-07-17 22:46:22,342 WARN L170 areAnnotationChecker]: L150 has no Hoare annotation [2020-07-17 22:46:22,342 WARN L170 areAnnotationChecker]: L150 has no Hoare annotation [2020-07-17 22:46:22,342 WARN L170 areAnnotationChecker]: L164 has no Hoare annotation [2020-07-17 22:46:22,342 WARN L170 areAnnotationChecker]: L164 has no Hoare annotation [2020-07-17 22:46:22,342 WARN L170 areAnnotationChecker]: L206 has no Hoare annotation [2020-07-17 22:46:22,343 WARN L170 areAnnotationChecker]: L206 has no Hoare annotation [2020-07-17 22:46:22,343 WARN L170 areAnnotationChecker]: L218 has no Hoare annotation [2020-07-17 22:46:22,343 WARN L170 areAnnotationChecker]: L218 has no Hoare annotation [2020-07-17 22:46:22,343 WARN L170 areAnnotationChecker]: L232 has no Hoare annotation [2020-07-17 22:46:22,343 WARN L170 areAnnotationChecker]: L232 has no Hoare annotation [2020-07-17 22:46:22,343 WARN L170 areAnnotationChecker]: L290 has no Hoare annotation [2020-07-17 22:46:22,343 WARN L170 areAnnotationChecker]: L290 has no Hoare annotation [2020-07-17 22:46:22,343 WARN L170 areAnnotationChecker]: L302 has no Hoare annotation [2020-07-17 22:46:22,344 WARN L170 areAnnotationChecker]: L302 has no Hoare annotation [2020-07-17 22:46:22,344 WARN L170 areAnnotationChecker]: L316 has no Hoare annotation [2020-07-17 22:46:22,344 WARN L170 areAnnotationChecker]: L316 has no Hoare annotation [2020-07-17 22:46:22,344 WARN L170 areAnnotationChecker]: L154 has no Hoare annotation [2020-07-17 22:46:22,344 WARN L170 areAnnotationChecker]: L154 has no Hoare annotation [2020-07-17 22:46:22,344 WARN L170 areAnnotationChecker]: L166 has no Hoare annotation [2020-07-17 22:46:22,344 WARN L170 areAnnotationChecker]: L166 has no Hoare annotation [2020-07-17 22:46:22,344 WARN L170 areAnnotationChecker]: L222 has no Hoare annotation [2020-07-17 22:46:22,344 WARN L170 areAnnotationChecker]: L222 has no Hoare annotation [2020-07-17 22:46:22,345 WARN L170 areAnnotationChecker]: L234 has no Hoare annotation [2020-07-17 22:46:22,345 WARN L170 areAnnotationChecker]: L234 has no Hoare annotation [2020-07-17 22:46:22,345 WARN L170 areAnnotationChecker]: L248 has no Hoare annotation [2020-07-17 22:46:22,345 WARN L170 areAnnotationChecker]: L248 has no Hoare annotation [2020-07-17 22:46:22,345 WARN L170 areAnnotationChecker]: L306 has no Hoare annotation [2020-07-17 22:46:22,345 WARN L170 areAnnotationChecker]: L306 has no Hoare annotation [2020-07-17 22:46:22,345 WARN L170 areAnnotationChecker]: L318 has no Hoare annotation [2020-07-17 22:46:22,346 WARN L170 areAnnotationChecker]: L318 has no Hoare annotation [2020-07-17 22:46:22,346 WARN L170 areAnnotationChecker]: L332 has no Hoare annotation [2020-07-17 22:46:22,346 WARN L170 areAnnotationChecker]: L332 has no Hoare annotation [2020-07-17 22:46:22,346 WARN L170 areAnnotationChecker]: L170 has no Hoare annotation [2020-07-17 22:46:22,346 WARN L170 areAnnotationChecker]: L170 has no Hoare annotation [2020-07-17 22:46:22,346 WARN L170 areAnnotationChecker]: L238 has no Hoare annotation [2020-07-17 22:46:22,346 WARN L170 areAnnotationChecker]: L238 has no Hoare annotation [2020-07-17 22:46:22,346 WARN L170 areAnnotationChecker]: L250 has no Hoare annotation [2020-07-17 22:46:22,346 WARN L170 areAnnotationChecker]: L250 has no Hoare annotation [2020-07-17 22:46:22,347 WARN L170 areAnnotationChecker]: L264 has no Hoare annotation [2020-07-17 22:46:22,347 WARN L170 areAnnotationChecker]: L264 has no Hoare annotation [2020-07-17 22:46:22,347 WARN L170 areAnnotationChecker]: L322 has no Hoare annotation [2020-07-17 22:46:22,347 WARN L170 areAnnotationChecker]: L322 has no Hoare annotation [2020-07-17 22:46:22,347 WARN L170 areAnnotationChecker]: L334 has no Hoare annotation [2020-07-17 22:46:22,347 WARN L170 areAnnotationChecker]: L334 has no Hoare annotation [2020-07-17 22:46:22,347 WARN L170 areAnnotationChecker]: L348 has no Hoare annotation [2020-07-17 22:46:22,347 WARN L170 areAnnotationChecker]: L348 has no Hoare annotation [2020-07-17 22:46:22,348 WARN L170 areAnnotationChecker]: L254 has no Hoare annotation [2020-07-17 22:46:22,348 WARN L170 areAnnotationChecker]: L254 has no Hoare annotation [2020-07-17 22:46:22,348 WARN L170 areAnnotationChecker]: L266 has no Hoare annotation [2020-07-17 22:46:22,348 WARN L170 areAnnotationChecker]: L266 has no Hoare annotation [2020-07-17 22:46:22,348 WARN L170 areAnnotationChecker]: L338 has no Hoare annotation [2020-07-17 22:46:22,348 WARN L170 areAnnotationChecker]: L338 has no Hoare annotation [2020-07-17 22:46:22,348 WARN L170 areAnnotationChecker]: L350 has no Hoare annotation [2020-07-17 22:46:22,348 WARN L170 areAnnotationChecker]: L350 has no Hoare annotation [2020-07-17 22:46:22,349 WARN L170 areAnnotationChecker]: L364 has no Hoare annotation [2020-07-17 22:46:22,349 WARN L170 areAnnotationChecker]: L364 has no Hoare annotation [2020-07-17 22:46:22,349 WARN L170 areAnnotationChecker]: L270 has no Hoare annotation [2020-07-17 22:46:22,349 WARN L170 areAnnotationChecker]: L270 has no Hoare annotation [2020-07-17 22:46:22,349 WARN L170 areAnnotationChecker]: L354 has no Hoare annotation [2020-07-17 22:46:22,349 WARN L170 areAnnotationChecker]: L354 has no Hoare annotation [2020-07-17 22:46:22,349 WARN L170 areAnnotationChecker]: L366 has no Hoare annotation [2020-07-17 22:46:22,349 WARN L170 areAnnotationChecker]: L366 has no Hoare annotation [2020-07-17 22:46:22,350 WARN L170 areAnnotationChecker]: L370 has no Hoare annotation [2020-07-17 22:46:22,351 WARN L170 areAnnotationChecker]: L370 has no Hoare annotation [2020-07-17 22:46:22,351 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:46:22,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:46:22 BoogieIcfgContainer [2020-07-17 22:46:22,377 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:46:22,380 INFO L168 Benchmark]: Toolchain (without parser) took 11908.11 ms. Allocated memory was 135.8 MB in the beginning and 360.2 MB in the end (delta: 224.4 MB). Free memory was 100.7 MB in the beginning and 208.0 MB in the end (delta: -107.3 MB). Peak memory consumption was 117.1 MB. Max. memory is 7.1 GB. [2020-07-17 22:46:22,381 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 135.8 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-17 22:46:22,382 INFO L168 Benchmark]: CACSL2BoogieTranslator took 503.31 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 100.3 MB in the beginning and 178.6 MB in the end (delta: -78.3 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:46:22,382 INFO L168 Benchmark]: Boogie Preprocessor took 58.81 ms. Allocated memory is still 199.8 MB. Free memory was 178.6 MB in the beginning and 176.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:46:22,383 INFO L168 Benchmark]: RCFGBuilder took 877.68 ms. Allocated memory is still 199.8 MB. Free memory was 175.3 MB in the beginning and 126.8 MB in the end (delta: 48.5 MB). Peak memory consumption was 48.5 MB. Max. memory is 7.1 GB. [2020-07-17 22:46:22,384 INFO L168 Benchmark]: TraceAbstraction took 10460.70 ms. Allocated memory was 199.8 MB in the beginning and 360.2 MB in the end (delta: 160.4 MB). Free memory was 126.1 MB in the beginning and 208.0 MB in the end (delta: -81.9 MB). Peak memory consumption was 78.5 MB. Max. memory is 7.1 GB. [2020-07-17 22:46:22,387 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.24 ms. Allocated memory is still 135.8 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 503.31 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 100.3 MB in the beginning and 178.6 MB in the end (delta: -78.3 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 58.81 ms. Allocated memory is still 199.8 MB. Free memory was 178.6 MB in the beginning and 176.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 877.68 ms. Allocated memory is still 199.8 MB. Free memory was 175.3 MB in the beginning and 126.8 MB in the end (delta: 48.5 MB). Peak memory consumption was 48.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10460.70 ms. Allocated memory was 199.8 MB in the beginning and 360.2 MB in the end (delta: 160.4 MB). Free memory was 126.1 MB in the beginning and 208.0 MB in the end (delta: -81.9 MB). Peak memory consumption was 78.5 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) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 83 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 10.0s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1008 SDtfs, 1441 SDslu, 73 SDs, 0 SdLazy, 634 SolverSat, 96 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s 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=108occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 28 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 13 NumberOfFragments, 67 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 153 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 277 NumberOfCodeBlocks, 277 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 266 ConstructedInterpolants, 0 QuantifiedInterpolants, 15354 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 55/55 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...