/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-46f3038-m [2020-07-08 12:41:32,094 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:41:32,098 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:41:32,117 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:41:32,117 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:41:32,119 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:41:32,121 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:41:32,131 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:41:32,135 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:41:32,138 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:41:32,140 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:41:32,143 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:41:32,143 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:41:32,145 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:41:32,147 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:41:32,149 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:41:32,151 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:41:32,152 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:41:32,153 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:41:32,158 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:41:32,164 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:41:32,169 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:41:32,170 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:41:32,171 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:41:32,174 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:41:32,174 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:41:32,174 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:41:32,177 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:41:32,178 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:41:32,179 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:41:32,179 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:41:32,180 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:41:32,181 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:41:32,182 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:41:32,183 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:41:32,183 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:41:32,184 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:41:32,184 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:41:32,184 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:41:32,185 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:41:32,187 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:41:32,187 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-08 12:41:32,225 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:41:32,225 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:41:32,230 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:41:32,230 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:41:32,230 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:41:32,231 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:41:32,231 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:41:32,231 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:41:32,231 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:41:32,231 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:41:32,231 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:41:32,232 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:41:32,232 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:41:32,232 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:41:32,232 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:41:32,232 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:41:32,232 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:41:32,233 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:41:32,233 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:41:32,233 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:41:32,233 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:41:32,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:41:32,234 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:41:32,234 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:41:32,234 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:41:32,234 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:41:32,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:41:32,235 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:41:32,235 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:41:32,235 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:41:32,499 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:41:32,512 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:41:32,515 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:41:32,517 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:41:32,517 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:41:32,518 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-08 12:41:32,595 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ad4ac2c4/e0d7ba0f61f1496fb009ae49ef442b76/FLAG5bfc8e4d5 [2020-07-08 12:41:33,085 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:41:33,086 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_security.c [2020-07-08 12:41:33,095 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ad4ac2c4/e0d7ba0f61f1496fb009ae49ef442b76/FLAG5bfc8e4d5 [2020-07-08 12:41:33,426 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ad4ac2c4/e0d7ba0f61f1496fb009ae49ef442b76 [2020-07-08 12:41:33,434 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:41:33,436 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:41:33,437 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:41:33,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:41:33,440 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:41:33,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:41:33" (1/1) ... [2020-07-08 12:41:33,445 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60df6b72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:41:33, skipping insertion in model container [2020-07-08 12:41:33,445 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:41:33" (1/1) ... [2020-07-08 12:41:33,453 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:41:33,496 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:41:33,696 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:41:33,702 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:41:33,746 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:41:33,857 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:41:33,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:41:33 WrapperNode [2020-07-08 12:41:33,858 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:41:33,859 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:41:33,859 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:41:33,860 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:41:33,871 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:41:33" (1/1) ... [2020-07-08 12:41:33,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:41:33" (1/1) ... [2020-07-08 12:41:33,879 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:41:33" (1/1) ... [2020-07-08 12:41:33,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:41:33" (1/1) ... [2020-07-08 12:41:33,894 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:41:33" (1/1) ... [2020-07-08 12:41:33,911 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:41:33" (1/1) ... [2020-07-08 12:41:33,913 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:41:33" (1/1) ... [2020-07-08 12:41:33,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:41:33,917 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:41:33,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:41:33,918 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:41:33,919 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:41:33" (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-08 12:41:33,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:41:33,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:41:33,995 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:41:33,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:41:33,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:41:33,996 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:41:33,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:41:33,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:41:34,750 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:41:34,750 INFO L295 CfgBuilder]: Removed 18 assume(true) statements. [2020-07-08 12:41:34,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:41:34 BoogieIcfgContainer [2020-07-08 12:41:34,764 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:41:34,767 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:41:34,768 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:41:34,772 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:41:34,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:41:33" (1/3) ... [2020-07-08 12:41:34,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63633eb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:41:34, skipping insertion in model container [2020-07-08 12:41:34,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:41:33" (2/3) ... [2020-07-08 12:41:34,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63633eb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:41:34, skipping insertion in model container [2020-07-08 12:41:34,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:41:34" (3/3) ... [2020-07-08 12:41:34,779 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_security.c [2020-07-08 12:41:34,799 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:41:34,807 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:41:34,819 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:41:34,841 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:41:34,841 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:41:34,841 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:41:34,841 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:41:34,842 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:41:34,842 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:41:34,842 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:41:34,842 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:41:34,861 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states. [2020-07-08 12:41:34,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-08 12:41:34,868 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:41:34,869 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:41:34,869 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:41:34,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:41:34,875 INFO L82 PathProgramCache]: Analyzing trace with hash -105811556, now seen corresponding path program 1 times [2020-07-08 12:41:34,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:41:34,887 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532075810] [2020-07-08 12:41:34,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:41:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:41:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:41:35,077 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-08 12:41:35,077 INFO L280 TraceCheckUtils]: 1: Hoare triple {86#true} assume true; {86#true} is VALID [2020-07-08 12:41:35,078 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {86#true} {86#true} #376#return; {86#true} is VALID [2020-07-08 12:41:35,082 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-08 12:41:35,082 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-08 12:41:35,083 INFO L280 TraceCheckUtils]: 2: Hoare triple {86#true} assume true; {86#true} is VALID [2020-07-08 12:41:35,083 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {86#true} {86#true} #376#return; {86#true} is VALID [2020-07-08 12:41:35,083 INFO L263 TraceCheckUtils]: 4: Hoare triple {86#true} call #t~ret21 := main(); {86#true} is VALID [2020-07-08 12:41:35,084 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-08 12:41:35,084 INFO L280 TraceCheckUtils]: 6: Hoare triple {86#true} goto; {86#true} is VALID [2020-07-08 12:41:35,084 INFO L280 TraceCheckUtils]: 7: Hoare triple {86#true} assume !false; {86#true} is VALID [2020-07-08 12:41:35,085 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-08 12:41:35,085 INFO L280 TraceCheckUtils]: 9: Hoare triple {86#true} assume 0 != #t~nondet0;havoc #t~nondet0; {86#true} is VALID [2020-07-08 12:41:35,086 INFO L280 TraceCheckUtils]: 10: Hoare triple {86#true} ~method_id~0 := 3; {86#true} is VALID [2020-07-08 12:41:35,087 INFO L280 TraceCheckUtils]: 11: Hoare triple {86#true} assume false; {87#false} is VALID [2020-07-08 12:41:35,087 INFO L280 TraceCheckUtils]: 12: Hoare triple {87#false} assume !false; {87#false} is VALID [2020-07-08 12:41:35,089 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-08 12:41:35,090 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532075810] [2020-07-08 12:41:35,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:41:35,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:41:35,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797322999] [2020-07-08 12:41:35,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-07-08 12:41:35,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:41:35,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:41:35,132 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-08 12:41:35,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:41:35,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:41:35,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:41:35,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:41:35,145 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 3 states. [2020-07-08 12:41:35,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:41:35,505 INFO L93 Difference]: Finished difference Result 160 states and 298 transitions. [2020-07-08 12:41:35,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:41:35,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-07-08 12:41:35,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:41:35,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:41:35,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2020-07-08 12:41:35,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:41:35,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2020-07-08 12:41:35,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 298 transitions. [2020-07-08 12:41:35,947 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-08 12:41:35,966 INFO L225 Difference]: With dead ends: 160 [2020-07-08 12:41:35,966 INFO L226 Difference]: Without dead ends: 78 [2020-07-08 12:41:35,974 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-08 12:41:35,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-08 12:41:36,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-07-08 12:41:36,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:41:36,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 78 states. [2020-07-08 12:41:36,050 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2020-07-08 12:41:36,050 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2020-07-08 12:41:36,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:41:36,058 INFO L93 Difference]: Finished difference Result 78 states and 113 transitions. [2020-07-08 12:41:36,058 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 113 transitions. [2020-07-08 12:41:36,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:41:36,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:41:36,060 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2020-07-08 12:41:36,060 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2020-07-08 12:41:36,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:41:36,068 INFO L93 Difference]: Finished difference Result 78 states and 113 transitions. [2020-07-08 12:41:36,068 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 113 transitions. [2020-07-08 12:41:36,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:41:36,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:41:36,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:41:36,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:41:36,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-07-08 12:41:36,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 113 transitions. [2020-07-08 12:41:36,077 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 113 transitions. Word has length 13 [2020-07-08 12:41:36,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:41:36,078 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 113 transitions. [2020-07-08 12:41:36,078 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:41:36,078 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 113 transitions. [2020-07-08 12:41:36,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-08 12:41:36,080 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:41:36,080 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:41:36,080 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:41:36,081 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:41:36,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:41:36,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1547300989, now seen corresponding path program 1 times [2020-07-08 12:41:36,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:41:36,082 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709912525] [2020-07-08 12:41:36,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:41:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:41:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:41:36,189 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-08 12:41:36,189 INFO L280 TraceCheckUtils]: 1: Hoare triple {505#true} assume true; {505#true} is VALID [2020-07-08 12:41:36,190 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {505#true} {505#true} #376#return; {505#true} is VALID [2020-07-08 12:41:36,192 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-08 12:41:36,193 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-08 12:41:36,194 INFO L280 TraceCheckUtils]: 2: Hoare triple {505#true} assume true; {505#true} is VALID [2020-07-08 12:41:36,194 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {505#true} {505#true} #376#return; {505#true} is VALID [2020-07-08 12:41:36,194 INFO L263 TraceCheckUtils]: 4: Hoare triple {505#true} call #t~ret21 := main(); {505#true} is VALID [2020-07-08 12:41:36,195 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-08 12:41:36,196 INFO L280 TraceCheckUtils]: 6: Hoare triple {510#(= 0 main_~q~0)} goto; {510#(= 0 main_~q~0)} is VALID [2020-07-08 12:41:36,197 INFO L280 TraceCheckUtils]: 7: Hoare triple {510#(= 0 main_~q~0)} assume !false; {510#(= 0 main_~q~0)} is VALID [2020-07-08 12:41:36,198 INFO L280 TraceCheckUtils]: 8: Hoare triple {510#(= 0 main_~q~0)} assume !(0 == ~q~0); {506#false} is VALID [2020-07-08 12:41:36,198 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-08 12:41:36,199 INFO L280 TraceCheckUtils]: 10: Hoare triple {506#false} assume 0 != #t~nondet1;havoc #t~nondet1; {506#false} is VALID [2020-07-08 12:41:36,199 INFO L280 TraceCheckUtils]: 11: Hoare triple {506#false} ~method_id~0 := 4; {506#false} is VALID [2020-07-08 12:41:36,200 INFO L280 TraceCheckUtils]: 12: Hoare triple {506#false} assume 2 == ~this_state~0; {506#false} is VALID [2020-07-08 12:41:36,202 INFO L280 TraceCheckUtils]: 13: Hoare triple {506#false} assume !false; {506#false} is VALID [2020-07-08 12:41:36,205 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-08 12:41:36,206 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709912525] [2020-07-08 12:41:36,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:41:36,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 12:41:36,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983836630] [2020-07-08 12:41:36,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-08 12:41:36,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:41:36,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 12:41:36,233 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-08 12:41:36,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 12:41:36,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:41:36,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 12:41:36,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 12:41:36,234 INFO L87 Difference]: Start difference. First operand 78 states and 113 transitions. Second operand 4 states. [2020-07-08 12:41:36,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:41:36,780 INFO L93 Difference]: Finished difference Result 153 states and 224 transitions. [2020-07-08 12:41:36,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 12:41:36,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-08 12:41:36,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:41:36,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:41:36,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 224 transitions. [2020-07-08 12:41:36,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:41:36,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 224 transitions. [2020-07-08 12:41:36,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 224 transitions. [2020-07-08 12:41:37,092 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-08 12:41:37,096 INFO L225 Difference]: With dead ends: 153 [2020-07-08 12:41:37,096 INFO L226 Difference]: Without dead ends: 81 [2020-07-08 12:41:37,098 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-08 12:41:37,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-08 12:41:37,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2020-07-08 12:41:37,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:41:37,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 81 states. [2020-07-08 12:41:37,133 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2020-07-08 12:41:37,134 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2020-07-08 12:41:37,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:41:37,138 INFO L93 Difference]: Finished difference Result 81 states and 116 transitions. [2020-07-08 12:41:37,138 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 116 transitions. [2020-07-08 12:41:37,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:41:37,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:41:37,140 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2020-07-08 12:41:37,140 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2020-07-08 12:41:37,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:41:37,145 INFO L93 Difference]: Finished difference Result 81 states and 116 transitions. [2020-07-08 12:41:37,145 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 116 transitions. [2020-07-08 12:41:37,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:41:37,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:41:37,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:41:37,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:41:37,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-08 12:41:37,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 116 transitions. [2020-07-08 12:41:37,152 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 116 transitions. Word has length 14 [2020-07-08 12:41:37,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:41:37,152 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 116 transitions. [2020-07-08 12:41:37,152 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 12:41:37,152 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 116 transitions. [2020-07-08 12:41:37,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-08 12:41:37,154 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:41:37,154 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-08 12:41:37,154 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 12:41:37,154 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:41:37,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:41:37,155 INFO L82 PathProgramCache]: Analyzing trace with hash 555004895, now seen corresponding path program 1 times [2020-07-08 12:41:37,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:41:37,155 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479980880] [2020-07-08 12:41:37,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:41:37,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:41:37,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:41:37,218 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-08 12:41:37,219 INFO L280 TraceCheckUtils]: 1: Hoare triple {933#true} assume true; {933#true} is VALID [2020-07-08 12:41:37,219 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {933#true} {933#true} #376#return; {933#true} is VALID [2020-07-08 12:41:37,220 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-08 12:41:37,221 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-08 12:41:37,221 INFO L280 TraceCheckUtils]: 2: Hoare triple {933#true} assume true; {933#true} is VALID [2020-07-08 12:41:37,221 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {933#true} {933#true} #376#return; {933#true} is VALID [2020-07-08 12:41:37,222 INFO L263 TraceCheckUtils]: 4: Hoare triple {933#true} call #t~ret21 := main(); {933#true} is VALID [2020-07-08 12:41:37,222 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-08 12:41:37,222 INFO L280 TraceCheckUtils]: 6: Hoare triple {933#true} goto; {933#true} is VALID [2020-07-08 12:41:37,223 INFO L280 TraceCheckUtils]: 7: Hoare triple {933#true} assume !false; {933#true} is VALID [2020-07-08 12:41:37,223 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-08 12:41:37,223 INFO L280 TraceCheckUtils]: 9: Hoare triple {933#true} assume 0 != #t~nondet0;havoc #t~nondet0; {933#true} is VALID [2020-07-08 12:41:37,223 INFO L280 TraceCheckUtils]: 10: Hoare triple {933#true} ~method_id~0 := 3; {933#true} is VALID [2020-07-08 12:41:37,224 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-08 12:41:37,225 INFO L280 TraceCheckUtils]: 12: Hoare triple {938#(<= 2 main_~q~0)} assume !false; {938#(<= 2 main_~q~0)} is VALID [2020-07-08 12:41:37,226 INFO L280 TraceCheckUtils]: 13: Hoare triple {938#(<= 2 main_~q~0)} assume !(0 == ~q~0); {938#(<= 2 main_~q~0)} is VALID [2020-07-08 12:41:37,230 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-08 12:41:37,230 INFO L280 TraceCheckUtils]: 15: Hoare triple {934#false} assume 0 != #t~nondet1;havoc #t~nondet1; {934#false} is VALID [2020-07-08 12:41:37,230 INFO L280 TraceCheckUtils]: 16: Hoare triple {934#false} ~method_id~0 := 4; {934#false} is VALID [2020-07-08 12:41:37,231 INFO L280 TraceCheckUtils]: 17: Hoare triple {934#false} assume 2 == ~this_state~0; {934#false} is VALID [2020-07-08 12:41:37,231 INFO L280 TraceCheckUtils]: 18: Hoare triple {934#false} assume !false; {934#false} is VALID [2020-07-08 12:41:37,232 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-08 12:41:37,233 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479980880] [2020-07-08 12:41:37,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:41:37,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 12:41:37,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035399996] [2020-07-08 12:41:37,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-07-08 12:41:37,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:41:37,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 12:41:37,260 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-08 12:41:37,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 12:41:37,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:41:37,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 12:41:37,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 12:41:37,261 INFO L87 Difference]: Start difference. First operand 81 states and 116 transitions. Second operand 4 states. [2020-07-08 12:41:37,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:41:37,616 INFO L93 Difference]: Finished difference Result 146 states and 213 transitions. [2020-07-08 12:41:37,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 12:41:37,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-07-08 12:41:37,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:41:37,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:41:37,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2020-07-08 12:41:37,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:41:37,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2020-07-08 12:41:37,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 211 transitions. [2020-07-08 12:41:37,908 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-08 12:41:37,911 INFO L225 Difference]: With dead ends: 146 [2020-07-08 12:41:37,911 INFO L226 Difference]: Without dead ends: 72 [2020-07-08 12:41:37,912 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-08 12:41:37,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-07-08 12:41:37,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-07-08 12:41:37,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:41:37,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 72 states. [2020-07-08 12:41:37,948 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2020-07-08 12:41:37,948 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2020-07-08 12:41:37,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:41:37,952 INFO L93 Difference]: Finished difference Result 72 states and 102 transitions. [2020-07-08 12:41:37,952 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 102 transitions. [2020-07-08 12:41:37,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:41:37,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:41:37,954 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2020-07-08 12:41:37,954 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2020-07-08 12:41:37,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:41:37,958 INFO L93 Difference]: Finished difference Result 72 states and 102 transitions. [2020-07-08 12:41:37,958 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 102 transitions. [2020-07-08 12:41:37,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:41:37,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:41:37,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:41:37,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:41:37,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-07-08 12:41:37,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 102 transitions. [2020-07-08 12:41:37,965 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 102 transitions. Word has length 19 [2020-07-08 12:41:37,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:41:37,965 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 102 transitions. [2020-07-08 12:41:37,965 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 12:41:37,965 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 102 transitions. [2020-07-08 12:41:37,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-08 12:41:37,967 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:41:37,967 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-08 12:41:37,967 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 12:41:37,967 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:41:37,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:41:37,968 INFO L82 PathProgramCache]: Analyzing trace with hash -624681896, now seen corresponding path program 1 times [2020-07-08 12:41:37,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:41:37,968 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895275812] [2020-07-08 12:41:37,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:41:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:41:38,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:41:38,047 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-08 12:41:38,047 INFO L280 TraceCheckUtils]: 1: Hoare triple {1329#true} assume true; {1329#true} is VALID [2020-07-08 12:41:38,047 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1329#true} {1329#true} #376#return; {1329#true} is VALID [2020-07-08 12:41:38,048 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-08 12:41:38,049 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-08 12:41:38,049 INFO L280 TraceCheckUtils]: 2: Hoare triple {1329#true} assume true; {1329#true} is VALID [2020-07-08 12:41:38,049 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1329#true} {1329#true} #376#return; {1329#true} is VALID [2020-07-08 12:41:38,049 INFO L263 TraceCheckUtils]: 4: Hoare triple {1329#true} call #t~ret21 := main(); {1329#true} is VALID [2020-07-08 12:41:38,050 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-08 12:41:38,050 INFO L280 TraceCheckUtils]: 6: Hoare triple {1329#true} goto; {1329#true} is VALID [2020-07-08 12:41:38,050 INFO L280 TraceCheckUtils]: 7: Hoare triple {1329#true} assume !false; {1329#true} is VALID [2020-07-08 12:41:38,051 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-08 12:41:38,051 INFO L280 TraceCheckUtils]: 9: Hoare triple {1329#true} assume 0 != #t~nondet0;havoc #t~nondet0; {1329#true} is VALID [2020-07-08 12:41:38,051 INFO L280 TraceCheckUtils]: 10: Hoare triple {1329#true} ~method_id~0 := 3; {1329#true} is VALID [2020-07-08 12:41:38,053 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-08 12:41:38,055 INFO L280 TraceCheckUtils]: 12: Hoare triple {1334#(<= main_~this_state~0 0)} assume !false; {1334#(<= main_~this_state~0 0)} is VALID [2020-07-08 12:41:38,056 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-08 12:41:38,057 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-08 12:41:38,058 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-08 12:41:38,059 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-08 12:41:38,060 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-08 12:41:38,061 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-08 12:41:38,061 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-08 12:41:38,062 INFO L280 TraceCheckUtils]: 20: Hoare triple {1334#(<= main_~this_state~0 0)} assume 2 == ~this_state~0; {1330#false} is VALID [2020-07-08 12:41:38,062 INFO L280 TraceCheckUtils]: 21: Hoare triple {1330#false} assume !false; {1330#false} is VALID [2020-07-08 12:41:38,063 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-08 12:41:38,064 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895275812] [2020-07-08 12:41:38,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:41:38,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 12:41:38,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665862664] [2020-07-08 12:41:38,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-08 12:41:38,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:41:38,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 12:41:38,097 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-08 12:41:38,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 12:41:38,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:41:38,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 12:41:38,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 12:41:38,098 INFO L87 Difference]: Start difference. First operand 72 states and 102 transitions. Second operand 4 states. [2020-07-08 12:41:38,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:41:38,735 INFO L93 Difference]: Finished difference Result 192 states and 280 transitions. [2020-07-08 12:41:38,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 12:41:38,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-08 12:41:38,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:41:38,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:41:38,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 278 transitions. [2020-07-08 12:41:38,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:41:38,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 278 transitions. [2020-07-08 12:41:38,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 278 transitions. [2020-07-08 12:41:39,131 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-08 12:41:39,135 INFO L225 Difference]: With dead ends: 192 [2020-07-08 12:41:39,135 INFO L226 Difference]: Without dead ends: 122 [2020-07-08 12:41:39,136 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-08 12:41:39,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-07-08 12:41:39,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 108. [2020-07-08 12:41:39,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:41:39,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 108 states. [2020-07-08 12:41:39,190 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 108 states. [2020-07-08 12:41:39,190 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 108 states. [2020-07-08 12:41:39,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:41:39,196 INFO L93 Difference]: Finished difference Result 122 states and 166 transitions. [2020-07-08 12:41:39,196 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 166 transitions. [2020-07-08 12:41:39,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:41:39,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:41:39,197 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 122 states. [2020-07-08 12:41:39,198 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 122 states. [2020-07-08 12:41:39,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:41:39,203 INFO L93 Difference]: Finished difference Result 122 states and 166 transitions. [2020-07-08 12:41:39,203 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 166 transitions. [2020-07-08 12:41:39,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:41:39,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:41:39,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:41:39,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:41:39,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-07-08 12:41:39,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2020-07-08 12:41:39,209 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 22 [2020-07-08 12:41:39,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:41:39,209 INFO L479 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2020-07-08 12:41:39,210 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 12:41:39,210 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2020-07-08 12:41:39,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-08 12:41:39,210 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:41:39,211 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-08 12:41:39,211 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 12:41:39,211 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:41:39,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:41:39,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1531598883, now seen corresponding path program 1 times [2020-07-08 12:41:39,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:41:39,212 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029139946] [2020-07-08 12:41:39,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:41:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:41:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:41:39,308 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-08 12:41:39,309 INFO L280 TraceCheckUtils]: 1: Hoare triple {1911#true} assume true; {1911#true} is VALID [2020-07-08 12:41:39,309 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1911#true} {1911#true} #376#return; {1911#true} is VALID [2020-07-08 12:41:39,312 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-08 12:41:39,313 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-08 12:41:39,313 INFO L280 TraceCheckUtils]: 2: Hoare triple {1911#true} assume true; {1911#true} is VALID [2020-07-08 12:41:39,313 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1911#true} {1911#true} #376#return; {1911#true} is VALID [2020-07-08 12:41:39,314 INFO L263 TraceCheckUtils]: 4: Hoare triple {1911#true} call #t~ret21 := main(); {1911#true} is VALID [2020-07-08 12:41:39,314 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-08 12:41:39,314 INFO L280 TraceCheckUtils]: 6: Hoare triple {1911#true} goto; {1911#true} is VALID [2020-07-08 12:41:39,315 INFO L280 TraceCheckUtils]: 7: Hoare triple {1911#true} assume !false; {1911#true} is VALID [2020-07-08 12:41:39,315 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-08 12:41:39,315 INFO L280 TraceCheckUtils]: 9: Hoare triple {1911#true} assume 0 != #t~nondet0;havoc #t~nondet0; {1911#true} is VALID [2020-07-08 12:41:39,316 INFO L280 TraceCheckUtils]: 10: Hoare triple {1911#true} ~method_id~0 := 3; {1911#true} is VALID [2020-07-08 12:41:39,327 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-08 12:41:39,329 INFO L280 TraceCheckUtils]: 12: Hoare triple {1916#(= 2 main_~q~0)} assume !false; {1916#(= 2 main_~q~0)} is VALID [2020-07-08 12:41:39,330 INFO L280 TraceCheckUtils]: 13: Hoare triple {1916#(= 2 main_~q~0)} assume !(0 == ~q~0); {1916#(= 2 main_~q~0)} is VALID [2020-07-08 12:41:39,330 INFO L280 TraceCheckUtils]: 14: Hoare triple {1916#(= 2 main_~q~0)} assume !(1 == ~q~0); {1916#(= 2 main_~q~0)} is VALID [2020-07-08 12:41:39,331 INFO L280 TraceCheckUtils]: 15: Hoare triple {1916#(= 2 main_~q~0)} assume !(2 == ~q~0); {1912#false} is VALID [2020-07-08 12:41:39,331 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-08 12:41:39,331 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-08 12:41:39,332 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-08 12:41:39,332 INFO L280 TraceCheckUtils]: 19: Hoare triple {1912#false} assume 0 != #t~nondet11;havoc #t~nondet11; {1912#false} is VALID [2020-07-08 12:41:39,332 INFO L280 TraceCheckUtils]: 20: Hoare triple {1912#false} ~method_id~0 := 4; {1912#false} is VALID [2020-07-08 12:41:39,332 INFO L280 TraceCheckUtils]: 21: Hoare triple {1912#false} assume 2 != ~this_state~0; {1912#false} is VALID [2020-07-08 12:41:39,333 INFO L280 TraceCheckUtils]: 22: Hoare triple {1912#false} assume !false; {1912#false} is VALID [2020-07-08 12:41:39,334 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-08 12:41:39,334 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029139946] [2020-07-08 12:41:39,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:41:39,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 12:41:39,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254103316] [2020-07-08 12:41:39,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-07-08 12:41:39,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:41:39,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 12:41:39,359 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-08 12:41:39,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 12:41:39,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:41:39,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 12:41:39,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 12:41:39,361 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand 4 states. [2020-07-08 12:41:39,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:41:39,805 INFO L93 Difference]: Finished difference Result 183 states and 260 transitions. [2020-07-08 12:41:39,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 12:41:39,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-07-08 12:41:39,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:41:39,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:41:39,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2020-07-08 12:41:39,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:41:39,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2020-07-08 12:41:39,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 195 transitions. [2020-07-08 12:41:40,081 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-08 12:41:40,084 INFO L225 Difference]: With dead ends: 183 [2020-07-08 12:41:40,084 INFO L226 Difference]: Without dead ends: 87 [2020-07-08 12:41:40,085 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-08 12:41:40,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-07-08 12:41:40,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2020-07-08 12:41:40,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:41:40,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 85 states. [2020-07-08 12:41:40,138 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 85 states. [2020-07-08 12:41:40,138 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 85 states. [2020-07-08 12:41:40,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:41:40,141 INFO L93 Difference]: Finished difference Result 87 states and 118 transitions. [2020-07-08 12:41:40,141 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 118 transitions. [2020-07-08 12:41:40,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:41:40,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:41:40,142 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 87 states. [2020-07-08 12:41:40,142 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 87 states. [2020-07-08 12:41:40,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:41:40,145 INFO L93 Difference]: Finished difference Result 87 states and 118 transitions. [2020-07-08 12:41:40,146 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 118 transitions. [2020-07-08 12:41:40,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:41:40,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:41:40,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:41:40,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:41:40,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-08 12:41:40,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 117 transitions. [2020-07-08 12:41:40,150 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 117 transitions. Word has length 23 [2020-07-08 12:41:40,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:41:40,151 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 117 transitions. [2020-07-08 12:41:40,151 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 12:41:40,151 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2020-07-08 12:41:40,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-08 12:41:40,152 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:41:40,152 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-08 12:41:40,152 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 12:41:40,152 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:41:40,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:41:40,153 INFO L82 PathProgramCache]: Analyzing trace with hash -576284788, now seen corresponding path program 1 times [2020-07-08 12:41:40,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:41:40,153 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579086979] [2020-07-08 12:41:40,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:41:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:41:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:41:40,225 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-08 12:41:40,226 INFO L280 TraceCheckUtils]: 1: Hoare triple {2393#true} assume true; {2393#true} is VALID [2020-07-08 12:41:40,226 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2393#true} {2393#true} #376#return; {2393#true} is VALID [2020-07-08 12:41:40,227 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-08 12:41:40,227 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-08 12:41:40,227 INFO L280 TraceCheckUtils]: 2: Hoare triple {2393#true} assume true; {2393#true} is VALID [2020-07-08 12:41:40,228 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2393#true} {2393#true} #376#return; {2393#true} is VALID [2020-07-08 12:41:40,228 INFO L263 TraceCheckUtils]: 4: Hoare triple {2393#true} call #t~ret21 := main(); {2393#true} is VALID [2020-07-08 12:41:40,228 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-08 12:41:40,228 INFO L280 TraceCheckUtils]: 6: Hoare triple {2393#true} goto; {2393#true} is VALID [2020-07-08 12:41:40,228 INFO L280 TraceCheckUtils]: 7: Hoare triple {2393#true} assume !false; {2393#true} is VALID [2020-07-08 12:41:40,229 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-08 12:41:40,229 INFO L280 TraceCheckUtils]: 9: Hoare triple {2393#true} assume 0 != #t~nondet0;havoc #t~nondet0; {2393#true} is VALID [2020-07-08 12:41:40,229 INFO L280 TraceCheckUtils]: 10: Hoare triple {2393#true} ~method_id~0 := 3; {2393#true} is VALID [2020-07-08 12:41:40,229 INFO L280 TraceCheckUtils]: 11: Hoare triple {2393#true} assume !false;~q~0 := 2;~this_state~0 := 0; {2393#true} is VALID [2020-07-08 12:41:40,230 INFO L280 TraceCheckUtils]: 12: Hoare triple {2393#true} assume !false; {2393#true} is VALID [2020-07-08 12:41:40,230 INFO L280 TraceCheckUtils]: 13: Hoare triple {2393#true} assume !(0 == ~q~0); {2393#true} is VALID [2020-07-08 12:41:40,230 INFO L280 TraceCheckUtils]: 14: Hoare triple {2393#true} assume !(1 == ~q~0); {2393#true} is VALID [2020-07-08 12:41:40,230 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-08 12:41:40,231 INFO L280 TraceCheckUtils]: 16: Hoare triple {2393#true} assume 0 != #t~nondet4;havoc #t~nondet4; {2393#true} is VALID [2020-07-08 12:41:40,231 INFO L280 TraceCheckUtils]: 17: Hoare triple {2393#true} ~method_id~0 := 1; {2393#true} is VALID [2020-07-08 12:41:40,232 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-08 12:41:40,233 INFO L280 TraceCheckUtils]: 19: Hoare triple {2398#(<= 3 main_~q~0)} assume !false; {2398#(<= 3 main_~q~0)} is VALID [2020-07-08 12:41:40,233 INFO L280 TraceCheckUtils]: 20: Hoare triple {2398#(<= 3 main_~q~0)} assume !(0 == ~q~0); {2398#(<= 3 main_~q~0)} is VALID [2020-07-08 12:41:40,234 INFO L280 TraceCheckUtils]: 21: Hoare triple {2398#(<= 3 main_~q~0)} assume !(1 == ~q~0); {2398#(<= 3 main_~q~0)} is VALID [2020-07-08 12:41:40,235 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-08 12:41:40,235 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-08 12:41:40,236 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-08 12:41:40,236 INFO L280 TraceCheckUtils]: 25: Hoare triple {2394#false} assume 0 != #t~nondet6;havoc #t~nondet6; {2394#false} is VALID [2020-07-08 12:41:40,236 INFO L280 TraceCheckUtils]: 26: Hoare triple {2394#false} ~method_id~0 := 4; {2394#false} is VALID [2020-07-08 12:41:40,236 INFO L280 TraceCheckUtils]: 27: Hoare triple {2394#false} assume 2 == ~this_state~0; {2394#false} is VALID [2020-07-08 12:41:40,237 INFO L280 TraceCheckUtils]: 28: Hoare triple {2394#false} assume !false; {2394#false} is VALID [2020-07-08 12:41:40,238 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-08 12:41:40,238 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579086979] [2020-07-08 12:41:40,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:41:40,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 12:41:40,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686992090] [2020-07-08 12:41:40,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-07-08 12:41:40,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:41:40,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 12:41:40,267 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-08 12:41:40,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 12:41:40,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:41:40,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 12:41:40,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 12:41:40,269 INFO L87 Difference]: Start difference. First operand 85 states and 117 transitions. Second operand 4 states. [2020-07-08 12:41:40,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:41:40,598 INFO L93 Difference]: Finished difference Result 134 states and 190 transitions. [2020-07-08 12:41:40,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 12:41:40,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-07-08 12:41:40,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:41:40,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:41:40,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 185 transitions. [2020-07-08 12:41:40,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:41:40,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 185 transitions. [2020-07-08 12:41:40,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 185 transitions. [2020-07-08 12:41:40,851 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-08 12:41:40,852 INFO L225 Difference]: With dead ends: 134 [2020-07-08 12:41:40,852 INFO L226 Difference]: Without dead ends: 70 [2020-07-08 12:41:40,853 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-08 12:41:40,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-08 12:41:40,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-07-08 12:41:40,895 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:41:40,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 70 states. [2020-07-08 12:41:40,896 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2020-07-08 12:41:40,896 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2020-07-08 12:41:40,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:41:40,900 INFO L93 Difference]: Finished difference Result 70 states and 96 transitions. [2020-07-08 12:41:40,900 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2020-07-08 12:41:40,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:41:40,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:41:40,901 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2020-07-08 12:41:40,901 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2020-07-08 12:41:40,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:41:40,904 INFO L93 Difference]: Finished difference Result 70 states and 96 transitions. [2020-07-08 12:41:40,904 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2020-07-08 12:41:40,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:41:40,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:41:40,905 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:41:40,905 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:41:40,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-08 12:41:40,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2020-07-08 12:41:40,908 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 96 transitions. Word has length 29 [2020-07-08 12:41:40,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:41:40,909 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 96 transitions. [2020-07-08 12:41:40,909 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 12:41:40,909 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2020-07-08 12:41:40,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-08 12:41:40,910 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:41:40,910 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-08 12:41:40,910 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 12:41:40,910 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:41:40,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:41:40,911 INFO L82 PathProgramCache]: Analyzing trace with hash -31288535, now seen corresponding path program 1 times [2020-07-08 12:41:40,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:41:40,911 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686594240] [2020-07-08 12:41:40,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:41:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:41:40,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:41:40,969 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-08 12:41:40,970 INFO L280 TraceCheckUtils]: 1: Hoare triple {2773#true} assume true; {2773#true} is VALID [2020-07-08 12:41:40,970 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2773#true} {2773#true} #376#return; {2773#true} is VALID [2020-07-08 12:41:40,972 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-08 12:41:40,972 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-08 12:41:40,972 INFO L280 TraceCheckUtils]: 2: Hoare triple {2773#true} assume true; {2773#true} is VALID [2020-07-08 12:41:40,973 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2773#true} {2773#true} #376#return; {2773#true} is VALID [2020-07-08 12:41:40,973 INFO L263 TraceCheckUtils]: 4: Hoare triple {2773#true} call #t~ret21 := main(); {2773#true} is VALID [2020-07-08 12:41:40,973 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-08 12:41:40,974 INFO L280 TraceCheckUtils]: 6: Hoare triple {2773#true} goto; {2773#true} is VALID [2020-07-08 12:41:40,974 INFO L280 TraceCheckUtils]: 7: Hoare triple {2773#true} assume !false; {2773#true} is VALID [2020-07-08 12:41:40,974 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-08 12:41:40,974 INFO L280 TraceCheckUtils]: 9: Hoare triple {2773#true} assume 0 != #t~nondet0;havoc #t~nondet0; {2773#true} is VALID [2020-07-08 12:41:40,975 INFO L280 TraceCheckUtils]: 10: Hoare triple {2773#true} ~method_id~0 := 3; {2773#true} is VALID [2020-07-08 12:41:40,975 INFO L280 TraceCheckUtils]: 11: Hoare triple {2773#true} assume !false;~q~0 := 2;~this_state~0 := 0; {2773#true} is VALID [2020-07-08 12:41:40,975 INFO L280 TraceCheckUtils]: 12: Hoare triple {2773#true} assume !false; {2773#true} is VALID [2020-07-08 12:41:40,976 INFO L280 TraceCheckUtils]: 13: Hoare triple {2773#true} assume !(0 == ~q~0); {2773#true} is VALID [2020-07-08 12:41:40,976 INFO L280 TraceCheckUtils]: 14: Hoare triple {2773#true} assume !(1 == ~q~0); {2773#true} is VALID [2020-07-08 12:41:40,976 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-08 12:41:40,976 INFO L280 TraceCheckUtils]: 16: Hoare triple {2773#true} assume 0 != #t~nondet4;havoc #t~nondet4; {2773#true} is VALID [2020-07-08 12:41:40,977 INFO L280 TraceCheckUtils]: 17: Hoare triple {2773#true} ~method_id~0 := 1; {2773#true} is VALID [2020-07-08 12:41:40,978 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-08 12:41:40,978 INFO L280 TraceCheckUtils]: 19: Hoare triple {2778#(= 2 main_~this_state~0)} assume !false; {2778#(= 2 main_~this_state~0)} is VALID [2020-07-08 12:41:40,979 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-08 12:41:40,980 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-08 12:41:40,980 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-08 12:41:40,981 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-08 12:41:40,982 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-08 12:41:40,982 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-08 12:41:40,983 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-08 12:41:40,984 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-08 12:41:40,984 INFO L280 TraceCheckUtils]: 28: Hoare triple {2778#(= 2 main_~this_state~0)} assume 2 != ~this_state~0; {2774#false} is VALID [2020-07-08 12:41:40,985 INFO L280 TraceCheckUtils]: 29: Hoare triple {2774#false} assume !false; {2774#false} is VALID [2020-07-08 12:41:40,987 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-08 12:41:40,987 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686594240] [2020-07-08 12:41:40,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:41:40,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 12:41:40,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576752577] [2020-07-08 12:41:40,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2020-07-08 12:41:40,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:41:40,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 12:41:41,017 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-08 12:41:41,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 12:41:41,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:41:41,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 12:41:41,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 12:41:41,019 INFO L87 Difference]: Start difference. First operand 70 states and 96 transitions. Second operand 4 states. [2020-07-08 12:41:41,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:41:41,589 INFO L93 Difference]: Finished difference Result 158 states and 228 transitions. [2020-07-08 12:41:41,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 12:41:41,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2020-07-08 12:41:41,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:41:41,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:41:41,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions. [2020-07-08 12:41:41,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:41:41,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions. [2020-07-08 12:41:41,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 223 transitions. [2020-07-08 12:41:41,902 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-08 12:41:41,905 INFO L225 Difference]: With dead ends: 158 [2020-07-08 12:41:41,905 INFO L226 Difference]: Without dead ends: 111 [2020-07-08 12:41:41,906 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-08 12:41:41,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-07-08 12:41:41,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2020-07-08 12:41:41,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:41:41,964 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand 99 states. [2020-07-08 12:41:41,964 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 99 states. [2020-07-08 12:41:41,964 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 99 states. [2020-07-08 12:41:41,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:41:41,970 INFO L93 Difference]: Finished difference Result 111 states and 149 transitions. [2020-07-08 12:41:41,970 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 149 transitions. [2020-07-08 12:41:41,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:41:41,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:41:41,971 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 111 states. [2020-07-08 12:41:41,971 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 111 states. [2020-07-08 12:41:41,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:41:41,976 INFO L93 Difference]: Finished difference Result 111 states and 149 transitions. [2020-07-08 12:41:41,976 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 149 transitions. [2020-07-08 12:41:41,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:41:41,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:41:41,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:41:41,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:41:41,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-07-08 12:41:41,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 138 transitions. [2020-07-08 12:41:41,981 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 138 transitions. Word has length 30 [2020-07-08 12:41:41,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:41:41,981 INFO L479 AbstractCegarLoop]: Abstraction has 99 states and 138 transitions. [2020-07-08 12:41:41,981 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 12:41:41,982 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 138 transitions. [2020-07-08 12:41:41,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-08 12:41:41,982 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:41:41,983 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-08 12:41:41,983 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-08 12:41:41,983 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:41:41,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:41:41,983 INFO L82 PathProgramCache]: Analyzing trace with hash 180888733, now seen corresponding path program 1 times [2020-07-08 12:41:41,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:41:41,984 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894665837] [2020-07-08 12:41:41,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:41:41,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:41:42,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:41:42,060 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-08 12:41:42,061 INFO L280 TraceCheckUtils]: 1: Hoare triple {3292#true} assume true; {3292#true} is VALID [2020-07-08 12:41:42,061 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3292#true} {3292#true} #376#return; {3292#true} is VALID [2020-07-08 12:41:42,062 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-08 12:41:42,063 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-08 12:41:42,063 INFO L280 TraceCheckUtils]: 2: Hoare triple {3292#true} assume true; {3292#true} is VALID [2020-07-08 12:41:42,063 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3292#true} {3292#true} #376#return; {3292#true} is VALID [2020-07-08 12:41:42,064 INFO L263 TraceCheckUtils]: 4: Hoare triple {3292#true} call #t~ret21 := main(); {3292#true} is VALID [2020-07-08 12:41:42,064 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-08 12:41:42,064 INFO L280 TraceCheckUtils]: 6: Hoare triple {3292#true} goto; {3292#true} is VALID [2020-07-08 12:41:42,064 INFO L280 TraceCheckUtils]: 7: Hoare triple {3292#true} assume !false; {3292#true} is VALID [2020-07-08 12:41:42,065 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-08 12:41:42,065 INFO L280 TraceCheckUtils]: 9: Hoare triple {3292#true} assume 0 != #t~nondet0;havoc #t~nondet0; {3292#true} is VALID [2020-07-08 12:41:42,065 INFO L280 TraceCheckUtils]: 10: Hoare triple {3292#true} ~method_id~0 := 3; {3292#true} is VALID [2020-07-08 12:41:42,065 INFO L280 TraceCheckUtils]: 11: Hoare triple {3292#true} assume !false;~q~0 := 2;~this_state~0 := 0; {3292#true} is VALID [2020-07-08 12:41:42,065 INFO L280 TraceCheckUtils]: 12: Hoare triple {3292#true} assume !false; {3292#true} is VALID [2020-07-08 12:41:42,066 INFO L280 TraceCheckUtils]: 13: Hoare triple {3292#true} assume !(0 == ~q~0); {3292#true} is VALID [2020-07-08 12:41:42,066 INFO L280 TraceCheckUtils]: 14: Hoare triple {3292#true} assume !(1 == ~q~0); {3292#true} is VALID [2020-07-08 12:41:42,066 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-08 12:41:42,066 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-08 12:41:42,067 INFO L280 TraceCheckUtils]: 17: Hoare triple {3292#true} assume 0 != #t~nondet5;havoc #t~nondet5; {3292#true} is VALID [2020-07-08 12:41:42,067 INFO L280 TraceCheckUtils]: 18: Hoare triple {3292#true} ~method_id~0 := 2; {3292#true} is VALID [2020-07-08 12:41:42,068 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-08 12:41:42,068 INFO L280 TraceCheckUtils]: 20: Hoare triple {3297#(<= 4 main_~q~0)} assume !false; {3297#(<= 4 main_~q~0)} is VALID [2020-07-08 12:41:42,069 INFO L280 TraceCheckUtils]: 21: Hoare triple {3297#(<= 4 main_~q~0)} assume !(0 == ~q~0); {3297#(<= 4 main_~q~0)} is VALID [2020-07-08 12:41:42,070 INFO L280 TraceCheckUtils]: 22: Hoare triple {3297#(<= 4 main_~q~0)} assume !(1 == ~q~0); {3297#(<= 4 main_~q~0)} is VALID [2020-07-08 12:41:42,070 INFO L280 TraceCheckUtils]: 23: Hoare triple {3297#(<= 4 main_~q~0)} assume !(2 == ~q~0); {3297#(<= 4 main_~q~0)} is VALID [2020-07-08 12:41:42,071 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-08 12:41:42,072 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-08 12:41:42,072 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-08 12:41:42,072 INFO L280 TraceCheckUtils]: 27: Hoare triple {3293#false} assume 0 != #t~nondet11;havoc #t~nondet11; {3293#false} is VALID [2020-07-08 12:41:42,072 INFO L280 TraceCheckUtils]: 28: Hoare triple {3293#false} ~method_id~0 := 4; {3293#false} is VALID [2020-07-08 12:41:42,073 INFO L280 TraceCheckUtils]: 29: Hoare triple {3293#false} assume 2 != ~this_state~0; {3293#false} is VALID [2020-07-08 12:41:42,073 INFO L280 TraceCheckUtils]: 30: Hoare triple {3293#false} assume !false; {3293#false} is VALID [2020-07-08 12:41:42,074 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-08 12:41:42,075 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894665837] [2020-07-08 12:41:42,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:41:42,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 12:41:42,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817229936] [2020-07-08 12:41:42,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2020-07-08 12:41:42,076 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:41:42,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 12:41:42,112 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-08 12:41:42,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 12:41:42,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:41:42,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 12:41:42,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 12:41:42,113 INFO L87 Difference]: Start difference. First operand 99 states and 138 transitions. Second operand 4 states. [2020-07-08 12:41:42,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:41:42,512 INFO L93 Difference]: Finished difference Result 166 states and 232 transitions. [2020-07-08 12:41:42,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 12:41:42,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2020-07-08 12:41:42,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:41:42,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:41:42,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2020-07-08 12:41:42,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:41:42,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2020-07-08 12:41:42,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 159 transitions. [2020-07-08 12:41:42,704 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-08 12:41:42,707 INFO L225 Difference]: With dead ends: 166 [2020-07-08 12:41:42,707 INFO L226 Difference]: Without dead ends: 92 [2020-07-08 12:41:42,707 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-08 12:41:42,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-07-08 12:41:42,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-07-08 12:41:42,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:41:42,765 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 92 states. [2020-07-08 12:41:42,766 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 92 states. [2020-07-08 12:41:42,766 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 92 states. [2020-07-08 12:41:42,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:41:42,770 INFO L93 Difference]: Finished difference Result 92 states and 120 transitions. [2020-07-08 12:41:42,771 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 120 transitions. [2020-07-08 12:41:42,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:41:42,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:41:42,771 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 92 states. [2020-07-08 12:41:42,771 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 92 states. [2020-07-08 12:41:42,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:41:42,775 INFO L93 Difference]: Finished difference Result 92 states and 120 transitions. [2020-07-08 12:41:42,775 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 120 transitions. [2020-07-08 12:41:42,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:41:42,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:41:42,776 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:41:42,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:41:42,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-07-08 12:41:42,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 120 transitions. [2020-07-08 12:41:42,779 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 120 transitions. Word has length 31 [2020-07-08 12:41:42,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:41:42,780 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 120 transitions. [2020-07-08 12:41:42,780 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 12:41:42,780 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 120 transitions. [2020-07-08 12:41:42,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-08 12:41:42,781 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:41:42,781 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-08 12:41:42,781 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-08 12:41:42,781 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:41:42,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:41:42,782 INFO L82 PathProgramCache]: Analyzing trace with hash 317242888, now seen corresponding path program 1 times [2020-07-08 12:41:42,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:41:42,782 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475389590] [2020-07-08 12:41:42,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:41:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:41:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:41:42,859 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-08 12:41:42,859 INFO L280 TraceCheckUtils]: 1: Hoare triple {3779#true} assume true; {3779#true} is VALID [2020-07-08 12:41:42,859 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3779#true} {3779#true} #376#return; {3779#true} is VALID [2020-07-08 12:41:42,860 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-08 12:41:42,861 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-08 12:41:42,861 INFO L280 TraceCheckUtils]: 2: Hoare triple {3779#true} assume true; {3779#true} is VALID [2020-07-08 12:41:42,861 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3779#true} {3779#true} #376#return; {3779#true} is VALID [2020-07-08 12:41:42,861 INFO L263 TraceCheckUtils]: 4: Hoare triple {3779#true} call #t~ret21 := main(); {3779#true} is VALID [2020-07-08 12:41:42,861 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-08 12:41:42,862 INFO L280 TraceCheckUtils]: 6: Hoare triple {3779#true} goto; {3779#true} is VALID [2020-07-08 12:41:42,862 INFO L280 TraceCheckUtils]: 7: Hoare triple {3779#true} assume !false; {3779#true} is VALID [2020-07-08 12:41:42,862 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-08 12:41:42,862 INFO L280 TraceCheckUtils]: 9: Hoare triple {3779#true} assume 0 != #t~nondet0;havoc #t~nondet0; {3779#true} is VALID [2020-07-08 12:41:42,862 INFO L280 TraceCheckUtils]: 10: Hoare triple {3779#true} ~method_id~0 := 3; {3779#true} is VALID [2020-07-08 12:41:42,862 INFO L280 TraceCheckUtils]: 11: Hoare triple {3779#true} assume !false;~q~0 := 2;~this_state~0 := 0; {3779#true} is VALID [2020-07-08 12:41:42,863 INFO L280 TraceCheckUtils]: 12: Hoare triple {3779#true} assume !false; {3779#true} is VALID [2020-07-08 12:41:42,863 INFO L280 TraceCheckUtils]: 13: Hoare triple {3779#true} assume !(0 == ~q~0); {3779#true} is VALID [2020-07-08 12:41:42,863 INFO L280 TraceCheckUtils]: 14: Hoare triple {3779#true} assume !(1 == ~q~0); {3779#true} is VALID [2020-07-08 12:41:42,863 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-08 12:41:42,863 INFO L280 TraceCheckUtils]: 16: Hoare triple {3779#true} assume 0 != #t~nondet4;havoc #t~nondet4; {3779#true} is VALID [2020-07-08 12:41:42,864 INFO L280 TraceCheckUtils]: 17: Hoare triple {3779#true} ~method_id~0 := 1; {3779#true} is VALID [2020-07-08 12:41:42,865 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-08 12:41:42,866 INFO L280 TraceCheckUtils]: 19: Hoare triple {3784#(= 3 main_~q~0)} assume !false; {3784#(= 3 main_~q~0)} is VALID [2020-07-08 12:41:42,867 INFO L280 TraceCheckUtils]: 20: Hoare triple {3784#(= 3 main_~q~0)} assume !(0 == ~q~0); {3784#(= 3 main_~q~0)} is VALID [2020-07-08 12:41:42,868 INFO L280 TraceCheckUtils]: 21: Hoare triple {3784#(= 3 main_~q~0)} assume !(1 == ~q~0); {3784#(= 3 main_~q~0)} is VALID [2020-07-08 12:41:42,869 INFO L280 TraceCheckUtils]: 22: Hoare triple {3784#(= 3 main_~q~0)} assume !(2 == ~q~0); {3784#(= 3 main_~q~0)} is VALID [2020-07-08 12:41:42,869 INFO L280 TraceCheckUtils]: 23: Hoare triple {3784#(= 3 main_~q~0)} assume !(3 == ~q~0); {3780#false} is VALID [2020-07-08 12:41:42,870 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-08 12:41:42,870 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-08 12:41:42,870 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-08 12:41:42,870 INFO L280 TraceCheckUtils]: 27: Hoare triple {3780#false} assume 0 != #t~nondet17;havoc #t~nondet17; {3780#false} is VALID [2020-07-08 12:41:42,871 INFO L280 TraceCheckUtils]: 28: Hoare triple {3780#false} ~method_id~0 := 4; {3780#false} is VALID [2020-07-08 12:41:42,871 INFO L280 TraceCheckUtils]: 29: Hoare triple {3780#false} assume 2 == ~this_state~0; {3780#false} is VALID [2020-07-08 12:41:42,871 INFO L280 TraceCheckUtils]: 30: Hoare triple {3780#false} assume !false; {3780#false} is VALID [2020-07-08 12:41:42,872 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-08 12:41:42,873 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475389590] [2020-07-08 12:41:42,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:41:42,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 12:41:42,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678858386] [2020-07-08 12:41:42,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2020-07-08 12:41:42,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:41:42,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 12:41:42,898 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-08 12:41:42,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 12:41:42,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:41:42,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 12:41:42,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 12:41:42,900 INFO L87 Difference]: Start difference. First operand 92 states and 120 transitions. Second operand 4 states. [2020-07-08 12:41:43,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:41:43,265 INFO L93 Difference]: Finished difference Result 139 states and 184 transitions. [2020-07-08 12:41:43,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 12:41:43,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2020-07-08 12:41:43,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:41:43,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:41:43,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2020-07-08 12:41:43,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:41:43,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2020-07-08 12:41:43,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 146 transitions. [2020-07-08 12:41:43,479 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-08 12:41:43,481 INFO L225 Difference]: With dead ends: 139 [2020-07-08 12:41:43,482 INFO L226 Difference]: Without dead ends: 72 [2020-07-08 12:41:43,483 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-08 12:41:43,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-07-08 12:41:43,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-07-08 12:41:43,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:41:43,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 72 states. [2020-07-08 12:41:43,528 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2020-07-08 12:41:43,528 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2020-07-08 12:41:43,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:41:43,531 INFO L93 Difference]: Finished difference Result 72 states and 91 transitions. [2020-07-08 12:41:43,532 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2020-07-08 12:41:43,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:41:43,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:41:43,532 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2020-07-08 12:41:43,532 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2020-07-08 12:41:43,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:41:43,534 INFO L93 Difference]: Finished difference Result 72 states and 91 transitions. [2020-07-08 12:41:43,534 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2020-07-08 12:41:43,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:41:43,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:41:43,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:41:43,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:41:43,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-07-08 12:41:43,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 91 transitions. [2020-07-08 12:41:43,537 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 91 transitions. Word has length 31 [2020-07-08 12:41:43,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:41:43,537 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 91 transitions. [2020-07-08 12:41:43,538 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 12:41:43,538 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2020-07-08 12:41:43,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-08 12:41:43,539 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:41:43,539 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-08 12:41:43,539 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-08 12:41:43,539 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:41:43,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:41:43,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1695196396, now seen corresponding path program 1 times [2020-07-08 12:41:43,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:41:43,540 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013548173] [2020-07-08 12:41:43,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:41:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:41:43,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:41:43,644 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-08 12:41:43,644 INFO L280 TraceCheckUtils]: 1: Hoare triple {4175#true} assume true; {4175#true} is VALID [2020-07-08 12:41:43,644 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4175#true} {4175#true} #376#return; {4175#true} is VALID [2020-07-08 12:41:43,645 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-08 12:41:43,645 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-08 12:41:43,646 INFO L280 TraceCheckUtils]: 2: Hoare triple {4175#true} assume true; {4175#true} is VALID [2020-07-08 12:41:43,646 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4175#true} {4175#true} #376#return; {4175#true} is VALID [2020-07-08 12:41:43,646 INFO L263 TraceCheckUtils]: 4: Hoare triple {4175#true} call #t~ret21 := main(); {4175#true} is VALID [2020-07-08 12:41:43,646 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-08 12:41:43,646 INFO L280 TraceCheckUtils]: 6: Hoare triple {4175#true} goto; {4175#true} is VALID [2020-07-08 12:41:43,646 INFO L280 TraceCheckUtils]: 7: Hoare triple {4175#true} assume !false; {4175#true} is VALID [2020-07-08 12:41:43,647 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-08 12:41:43,647 INFO L280 TraceCheckUtils]: 9: Hoare triple {4175#true} assume 0 != #t~nondet0;havoc #t~nondet0; {4175#true} is VALID [2020-07-08 12:41:43,647 INFO L280 TraceCheckUtils]: 10: Hoare triple {4175#true} ~method_id~0 := 3; {4175#true} is VALID [2020-07-08 12:41:43,647 INFO L280 TraceCheckUtils]: 11: Hoare triple {4175#true} assume !false;~q~0 := 2;~this_state~0 := 0; {4175#true} is VALID [2020-07-08 12:41:43,647 INFO L280 TraceCheckUtils]: 12: Hoare triple {4175#true} assume !false; {4175#true} is VALID [2020-07-08 12:41:43,648 INFO L280 TraceCheckUtils]: 13: Hoare triple {4175#true} assume !(0 == ~q~0); {4175#true} is VALID [2020-07-08 12:41:43,648 INFO L280 TraceCheckUtils]: 14: Hoare triple {4175#true} assume !(1 == ~q~0); {4175#true} is VALID [2020-07-08 12:41:43,648 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-08 12:41:43,648 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-08 12:41:43,649 INFO L280 TraceCheckUtils]: 17: Hoare triple {4175#true} assume 0 != #t~nondet5;havoc #t~nondet5; {4175#true} is VALID [2020-07-08 12:41:43,649 INFO L280 TraceCheckUtils]: 18: Hoare triple {4175#true} ~method_id~0 := 2; {4175#true} is VALID [2020-07-08 12:41:43,655 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-08 12:41:43,656 INFO L280 TraceCheckUtils]: 20: Hoare triple {4180#(<= 3 main_~this_state~0)} assume !false; {4180#(<= 3 main_~this_state~0)} is VALID [2020-07-08 12:41:43,657 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-08 12:41:43,658 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-08 12:41:43,659 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-08 12:41:43,660 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-08 12:41:43,661 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-08 12:41:43,661 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-08 12:41:43,662 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-08 12:41:43,663 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-08 12:41:43,664 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-08 12:41:43,664 INFO L280 TraceCheckUtils]: 30: Hoare triple {4180#(<= 3 main_~this_state~0)} assume 2 == ~this_state~0; {4176#false} is VALID [2020-07-08 12:41:43,665 INFO L280 TraceCheckUtils]: 31: Hoare triple {4176#false} assume !false; {4176#false} is VALID [2020-07-08 12:41:43,666 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-08 12:41:43,666 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013548173] [2020-07-08 12:41:43,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:41:43,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 12:41:43,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129391835] [2020-07-08 12:41:43,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2020-07-08 12:41:43,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:41:43,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 12:41:43,710 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-08 12:41:43,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 12:41:43,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:41:43,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 12:41:43,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 12:41:43,711 INFO L87 Difference]: Start difference. First operand 72 states and 91 transitions. Second operand 4 states. [2020-07-08 12:41:44,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:41:44,081 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2020-07-08 12:41:44,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 12:41:44,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2020-07-08 12:41:44,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:41:44,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:41:44,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2020-07-08 12:41:44,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:41:44,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2020-07-08 12:41:44,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 88 transitions. [2020-07-08 12:41:44,214 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-08 12:41:44,216 INFO L225 Difference]: With dead ends: 74 [2020-07-08 12:41:44,216 INFO L226 Difference]: Without dead ends: 70 [2020-07-08 12:41:44,217 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-08 12:41:44,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-08 12:41:44,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-07-08 12:41:44,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:41:44,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 70 states. [2020-07-08 12:41:44,265 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2020-07-08 12:41:44,266 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2020-07-08 12:41:44,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:41:44,268 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2020-07-08 12:41:44,268 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2020-07-08 12:41:44,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:41:44,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:41:44,268 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2020-07-08 12:41:44,269 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2020-07-08 12:41:44,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:41:44,270 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2020-07-08 12:41:44,271 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2020-07-08 12:41:44,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:41:44,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:41:44,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:41:44,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:41:44,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-08 12:41:44,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2020-07-08 12:41:44,273 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 32 [2020-07-08 12:41:44,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:41:44,274 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2020-07-08 12:41:44,274 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 12:41:44,274 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2020-07-08 12:41:44,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-08 12:41:44,276 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:41:44,277 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-08 12:41:44,277 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-08 12:41:44,277 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:41:44,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:41:44,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1000030502, now seen corresponding path program 1 times [2020-07-08 12:41:44,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:41:44,278 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519056910] [2020-07-08 12:41:44,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:41:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:41:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:41:44,397 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-08 12:41:44,398 INFO L280 TraceCheckUtils]: 1: Hoare triple {4494#true} assume true; {4494#true} is VALID [2020-07-08 12:41:44,399 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4494#true} {4494#true} #376#return; {4494#true} is VALID [2020-07-08 12:41:44,400 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-08 12:41:44,400 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-08 12:41:44,400 INFO L280 TraceCheckUtils]: 2: Hoare triple {4494#true} assume true; {4494#true} is VALID [2020-07-08 12:41:44,401 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4494#true} {4494#true} #376#return; {4494#true} is VALID [2020-07-08 12:41:44,401 INFO L263 TraceCheckUtils]: 4: Hoare triple {4494#true} call #t~ret21 := main(); {4494#true} is VALID [2020-07-08 12:41:44,401 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-08 12:41:44,401 INFO L280 TraceCheckUtils]: 6: Hoare triple {4494#true} goto; {4494#true} is VALID [2020-07-08 12:41:44,402 INFO L280 TraceCheckUtils]: 7: Hoare triple {4494#true} assume !false; {4494#true} is VALID [2020-07-08 12:41:44,402 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-08 12:41:44,402 INFO L280 TraceCheckUtils]: 9: Hoare triple {4494#true} assume 0 != #t~nondet0;havoc #t~nondet0; {4494#true} is VALID [2020-07-08 12:41:44,402 INFO L280 TraceCheckUtils]: 10: Hoare triple {4494#true} ~method_id~0 := 3; {4494#true} is VALID [2020-07-08 12:41:44,403 INFO L280 TraceCheckUtils]: 11: Hoare triple {4494#true} assume !false;~q~0 := 2;~this_state~0 := 0; {4494#true} is VALID [2020-07-08 12:41:44,403 INFO L280 TraceCheckUtils]: 12: Hoare triple {4494#true} assume !false; {4494#true} is VALID [2020-07-08 12:41:44,403 INFO L280 TraceCheckUtils]: 13: Hoare triple {4494#true} assume !(0 == ~q~0); {4494#true} is VALID [2020-07-08 12:41:44,403 INFO L280 TraceCheckUtils]: 14: Hoare triple {4494#true} assume !(1 == ~q~0); {4494#true} is VALID [2020-07-08 12:41:44,403 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-08 12:41:44,404 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-08 12:41:44,404 INFO L280 TraceCheckUtils]: 17: Hoare triple {4494#true} assume 0 != #t~nondet5;havoc #t~nondet5; {4494#true} is VALID [2020-07-08 12:41:44,404 INFO L280 TraceCheckUtils]: 18: Hoare triple {4494#true} ~method_id~0 := 2; {4494#true} is VALID [2020-07-08 12:41:44,406 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-08 12:41:44,406 INFO L280 TraceCheckUtils]: 20: Hoare triple {4499#(= 3 main_~this_state~0)} assume !false; {4499#(= 3 main_~this_state~0)} is VALID [2020-07-08 12:41:44,407 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-08 12:41:44,408 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-08 12:41:44,409 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-08 12:41:44,409 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-08 12:41:44,410 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-08 12:41:44,411 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-08 12:41:44,412 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-08 12:41:44,412 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-08 12:41:44,415 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-08 12:41:44,416 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-08 12:41:44,417 INFO L280 TraceCheckUtils]: 31: Hoare triple {4499#(= 3 main_~this_state~0)} assume 3 != ~this_state~0; {4495#false} is VALID [2020-07-08 12:41:44,417 INFO L280 TraceCheckUtils]: 32: Hoare triple {4495#false} assume !false; {4495#false} is VALID [2020-07-08 12:41:44,419 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-08 12:41:44,420 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519056910] [2020-07-08 12:41:44,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:41:44,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 12:41:44,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289153925] [2020-07-08 12:41:44,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-07-08 12:41:44,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:41:44,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 12:41:44,452 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-08 12:41:44,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 12:41:44,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:41:44,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 12:41:44,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 12:41:44,454 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand 4 states. [2020-07-08 12:41:44,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:41:44,743 INFO L93 Difference]: Finished difference Result 111 states and 143 transitions. [2020-07-08 12:41:44,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 12:41:44,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-07-08 12:41:44,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:41:44,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:41:44,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2020-07-08 12:41:44,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:41:44,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2020-07-08 12:41:44,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 135 transitions. [2020-07-08 12:41:44,919 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-08 12:41:44,919 INFO L225 Difference]: With dead ends: 111 [2020-07-08 12:41:44,919 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 12:41:44,920 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-08 12:41:44,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 12:41:44,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 12:41:44,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:41:44,921 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 12:41:44,922 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:41:44,922 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:41:44,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:41:44,922 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:41:44,922 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:41:44,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:41:44,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:41:44,923 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:41:44,923 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:41:44,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:41:44,923 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:41:44,923 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:41:44,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:41:44,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:41:44,924 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:41:44,924 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:41:44,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 12:41:44,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 12:41:44,924 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2020-07-08 12:41:44,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:41:44,925 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 12:41:44,925 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 12:41:44,925 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:41:44,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:41:44,925 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-08 12:41:44,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 12:41:45,138 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-08 12:41:45,139 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-08 12:41:45,139 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:41:45,139 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:41:45,139 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 12:41:45,139 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 12:41:45,139 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-08 12:41:45,140 INFO L268 CegarLoopResult]: For program point L316(lines 316 331) no Hoare annotation was computed. [2020-07-08 12:41:45,140 INFO L268 CegarLoopResult]: For program point L283(lines 283 382) no Hoare annotation was computed. [2020-07-08 12:41:45,140 INFO L268 CegarLoopResult]: For program point L250(lines 250 261) no Hoare annotation was computed. [2020-07-08 12:41:45,140 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 13 390) no Hoare annotation was computed. [2020-07-08 12:41:45,140 INFO L268 CegarLoopResult]: For program point L184(lines 184 199) no Hoare annotation was computed. [2020-07-08 12:41:45,140 INFO L268 CegarLoopResult]: For program point L118(lines 118 129) no Hoare annotation was computed. [2020-07-08 12:41:45,140 INFO L268 CegarLoopResult]: For program point L366(lines 366 377) no Hoare annotation was computed. [2020-07-08 12:41:45,140 INFO L268 CegarLoopResult]: For program point L300(lines 300 315) no Hoare annotation was computed. [2020-07-08 12:41:45,140 INFO L268 CegarLoopResult]: For program point L234(lines 234 245) no Hoare annotation was computed. [2020-07-08 12:41:45,140 INFO L268 CegarLoopResult]: For program point L102(lines 102 113) no Hoare annotation was computed. [2020-07-08 12:41:45,141 INFO L268 CegarLoopResult]: For program point L350(lines 350 361) no Hoare annotation was computed. [2020-07-08 12:41:45,141 INFO L268 CegarLoopResult]: For program point L284(lines 284 299) no Hoare annotation was computed. [2020-07-08 12:41:45,141 INFO L268 CegarLoopResult]: For program point L218(lines 218 229) no Hoare annotation was computed. [2020-07-08 12:41:45,141 INFO L268 CegarLoopResult]: For program point L86(lines 86 88) no Hoare annotation was computed. [2020-07-08 12:41:45,141 INFO L268 CegarLoopResult]: For program point L334(lines 334 345) no Hoare annotation was computed. [2020-07-08 12:41:45,141 INFO L268 CegarLoopResult]: For program point L202(lines 202 213) no Hoare annotation was computed. [2020-07-08 12:41:45,143 INFO L268 CegarLoopResult]: For program point L70(lines 70 72) no Hoare annotation was computed. [2020-07-08 12:41:45,143 INFO L268 CegarLoopResult]: For program point L318(lines 318 329) no Hoare annotation was computed. [2020-07-08 12:41:45,143 INFO L268 CegarLoopResult]: For program point L186(lines 186 197) no Hoare annotation was computed. [2020-07-08 12:41:45,143 INFO L268 CegarLoopResult]: For program point L54(lines 54 56) no Hoare annotation was computed. [2020-07-08 12:41:45,143 INFO L268 CegarLoopResult]: For program point L302(lines 302 313) no Hoare annotation was computed. [2020-07-08 12:41:45,143 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 13 390) no Hoare annotation was computed. [2020-07-08 12:41:45,144 INFO L268 CegarLoopResult]: For program point L170(lines 170 172) no Hoare annotation was computed. [2020-07-08 12:41:45,145 INFO L268 CegarLoopResult]: For program point L286(lines 286 297) no Hoare annotation was computed. [2020-07-08 12:41:45,145 INFO L268 CegarLoopResult]: For program point L154(lines 154 156) no Hoare annotation was computed. [2020-07-08 12:41:45,146 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-08 12:41:45,146 INFO L268 CegarLoopResult]: For program point L22-3(lines 22 385) no Hoare annotation was computed. [2020-07-08 12:41:45,146 INFO L268 CegarLoopResult]: For program point L270(lines 270 272) no Hoare annotation was computed. [2020-07-08 12:41:45,146 INFO L268 CegarLoopResult]: For program point L138(lines 138 140) no Hoare annotation was computed. [2020-07-08 12:41:45,146 INFO L268 CegarLoopResult]: For program point L254(lines 254 256) no Hoare annotation was computed. [2020-07-08 12:41:45,146 INFO L268 CegarLoopResult]: For program point L122(lines 122 124) no Hoare annotation was computed. [2020-07-08 12:41:45,146 INFO L268 CegarLoopResult]: For program point L370(lines 370 372) no Hoare annotation was computed. [2020-07-08 12:41:45,146 INFO L268 CegarLoopResult]: For program point L238(lines 238 240) no Hoare annotation was computed. [2020-07-08 12:41:45,147 INFO L268 CegarLoopResult]: For program point L106(lines 106 108) no Hoare annotation was computed. [2020-07-08 12:41:45,147 INFO L268 CegarLoopResult]: For program point L354(lines 354 356) no Hoare annotation was computed. [2020-07-08 12:41:45,147 INFO L268 CegarLoopResult]: For program point L222(lines 222 224) no Hoare annotation was computed. [2020-07-08 12:41:45,147 INFO L264 CegarLoopResult]: At program point L371(lines 13 390) the Hoare annotation is: false [2020-07-08 12:41:45,147 INFO L268 CegarLoopResult]: For program point L338(lines 338 340) no Hoare annotation was computed. [2020-07-08 12:41:45,147 INFO L268 CegarLoopResult]: For program point L206(lines 206 208) no Hoare annotation was computed. [2020-07-08 12:41:45,147 INFO L268 CegarLoopResult]: For program point L322(lines 322 324) no Hoare annotation was computed. [2020-07-08 12:41:45,147 INFO L268 CegarLoopResult]: For program point L190(lines 190 192) no Hoare annotation was computed. [2020-07-08 12:41:45,148 INFO L268 CegarLoopResult]: For program point L306(lines 306 308) no Hoare annotation was computed. [2020-07-08 12:41:45,148 INFO L268 CegarLoopResult]: For program point L290(lines 290 292) no Hoare annotation was computed. [2020-07-08 12:41:45,148 INFO L268 CegarLoopResult]: For program point L27(lines 27 46) no Hoare annotation was computed. [2020-07-08 12:41:45,148 INFO L268 CegarLoopResult]: For program point L28(lines 28 43) no Hoare annotation was computed. [2020-07-08 12:41:45,148 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 389) no Hoare annotation was computed. [2020-07-08 12:41:45,149 INFO L268 CegarLoopResult]: For program point L30(lines 30 41) no Hoare annotation was computed. [2020-07-08 12:41:45,150 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 390) the Hoare annotation is: true [2020-07-08 12:41:45,150 INFO L268 CegarLoopResult]: For program point L80(lines 80 95) no Hoare annotation was computed. [2020-07-08 12:41:45,150 INFO L268 CegarLoopResult]: For program point L47(lines 47 98) no Hoare annotation was computed. [2020-07-08 12:41:45,150 INFO L268 CegarLoopResult]: For program point L64(lines 64 79) no Hoare annotation was computed. [2020-07-08 12:41:45,150 INFO L268 CegarLoopResult]: For program point L48(lines 48 63) no Hoare annotation was computed. [2020-07-08 12:41:45,150 INFO L268 CegarLoopResult]: For program point L164(lines 164 179) no Hoare annotation was computed. [2020-07-08 12:41:45,150 INFO L268 CegarLoopResult]: For program point L148(lines 148 163) no Hoare annotation was computed. [2020-07-08 12:41:45,150 INFO L268 CegarLoopResult]: For program point L82(lines 82 93) no Hoare annotation was computed. [2020-07-08 12:41:45,150 INFO L268 CegarLoopResult]: For program point L264(lines 264 279) no Hoare annotation was computed. [2020-07-08 12:41:45,151 INFO L268 CegarLoopResult]: For program point L132(lines 132 147) no Hoare annotation was computed. [2020-07-08 12:41:45,151 INFO L268 CegarLoopResult]: For program point L99(lines 99 182) no Hoare annotation was computed. [2020-07-08 12:41:45,151 INFO L268 CegarLoopResult]: For program point L66(lines 66 77) no Hoare annotation was computed. [2020-07-08 12:41:45,151 INFO L268 CegarLoopResult]: For program point L248(lines 248 263) no Hoare annotation was computed. [2020-07-08 12:41:45,151 INFO L268 CegarLoopResult]: For program point L116(lines 116 131) no Hoare annotation was computed. [2020-07-08 12:41:45,151 INFO L268 CegarLoopResult]: For program point L50(lines 50 61) no Hoare annotation was computed. [2020-07-08 12:41:45,151 INFO L268 CegarLoopResult]: For program point L364(lines 364 379) no Hoare annotation was computed. [2020-07-08 12:41:45,151 INFO L268 CegarLoopResult]: For program point L232(lines 232 247) no Hoare annotation was computed. [2020-07-08 12:41:45,151 INFO L268 CegarLoopResult]: For program point L166(lines 166 177) no Hoare annotation was computed. [2020-07-08 12:41:45,151 INFO L268 CegarLoopResult]: For program point L100(lines 100 115) no Hoare annotation was computed. [2020-07-08 12:41:45,152 INFO L268 CegarLoopResult]: For program point L34(lines 34 36) no Hoare annotation was computed. [2020-07-08 12:41:45,152 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-08 12:41:45,152 INFO L268 CegarLoopResult]: For program point L348(lines 348 363) no Hoare annotation was computed. [2020-07-08 12:41:45,152 INFO L268 CegarLoopResult]: For program point L216(lines 216 231) no Hoare annotation was computed. [2020-07-08 12:41:45,152 INFO L268 CegarLoopResult]: For program point L183(lines 183 282) no Hoare annotation was computed. [2020-07-08 12:41:45,152 INFO L268 CegarLoopResult]: For program point L150(lines 150 161) no Hoare annotation was computed. [2020-07-08 12:41:45,152 INFO L268 CegarLoopResult]: For program point L332(lines 332 347) no Hoare annotation was computed. [2020-07-08 12:41:45,153 INFO L268 CegarLoopResult]: For program point L266(lines 266 277) no Hoare annotation was computed. [2020-07-08 12:41:45,153 INFO L268 CegarLoopResult]: For program point L200(lines 200 215) no Hoare annotation was computed. [2020-07-08 12:41:45,153 INFO L268 CegarLoopResult]: For program point L134(lines 134 145) no Hoare annotation was computed. [2020-07-08 12:41:45,156 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:41:45,158 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:41:45,158 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:41:45,159 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2020-07-08 12:41:45,159 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:41:45,159 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:41:45,159 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2020-07-08 12:41:45,159 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-08 12:41:45,159 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2020-07-08 12:41:45,160 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-08 12:41:45,160 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-08 12:41:45,160 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:41:45,160 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-08 12:41:45,160 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-08 12:41:45,161 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-08 12:41:45,161 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-08 12:41:45,161 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:41:45,161 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-08 12:41:45,161 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-08 12:41:45,162 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2020-07-08 12:41:45,162 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2020-07-08 12:41:45,162 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2020-07-08 12:41:45,162 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2020-07-08 12:41:45,162 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-08 12:41:45,162 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-08 12:41:45,163 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-08 12:41:45,163 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-08 12:41:45,163 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2020-07-08 12:41:45,163 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2020-07-08 12:41:45,163 WARN L170 areAnnotationChecker]: L100 has no Hoare annotation [2020-07-08 12:41:45,163 WARN L170 areAnnotationChecker]: L100 has no Hoare annotation [2020-07-08 12:41:45,163 WARN L170 areAnnotationChecker]: L183 has no Hoare annotation [2020-07-08 12:41:45,163 WARN L170 areAnnotationChecker]: L183 has no Hoare annotation [2020-07-08 12:41:45,164 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2020-07-08 12:41:45,164 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:41:45,164 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-08 12:41:45,164 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-08 12:41:45,164 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2020-07-08 12:41:45,164 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2020-07-08 12:41:45,164 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2020-07-08 12:41:45,164 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2020-07-08 12:41:45,165 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2020-07-08 12:41:45,165 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2020-07-08 12:41:45,165 WARN L170 areAnnotationChecker]: L116 has no Hoare annotation [2020-07-08 12:41:45,165 WARN L170 areAnnotationChecker]: L116 has no Hoare annotation [2020-07-08 12:41:45,165 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2020-07-08 12:41:45,165 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2020-07-08 12:41:45,165 WARN L170 areAnnotationChecker]: L283 has no Hoare annotation [2020-07-08 12:41:45,165 WARN L170 areAnnotationChecker]: L283 has no Hoare annotation [2020-07-08 12:41:45,165 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2020-07-08 12:41:45,165 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2020-07-08 12:41:45,165 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2020-07-08 12:41:45,166 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2020-07-08 12:41:45,166 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2020-07-08 12:41:45,166 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2020-07-08 12:41:45,166 WARN L170 areAnnotationChecker]: L118 has no Hoare annotation [2020-07-08 12:41:45,166 WARN L170 areAnnotationChecker]: L118 has no Hoare annotation [2020-07-08 12:41:45,166 WARN L170 areAnnotationChecker]: L132 has no Hoare annotation [2020-07-08 12:41:45,166 WARN L170 areAnnotationChecker]: L132 has no Hoare annotation [2020-07-08 12:41:45,166 WARN L170 areAnnotationChecker]: L186 has no Hoare annotation [2020-07-08 12:41:45,166 WARN L170 areAnnotationChecker]: L186 has no Hoare annotation [2020-07-08 12:41:45,167 WARN L170 areAnnotationChecker]: L200 has no Hoare annotation [2020-07-08 12:41:45,167 WARN L170 areAnnotationChecker]: L200 has no Hoare annotation [2020-07-08 12:41:45,167 WARN L170 areAnnotationChecker]: L284 has no Hoare annotation [2020-07-08 12:41:45,167 WARN L170 areAnnotationChecker]: L284 has no Hoare annotation [2020-07-08 12:41:45,167 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2020-07-08 12:41:45,167 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2020-07-08 12:41:45,167 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2020-07-08 12:41:45,167 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2020-07-08 12:41:45,167 WARN L170 areAnnotationChecker]: L134 has no Hoare annotation [2020-07-08 12:41:45,167 WARN L170 areAnnotationChecker]: L134 has no Hoare annotation [2020-07-08 12:41:45,168 WARN L170 areAnnotationChecker]: L148 has no Hoare annotation [2020-07-08 12:41:45,168 WARN L170 areAnnotationChecker]: L148 has no Hoare annotation [2020-07-08 12:41:45,168 WARN L170 areAnnotationChecker]: L190 has no Hoare annotation [2020-07-08 12:41:45,168 WARN L170 areAnnotationChecker]: L190 has no Hoare annotation [2020-07-08 12:41:45,168 WARN L170 areAnnotationChecker]: L202 has no Hoare annotation [2020-07-08 12:41:45,168 WARN L170 areAnnotationChecker]: L202 has no Hoare annotation [2020-07-08 12:41:45,168 WARN L170 areAnnotationChecker]: L216 has no Hoare annotation [2020-07-08 12:41:45,168 WARN L170 areAnnotationChecker]: L216 has no Hoare annotation [2020-07-08 12:41:45,168 WARN L170 areAnnotationChecker]: L286 has no Hoare annotation [2020-07-08 12:41:45,168 WARN L170 areAnnotationChecker]: L286 has no Hoare annotation [2020-07-08 12:41:45,168 WARN L170 areAnnotationChecker]: L300 has no Hoare annotation [2020-07-08 12:41:45,169 WARN L170 areAnnotationChecker]: L300 has no Hoare annotation [2020-07-08 12:41:45,169 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2020-07-08 12:41:45,169 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2020-07-08 12:41:45,169 WARN L170 areAnnotationChecker]: L150 has no Hoare annotation [2020-07-08 12:41:45,169 WARN L170 areAnnotationChecker]: L150 has no Hoare annotation [2020-07-08 12:41:45,169 WARN L170 areAnnotationChecker]: L164 has no Hoare annotation [2020-07-08 12:41:45,169 WARN L170 areAnnotationChecker]: L164 has no Hoare annotation [2020-07-08 12:41:45,169 WARN L170 areAnnotationChecker]: L206 has no Hoare annotation [2020-07-08 12:41:45,169 WARN L170 areAnnotationChecker]: L206 has no Hoare annotation [2020-07-08 12:41:45,170 WARN L170 areAnnotationChecker]: L218 has no Hoare annotation [2020-07-08 12:41:45,170 WARN L170 areAnnotationChecker]: L218 has no Hoare annotation [2020-07-08 12:41:45,170 WARN L170 areAnnotationChecker]: L232 has no Hoare annotation [2020-07-08 12:41:45,170 WARN L170 areAnnotationChecker]: L232 has no Hoare annotation [2020-07-08 12:41:45,170 WARN L170 areAnnotationChecker]: L290 has no Hoare annotation [2020-07-08 12:41:45,170 WARN L170 areAnnotationChecker]: L290 has no Hoare annotation [2020-07-08 12:41:45,170 WARN L170 areAnnotationChecker]: L302 has no Hoare annotation [2020-07-08 12:41:45,170 WARN L170 areAnnotationChecker]: L302 has no Hoare annotation [2020-07-08 12:41:45,170 WARN L170 areAnnotationChecker]: L316 has no Hoare annotation [2020-07-08 12:41:45,170 WARN L170 areAnnotationChecker]: L316 has no Hoare annotation [2020-07-08 12:41:45,170 WARN L170 areAnnotationChecker]: L154 has no Hoare annotation [2020-07-08 12:41:45,171 WARN L170 areAnnotationChecker]: L154 has no Hoare annotation [2020-07-08 12:41:45,171 WARN L170 areAnnotationChecker]: L166 has no Hoare annotation [2020-07-08 12:41:45,171 WARN L170 areAnnotationChecker]: L166 has no Hoare annotation [2020-07-08 12:41:45,171 WARN L170 areAnnotationChecker]: L222 has no Hoare annotation [2020-07-08 12:41:45,171 WARN L170 areAnnotationChecker]: L222 has no Hoare annotation [2020-07-08 12:41:45,171 WARN L170 areAnnotationChecker]: L234 has no Hoare annotation [2020-07-08 12:41:45,171 WARN L170 areAnnotationChecker]: L234 has no Hoare annotation [2020-07-08 12:41:45,171 WARN L170 areAnnotationChecker]: L248 has no Hoare annotation [2020-07-08 12:41:45,171 WARN L170 areAnnotationChecker]: L248 has no Hoare annotation [2020-07-08 12:41:45,172 WARN L170 areAnnotationChecker]: L306 has no Hoare annotation [2020-07-08 12:41:45,172 WARN L170 areAnnotationChecker]: L306 has no Hoare annotation [2020-07-08 12:41:45,172 WARN L170 areAnnotationChecker]: L318 has no Hoare annotation [2020-07-08 12:41:45,172 WARN L170 areAnnotationChecker]: L318 has no Hoare annotation [2020-07-08 12:41:45,172 WARN L170 areAnnotationChecker]: L332 has no Hoare annotation [2020-07-08 12:41:45,172 WARN L170 areAnnotationChecker]: L332 has no Hoare annotation [2020-07-08 12:41:45,172 WARN L170 areAnnotationChecker]: L170 has no Hoare annotation [2020-07-08 12:41:45,172 WARN L170 areAnnotationChecker]: L170 has no Hoare annotation [2020-07-08 12:41:45,172 WARN L170 areAnnotationChecker]: L238 has no Hoare annotation [2020-07-08 12:41:45,172 WARN L170 areAnnotationChecker]: L238 has no Hoare annotation [2020-07-08 12:41:45,173 WARN L170 areAnnotationChecker]: L250 has no Hoare annotation [2020-07-08 12:41:45,173 WARN L170 areAnnotationChecker]: L250 has no Hoare annotation [2020-07-08 12:41:45,173 WARN L170 areAnnotationChecker]: L264 has no Hoare annotation [2020-07-08 12:41:45,173 WARN L170 areAnnotationChecker]: L264 has no Hoare annotation [2020-07-08 12:41:45,173 WARN L170 areAnnotationChecker]: L322 has no Hoare annotation [2020-07-08 12:41:45,173 WARN L170 areAnnotationChecker]: L322 has no Hoare annotation [2020-07-08 12:41:45,173 WARN L170 areAnnotationChecker]: L334 has no Hoare annotation [2020-07-08 12:41:45,173 WARN L170 areAnnotationChecker]: L334 has no Hoare annotation [2020-07-08 12:41:45,173 WARN L170 areAnnotationChecker]: L348 has no Hoare annotation [2020-07-08 12:41:45,173 WARN L170 areAnnotationChecker]: L348 has no Hoare annotation [2020-07-08 12:41:45,174 WARN L170 areAnnotationChecker]: L254 has no Hoare annotation [2020-07-08 12:41:45,174 WARN L170 areAnnotationChecker]: L254 has no Hoare annotation [2020-07-08 12:41:45,174 WARN L170 areAnnotationChecker]: L266 has no Hoare annotation [2020-07-08 12:41:45,174 WARN L170 areAnnotationChecker]: L266 has no Hoare annotation [2020-07-08 12:41:45,174 WARN L170 areAnnotationChecker]: L338 has no Hoare annotation [2020-07-08 12:41:45,174 WARN L170 areAnnotationChecker]: L338 has no Hoare annotation [2020-07-08 12:41:45,174 WARN L170 areAnnotationChecker]: L350 has no Hoare annotation [2020-07-08 12:41:45,174 WARN L170 areAnnotationChecker]: L350 has no Hoare annotation [2020-07-08 12:41:45,174 WARN L170 areAnnotationChecker]: L364 has no Hoare annotation [2020-07-08 12:41:45,174 WARN L170 areAnnotationChecker]: L364 has no Hoare annotation [2020-07-08 12:41:45,174 WARN L170 areAnnotationChecker]: L270 has no Hoare annotation [2020-07-08 12:41:45,175 WARN L170 areAnnotationChecker]: L270 has no Hoare annotation [2020-07-08 12:41:45,175 WARN L170 areAnnotationChecker]: L354 has no Hoare annotation [2020-07-08 12:41:45,175 WARN L170 areAnnotationChecker]: L354 has no Hoare annotation [2020-07-08 12:41:45,175 WARN L170 areAnnotationChecker]: L366 has no Hoare annotation [2020-07-08 12:41:45,175 WARN L170 areAnnotationChecker]: L366 has no Hoare annotation [2020-07-08 12:41:45,175 WARN L170 areAnnotationChecker]: L370 has no Hoare annotation [2020-07-08 12:41:45,175 WARN L170 areAnnotationChecker]: L370 has no Hoare annotation [2020-07-08 12:41:45,175 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-08 12:41:45,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:41:45 BoogieIcfgContainer [2020-07-08 12:41:45,189 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:41:45,193 INFO L168 Benchmark]: Toolchain (without parser) took 11756.53 ms. Allocated memory was 137.9 MB in the beginning and 351.8 MB in the end (delta: 213.9 MB). Free memory was 100.8 MB in the beginning and 238.4 MB in the end (delta: -137.7 MB). Peak memory consumption was 76.2 MB. Max. memory is 7.1 GB. [2020-07-08 12:41:45,193 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 12:41:45,194 INFO L168 Benchmark]: CACSL2BoogieTranslator took 422.11 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 100.6 MB in the beginning and 181.5 MB in the end (delta: -81.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2020-07-08 12:41:45,195 INFO L168 Benchmark]: Boogie Preprocessor took 57.88 ms. Allocated memory is still 202.9 MB. Free memory was 181.5 MB in the beginning and 178.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-07-08 12:41:45,195 INFO L168 Benchmark]: RCFGBuilder took 847.08 ms. Allocated memory is still 202.9 MB. Free memory was 178.9 MB in the beginning and 130.0 MB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 7.1 GB. [2020-07-08 12:41:45,196 INFO L168 Benchmark]: TraceAbstraction took 10422.46 ms. Allocated memory was 202.9 MB in the beginning and 351.8 MB in the end (delta: 148.9 MB). Free memory was 130.0 MB in the beginning and 238.4 MB in the end (delta: -108.4 MB). Peak memory consumption was 40.5 MB. Max. memory is 7.1 GB. [2020-07-08 12:41:45,199 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.23 ms. Allocated memory is still 137.9 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 422.11 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 100.6 MB in the beginning and 181.5 MB in the end (delta: -81.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 57.88 ms. Allocated memory is still 202.9 MB. Free memory was 181.5 MB in the beginning and 178.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 847.08 ms. Allocated memory is still 202.9 MB. Free memory was 178.9 MB in the beginning and 130.0 MB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10422.46 ms. Allocated memory was 202.9 MB in the beginning and 351.8 MB in the end (delta: 148.9 MB). Free memory was 130.0 MB in the beginning and 238.4 MB in the end (delta: -108.4 MB). Peak memory consumption was 40.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...