/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/psyco/psyco_security.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 23:29:27,978 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 23:29:27,981 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 23:29:28,000 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 23:29:28,001 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 23:29:28,003 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 23:29:28,004 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 23:29:28,014 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 23:29:28,017 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 23:29:28,020 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 23:29:28,022 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 23:29:28,024 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 23:29:28,024 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 23:29:28,027 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 23:29:28,029 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 23:29:28,030 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 23:29:28,032 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 23:29:28,033 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 23:29:28,034 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 23:29:28,039 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 23:29:28,043 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 23:29:28,046 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 23:29:28,047 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 23:29:28,047 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 23:29:28,050 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 23:29:28,050 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 23:29:28,050 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 23:29:28,052 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 23:29:28,052 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 23:29:28,054 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 23:29:28,054 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 23:29:28,055 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 23:29:28,056 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 23:29:28,057 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 23:29:28,058 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 23:29:28,058 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 23:29:28,060 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 23:29:28,060 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 23:29:28,060 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 23:29:28,061 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 23:29:28,062 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 23:29:28,063 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 23:29:28,093 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 23:29:28,093 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 23:29:28,096 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 23:29:28,097 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 23:29:28,097 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 23:29:28,097 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 23:29:28,097 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 23:29:28,097 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 23:29:28,098 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 23:29:28,098 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 23:29:28,098 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 23:29:28,100 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 23:29:28,100 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 23:29:28,101 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 23:29:28,101 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 23:29:28,101 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 23:29:28,101 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 23:29:28,101 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 23:29:28,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 23:29:28,102 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 23:29:28,102 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 23:29:28,102 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 23:29:28,102 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-08 23:29:28,383 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 23:29:28,396 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 23:29:28,399 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 23:29:28,401 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 23:29:28,401 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 23:29:28,402 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 23:29:28,467 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/499a66947/b7f3b9ad4ed347c9b957fe3ab12d67f3/FLAGda91a7702 [2020-07-08 23:29:28,966 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 23:29:28,967 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_security.c [2020-07-08 23:29:28,981 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/499a66947/b7f3b9ad4ed347c9b957fe3ab12d67f3/FLAGda91a7702 [2020-07-08 23:29:29,297 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/499a66947/b7f3b9ad4ed347c9b957fe3ab12d67f3 [2020-07-08 23:29:29,310 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 23:29:29,313 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 23:29:29,317 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 23:29:29,317 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 23:29:29,320 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 23:29:29,322 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:29:29" (1/1) ... [2020-07-08 23:29:29,326 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a37042a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:29:29, skipping insertion in model container [2020-07-08 23:29:29,326 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:29:29" (1/1) ... [2020-07-08 23:29:29,334 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 23:29:29,378 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 23:29:29,638 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:29:29,651 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 23:29:29,846 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:29:29,863 INFO L208 MainTranslator]: Completed translation [2020-07-08 23:29:29,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:29:29 WrapperNode [2020-07-08 23:29:29,864 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 23:29:29,865 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 23:29:29,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 23:29:29,866 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 23:29:29,882 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:29:29" (1/1) ... [2020-07-08 23:29:29,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:29:29" (1/1) ... [2020-07-08 23:29:29,906 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:29:29" (1/1) ... [2020-07-08 23:29:29,906 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:29:29" (1/1) ... [2020-07-08 23:29:29,929 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:29:29" (1/1) ... [2020-07-08 23:29:29,950 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:29:29" (1/1) ... [2020-07-08 23:29:29,952 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:29:29" (1/1) ... [2020-07-08 23:29:29,955 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 23:29:29,956 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 23:29:29,956 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 23:29:29,956 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 23:29:29,961 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:29:29" (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 23:29:30,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 23:29:30,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 23:29:30,023 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 23:29:30,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 23:29:30,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 23:29:30,023 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 23:29:30,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 23:29:30,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 23:29:30,813 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 23:29:30,814 INFO L295 CfgBuilder]: Removed 18 assume(true) statements. [2020-07-08 23:29:30,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:29:30 BoogieIcfgContainer [2020-07-08 23:29:30,828 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 23:29:30,830 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 23:29:30,830 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 23:29:30,833 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 23:29:30,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 11:29:29" (1/3) ... [2020-07-08 23:29:30,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dbe6821 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:29:30, skipping insertion in model container [2020-07-08 23:29:30,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:29:29" (2/3) ... [2020-07-08 23:29:30,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dbe6821 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:29:30, skipping insertion in model container [2020-07-08 23:29:30,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:29:30" (3/3) ... [2020-07-08 23:29:30,839 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_security.c [2020-07-08 23:29:30,851 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 23:29:30,861 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 23:29:30,877 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 23:29:30,903 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 23:29:30,904 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 23:29:30,904 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 23:29:30,904 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 23:29:30,905 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 23:29:30,905 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 23:29:30,905 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 23:29:30,905 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 23:29:30,933 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states. [2020-07-08 23:29:30,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-08 23:29:30,950 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:29:30,951 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:29:30,952 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:29:30,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:29:30,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1507146259, now seen corresponding path program 1 times [2020-07-08 23:29:30,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:29:30,971 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1673393207] [2020-07-08 23:29:30,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:29:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:29:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:29:31,169 INFO L280 TraceCheckUtils]: 0: Hoare triple {204#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {194#true} is VALID [2020-07-08 23:29:31,169 INFO L280 TraceCheckUtils]: 1: Hoare triple {194#true} ~m_initVerify~0 := 2; {194#true} is VALID [2020-07-08 23:29:31,170 INFO L280 TraceCheckUtils]: 2: Hoare triple {194#true} ~m_Signature~0 := 3; {194#true} is VALID [2020-07-08 23:29:31,170 INFO L280 TraceCheckUtils]: 3: Hoare triple {194#true} ~m_sign~0 := 4; {194#true} is VALID [2020-07-08 23:29:31,171 INFO L280 TraceCheckUtils]: 4: Hoare triple {194#true} ~m_verify~0 := 5; {194#true} is VALID [2020-07-08 23:29:31,171 INFO L280 TraceCheckUtils]: 5: Hoare triple {194#true} ~m_update~0 := 6; {194#true} is VALID [2020-07-08 23:29:31,172 INFO L280 TraceCheckUtils]: 6: Hoare triple {194#true} assume true; {194#true} is VALID [2020-07-08 23:29:31,173 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {194#true} {194#true} #484#return; {194#true} is VALID [2020-07-08 23:29:31,178 INFO L263 TraceCheckUtils]: 0: Hoare triple {194#true} call ULTIMATE.init(); {204#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID [2020-07-08 23:29:31,178 INFO L280 TraceCheckUtils]: 1: Hoare triple {204#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {194#true} is VALID [2020-07-08 23:29:31,179 INFO L280 TraceCheckUtils]: 2: Hoare triple {194#true} ~m_initVerify~0 := 2; {194#true} is VALID [2020-07-08 23:29:31,179 INFO L280 TraceCheckUtils]: 3: Hoare triple {194#true} ~m_Signature~0 := 3; {194#true} is VALID [2020-07-08 23:29:31,179 INFO L280 TraceCheckUtils]: 4: Hoare triple {194#true} ~m_sign~0 := 4; {194#true} is VALID [2020-07-08 23:29:31,180 INFO L280 TraceCheckUtils]: 5: Hoare triple {194#true} ~m_verify~0 := 5; {194#true} is VALID [2020-07-08 23:29:31,180 INFO L280 TraceCheckUtils]: 6: Hoare triple {194#true} ~m_update~0 := 6; {194#true} is VALID [2020-07-08 23:29:31,180 INFO L280 TraceCheckUtils]: 7: Hoare triple {194#true} assume true; {194#true} is VALID [2020-07-08 23:29:31,181 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {194#true} {194#true} #484#return; {194#true} is VALID [2020-07-08 23:29:31,181 INFO L263 TraceCheckUtils]: 9: Hoare triple {194#true} call #t~ret21 := main(); {194#true} is VALID [2020-07-08 23:29:31,182 INFO L280 TraceCheckUtils]: 10: Hoare triple {194#true} ~q~0 := 0; {194#true} is VALID [2020-07-08 23:29:31,182 INFO L280 TraceCheckUtils]: 11: Hoare triple {194#true} havoc ~method_id~0; {194#true} is VALID [2020-07-08 23:29:31,182 INFO L280 TraceCheckUtils]: 12: Hoare triple {194#true} ~this_state~0 := 0; {194#true} is VALID [2020-07-08 23:29:31,183 INFO L280 TraceCheckUtils]: 13: Hoare triple {194#true} goto; {194#true} is VALID [2020-07-08 23:29:31,183 INFO L280 TraceCheckUtils]: 14: Hoare triple {194#true} assume !false; {194#true} is VALID [2020-07-08 23:29:31,184 INFO L280 TraceCheckUtils]: 15: Hoare triple {194#true} assume 0 == ~q~0; {194#true} is VALID [2020-07-08 23:29:31,184 INFO L280 TraceCheckUtils]: 16: Hoare triple {194#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {194#true} is VALID [2020-07-08 23:29:31,185 INFO L280 TraceCheckUtils]: 17: Hoare triple {194#true} assume 0 != #t~nondet0; {194#true} is VALID [2020-07-08 23:29:31,185 INFO L280 TraceCheckUtils]: 18: Hoare triple {194#true} havoc #t~nondet0; {194#true} is VALID [2020-07-08 23:29:31,185 INFO L280 TraceCheckUtils]: 19: Hoare triple {194#true} ~method_id~0 := 3; {194#true} is VALID [2020-07-08 23:29:31,190 INFO L280 TraceCheckUtils]: 20: Hoare triple {194#true} assume false; {195#false} is VALID [2020-07-08 23:29:31,190 INFO L280 TraceCheckUtils]: 21: Hoare triple {195#false} assume !false; {195#false} is VALID [2020-07-08 23:29:31,194 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 23:29:31,195 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1673393207] [2020-07-08 23:29:31,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:29:31,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 23:29:31,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466807011] [2020-07-08 23:29:31,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-08 23:29:31,222 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:29:31,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 23:29:31,266 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 23:29:31,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 23:29:31,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:29:31,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 23:29:31,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 23:29:31,278 INFO L87 Difference]: Start difference. First operand 191 states. Second operand 3 states. [2020-07-08 23:29:32,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:29:32,585 INFO L93 Difference]: Finished difference Result 369 states and 507 transitions. [2020-07-08 23:29:32,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 23:29:32,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-08 23:29:32,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:29:32,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 23:29:32,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 507 transitions. [2020-07-08 23:29:32,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 23:29:32,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 507 transitions. [2020-07-08 23:29:32,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 507 transitions. [2020-07-08 23:29:33,303 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 507 edges. 507 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:29:33,335 INFO L225 Difference]: With dead ends: 369 [2020-07-08 23:29:33,336 INFO L226 Difference]: Without dead ends: 178 [2020-07-08 23:29:33,346 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 23:29:33,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2020-07-08 23:29:33,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2020-07-08 23:29:33,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:29:33,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 178 states. Second operand 178 states. [2020-07-08 23:29:33,958 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand 178 states. [2020-07-08 23:29:33,958 INFO L87 Difference]: Start difference. First operand 178 states. Second operand 178 states. [2020-07-08 23:29:33,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:29:33,975 INFO L93 Difference]: Finished difference Result 178 states and 213 transitions. [2020-07-08 23:29:33,976 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 213 transitions. [2020-07-08 23:29:33,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:29:33,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:29:33,981 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand 178 states. [2020-07-08 23:29:33,981 INFO L87 Difference]: Start difference. First operand 178 states. Second operand 178 states. [2020-07-08 23:29:33,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:29:33,992 INFO L93 Difference]: Finished difference Result 178 states and 213 transitions. [2020-07-08 23:29:33,992 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 213 transitions. [2020-07-08 23:29:34,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:29:34,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:29:34,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:29:34,003 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:29:34,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2020-07-08 23:29:34,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 213 transitions. [2020-07-08 23:29:34,015 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 213 transitions. Word has length 22 [2020-07-08 23:29:34,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:29:34,016 INFO L479 AbstractCegarLoop]: Abstraction has 178 states and 213 transitions. [2020-07-08 23:29:34,016 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 23:29:34,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 178 states and 213 transitions. [2020-07-08 23:29:34,341 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:29:34,341 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 213 transitions. [2020-07-08 23:29:34,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-08 23:29:34,342 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:29:34,342 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:29:34,343 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 23:29:34,343 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:29:34,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:29:34,343 INFO L82 PathProgramCache]: Analyzing trace with hash -946920198, now seen corresponding path program 1 times [2020-07-08 23:29:34,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:29:34,344 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [77936901] [2020-07-08 23:29:34,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:29:34,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:29:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:29:34,431 INFO L280 TraceCheckUtils]: 0: Hoare triple {1668#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {1657#true} is VALID [2020-07-08 23:29:34,432 INFO L280 TraceCheckUtils]: 1: Hoare triple {1657#true} ~m_initVerify~0 := 2; {1657#true} is VALID [2020-07-08 23:29:34,432 INFO L280 TraceCheckUtils]: 2: Hoare triple {1657#true} ~m_Signature~0 := 3; {1657#true} is VALID [2020-07-08 23:29:34,432 INFO L280 TraceCheckUtils]: 3: Hoare triple {1657#true} ~m_sign~0 := 4; {1657#true} is VALID [2020-07-08 23:29:34,432 INFO L280 TraceCheckUtils]: 4: Hoare triple {1657#true} ~m_verify~0 := 5; {1657#true} is VALID [2020-07-08 23:29:34,433 INFO L280 TraceCheckUtils]: 5: Hoare triple {1657#true} ~m_update~0 := 6; {1657#true} is VALID [2020-07-08 23:29:34,433 INFO L280 TraceCheckUtils]: 6: Hoare triple {1657#true} assume true; {1657#true} is VALID [2020-07-08 23:29:34,433 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1657#true} {1657#true} #484#return; {1657#true} is VALID [2020-07-08 23:29:34,435 INFO L263 TraceCheckUtils]: 0: Hoare triple {1657#true} call ULTIMATE.init(); {1668#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID [2020-07-08 23:29:34,435 INFO L280 TraceCheckUtils]: 1: Hoare triple {1668#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {1657#true} is VALID [2020-07-08 23:29:34,435 INFO L280 TraceCheckUtils]: 2: Hoare triple {1657#true} ~m_initVerify~0 := 2; {1657#true} is VALID [2020-07-08 23:29:34,436 INFO L280 TraceCheckUtils]: 3: Hoare triple {1657#true} ~m_Signature~0 := 3; {1657#true} is VALID [2020-07-08 23:29:34,436 INFO L280 TraceCheckUtils]: 4: Hoare triple {1657#true} ~m_sign~0 := 4; {1657#true} is VALID [2020-07-08 23:29:34,436 INFO L280 TraceCheckUtils]: 5: Hoare triple {1657#true} ~m_verify~0 := 5; {1657#true} is VALID [2020-07-08 23:29:34,437 INFO L280 TraceCheckUtils]: 6: Hoare triple {1657#true} ~m_update~0 := 6; {1657#true} is VALID [2020-07-08 23:29:34,437 INFO L280 TraceCheckUtils]: 7: Hoare triple {1657#true} assume true; {1657#true} is VALID [2020-07-08 23:29:34,437 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {1657#true} {1657#true} #484#return; {1657#true} is VALID [2020-07-08 23:29:34,438 INFO L263 TraceCheckUtils]: 9: Hoare triple {1657#true} call #t~ret21 := main(); {1657#true} is VALID [2020-07-08 23:29:34,439 INFO L280 TraceCheckUtils]: 10: Hoare triple {1657#true} ~q~0 := 0; {1667#(= 0 main_~q~0)} is VALID [2020-07-08 23:29:34,440 INFO L280 TraceCheckUtils]: 11: Hoare triple {1667#(= 0 main_~q~0)} havoc ~method_id~0; {1667#(= 0 main_~q~0)} is VALID [2020-07-08 23:29:34,440 INFO L280 TraceCheckUtils]: 12: Hoare triple {1667#(= 0 main_~q~0)} ~this_state~0 := 0; {1667#(= 0 main_~q~0)} is VALID [2020-07-08 23:29:34,441 INFO L280 TraceCheckUtils]: 13: Hoare triple {1667#(= 0 main_~q~0)} goto; {1667#(= 0 main_~q~0)} is VALID [2020-07-08 23:29:34,442 INFO L280 TraceCheckUtils]: 14: Hoare triple {1667#(= 0 main_~q~0)} assume !false; {1667#(= 0 main_~q~0)} is VALID [2020-07-08 23:29:34,442 INFO L280 TraceCheckUtils]: 15: Hoare triple {1667#(= 0 main_~q~0)} assume !(0 == ~q~0); {1658#false} is VALID [2020-07-08 23:29:34,443 INFO L280 TraceCheckUtils]: 16: Hoare triple {1658#false} assume 1 == ~q~0; {1658#false} is VALID [2020-07-08 23:29:34,443 INFO L280 TraceCheckUtils]: 17: Hoare triple {1658#false} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1658#false} is VALID [2020-07-08 23:29:34,443 INFO L280 TraceCheckUtils]: 18: Hoare triple {1658#false} assume 0 != #t~nondet1; {1658#false} is VALID [2020-07-08 23:29:34,443 INFO L280 TraceCheckUtils]: 19: Hoare triple {1658#false} havoc #t~nondet1; {1658#false} is VALID [2020-07-08 23:29:34,444 INFO L280 TraceCheckUtils]: 20: Hoare triple {1658#false} ~method_id~0 := 4; {1658#false} is VALID [2020-07-08 23:29:34,444 INFO L280 TraceCheckUtils]: 21: Hoare triple {1658#false} assume 2 == ~this_state~0; {1658#false} is VALID [2020-07-08 23:29:34,445 INFO L280 TraceCheckUtils]: 22: Hoare triple {1658#false} assume !false; {1658#false} is VALID [2020-07-08 23:29:34,446 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 23:29:34,446 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [77936901] [2020-07-08 23:29:34,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:29:34,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 23:29:34,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868956652] [2020-07-08 23:29:34,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-07-08 23:29:34,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:29:34,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 23:29:34,475 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 23:29:34,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 23:29:34,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:29:34,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 23:29:34,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 23:29:34,476 INFO L87 Difference]: Start difference. First operand 178 states and 213 transitions. Second operand 4 states. [2020-07-08 23:29:35,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:29:35,940 INFO L93 Difference]: Finished difference Result 346 states and 417 transitions. [2020-07-08 23:29:35,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 23:29:35,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-07-08 23:29:35,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:29:35,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 23:29:35,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 417 transitions. [2020-07-08 23:29:35,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 23:29:35,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 417 transitions. [2020-07-08 23:29:35,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 417 transitions. [2020-07-08 23:29:36,445 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 417 edges. 417 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:29:36,450 INFO L225 Difference]: With dead ends: 346 [2020-07-08 23:29:36,450 INFO L226 Difference]: Without dead ends: 181 [2020-07-08 23:29:36,453 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 23:29:36,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-07-08 23:29:36,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2020-07-08 23:29:36,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:29:36,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand 181 states. [2020-07-08 23:29:36,978 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand 181 states. [2020-07-08 23:29:36,978 INFO L87 Difference]: Start difference. First operand 181 states. Second operand 181 states. [2020-07-08 23:29:36,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:29:36,986 INFO L93 Difference]: Finished difference Result 181 states and 216 transitions. [2020-07-08 23:29:36,986 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 216 transitions. [2020-07-08 23:29:36,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:29:36,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:29:36,987 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand 181 states. [2020-07-08 23:29:36,987 INFO L87 Difference]: Start difference. First operand 181 states. Second operand 181 states. [2020-07-08 23:29:36,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:29:36,994 INFO L93 Difference]: Finished difference Result 181 states and 216 transitions. [2020-07-08 23:29:36,995 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 216 transitions. [2020-07-08 23:29:36,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:29:36,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:29:36,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:29:36,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:29:36,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-07-08 23:29:37,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 216 transitions. [2020-07-08 23:29:37,003 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 216 transitions. Word has length 23 [2020-07-08 23:29:37,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:29:37,003 INFO L479 AbstractCegarLoop]: Abstraction has 181 states and 216 transitions. [2020-07-08 23:29:37,003 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 23:29:37,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 181 states and 216 transitions. [2020-07-08 23:29:37,295 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:29:37,295 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 216 transitions. [2020-07-08 23:29:37,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-08 23:29:37,297 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:29:37,297 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:29:37,297 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 23:29:37,298 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:29:37,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:29:37,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1840173547, now seen corresponding path program 1 times [2020-07-08 23:29:37,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:29:37,300 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [309992596] [2020-07-08 23:29:37,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:29:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:29:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:29:37,392 INFO L280 TraceCheckUtils]: 0: Hoare triple {3100#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {3089#true} is VALID [2020-07-08 23:29:37,392 INFO L280 TraceCheckUtils]: 1: Hoare triple {3089#true} ~m_initVerify~0 := 2; {3089#true} is VALID [2020-07-08 23:29:37,393 INFO L280 TraceCheckUtils]: 2: Hoare triple {3089#true} ~m_Signature~0 := 3; {3089#true} is VALID [2020-07-08 23:29:37,393 INFO L280 TraceCheckUtils]: 3: Hoare triple {3089#true} ~m_sign~0 := 4; {3089#true} is VALID [2020-07-08 23:29:37,393 INFO L280 TraceCheckUtils]: 4: Hoare triple {3089#true} ~m_verify~0 := 5; {3089#true} is VALID [2020-07-08 23:29:37,396 INFO L280 TraceCheckUtils]: 5: Hoare triple {3089#true} ~m_update~0 := 6; {3089#true} is VALID [2020-07-08 23:29:37,396 INFO L280 TraceCheckUtils]: 6: Hoare triple {3089#true} assume true; {3089#true} is VALID [2020-07-08 23:29:37,396 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {3089#true} {3089#true} #484#return; {3089#true} is VALID [2020-07-08 23:29:37,402 INFO L263 TraceCheckUtils]: 0: Hoare triple {3089#true} call ULTIMATE.init(); {3100#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID [2020-07-08 23:29:37,403 INFO L280 TraceCheckUtils]: 1: Hoare triple {3100#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {3089#true} is VALID [2020-07-08 23:29:37,403 INFO L280 TraceCheckUtils]: 2: Hoare triple {3089#true} ~m_initVerify~0 := 2; {3089#true} is VALID [2020-07-08 23:29:37,403 INFO L280 TraceCheckUtils]: 3: Hoare triple {3089#true} ~m_Signature~0 := 3; {3089#true} is VALID [2020-07-08 23:29:37,404 INFO L280 TraceCheckUtils]: 4: Hoare triple {3089#true} ~m_sign~0 := 4; {3089#true} is VALID [2020-07-08 23:29:37,404 INFO L280 TraceCheckUtils]: 5: Hoare triple {3089#true} ~m_verify~0 := 5; {3089#true} is VALID [2020-07-08 23:29:37,404 INFO L280 TraceCheckUtils]: 6: Hoare triple {3089#true} ~m_update~0 := 6; {3089#true} is VALID [2020-07-08 23:29:37,404 INFO L280 TraceCheckUtils]: 7: Hoare triple {3089#true} assume true; {3089#true} is VALID [2020-07-08 23:29:37,405 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {3089#true} {3089#true} #484#return; {3089#true} is VALID [2020-07-08 23:29:37,405 INFO L263 TraceCheckUtils]: 9: Hoare triple {3089#true} call #t~ret21 := main(); {3089#true} is VALID [2020-07-08 23:29:37,405 INFO L280 TraceCheckUtils]: 10: Hoare triple {3089#true} ~q~0 := 0; {3089#true} is VALID [2020-07-08 23:29:37,405 INFO L280 TraceCheckUtils]: 11: Hoare triple {3089#true} havoc ~method_id~0; {3089#true} is VALID [2020-07-08 23:29:37,406 INFO L280 TraceCheckUtils]: 12: Hoare triple {3089#true} ~this_state~0 := 0; {3089#true} is VALID [2020-07-08 23:29:37,406 INFO L280 TraceCheckUtils]: 13: Hoare triple {3089#true} goto; {3089#true} is VALID [2020-07-08 23:29:37,406 INFO L280 TraceCheckUtils]: 14: Hoare triple {3089#true} assume !false; {3089#true} is VALID [2020-07-08 23:29:37,406 INFO L280 TraceCheckUtils]: 15: Hoare triple {3089#true} assume 0 == ~q~0; {3089#true} is VALID [2020-07-08 23:29:37,407 INFO L280 TraceCheckUtils]: 16: Hoare triple {3089#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3089#true} is VALID [2020-07-08 23:29:37,407 INFO L280 TraceCheckUtils]: 17: Hoare triple {3089#true} assume 0 != #t~nondet0; {3089#true} is VALID [2020-07-08 23:29:37,407 INFO L280 TraceCheckUtils]: 18: Hoare triple {3089#true} havoc #t~nondet0; {3089#true} is VALID [2020-07-08 23:29:37,408 INFO L280 TraceCheckUtils]: 19: Hoare triple {3089#true} ~method_id~0 := 3; {3089#true} is VALID [2020-07-08 23:29:37,409 INFO L280 TraceCheckUtils]: 20: Hoare triple {3089#true} assume !false; {3089#true} is VALID [2020-07-08 23:29:37,413 INFO L280 TraceCheckUtils]: 21: Hoare triple {3089#true} ~q~0 := 2; {3099#(<= 2 main_~q~0)} is VALID [2020-07-08 23:29:37,413 INFO L280 TraceCheckUtils]: 22: Hoare triple {3099#(<= 2 main_~q~0)} ~this_state~0 := 0; {3099#(<= 2 main_~q~0)} is VALID [2020-07-08 23:29:37,414 INFO L280 TraceCheckUtils]: 23: Hoare triple {3099#(<= 2 main_~q~0)} assume !false; {3099#(<= 2 main_~q~0)} is VALID [2020-07-08 23:29:37,415 INFO L280 TraceCheckUtils]: 24: Hoare triple {3099#(<= 2 main_~q~0)} assume !(0 == ~q~0); {3099#(<= 2 main_~q~0)} is VALID [2020-07-08 23:29:37,415 INFO L280 TraceCheckUtils]: 25: Hoare triple {3099#(<= 2 main_~q~0)} assume 1 == ~q~0; {3090#false} is VALID [2020-07-08 23:29:37,416 INFO L280 TraceCheckUtils]: 26: Hoare triple {3090#false} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3090#false} is VALID [2020-07-08 23:29:37,416 INFO L280 TraceCheckUtils]: 27: Hoare triple {3090#false} assume 0 != #t~nondet1; {3090#false} is VALID [2020-07-08 23:29:37,416 INFO L280 TraceCheckUtils]: 28: Hoare triple {3090#false} havoc #t~nondet1; {3090#false} is VALID [2020-07-08 23:29:37,417 INFO L280 TraceCheckUtils]: 29: Hoare triple {3090#false} ~method_id~0 := 4; {3090#false} is VALID [2020-07-08 23:29:37,417 INFO L280 TraceCheckUtils]: 30: Hoare triple {3090#false} assume 2 == ~this_state~0; {3090#false} is VALID [2020-07-08 23:29:37,417 INFO L280 TraceCheckUtils]: 31: Hoare triple {3090#false} assume !false; {3090#false} is VALID [2020-07-08 23:29:37,419 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 23:29:37,419 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [309992596] [2020-07-08 23:29:37,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:29:37,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 23:29:37,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190086409] [2020-07-08 23:29:37,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2020-07-08 23:29:37,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:29:37,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 23:29:37,450 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 23:29:37,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 23:29:37,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:29:37,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 23:29:37,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 23:29:37,451 INFO L87 Difference]: Start difference. First operand 181 states and 216 transitions. Second operand 4 states. [2020-07-08 23:29:38,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:29:38,528 INFO L93 Difference]: Finished difference Result 330 states and 397 transitions. [2020-07-08 23:29:38,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 23:29:38,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2020-07-08 23:29:38,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:29:38,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 23:29:38,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 395 transitions. [2020-07-08 23:29:38,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 23:29:38,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 395 transitions. [2020-07-08 23:29:38,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 395 transitions. [2020-07-08 23:29:39,029 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 395 edges. 395 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:29:39,033 INFO L225 Difference]: With dead ends: 330 [2020-07-08 23:29:39,033 INFO L226 Difference]: Without dead ends: 163 [2020-07-08 23:29:39,035 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 23:29:39,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2020-07-08 23:29:39,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2020-07-08 23:29:39,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:29:39,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand 163 states. [2020-07-08 23:29:39,569 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand 163 states. [2020-07-08 23:29:39,569 INFO L87 Difference]: Start difference. First operand 163 states. Second operand 163 states. [2020-07-08 23:29:39,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:29:39,576 INFO L93 Difference]: Finished difference Result 163 states and 193 transitions. [2020-07-08 23:29:39,576 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 193 transitions. [2020-07-08 23:29:39,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:29:39,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:29:39,577 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand 163 states. [2020-07-08 23:29:39,577 INFO L87 Difference]: Start difference. First operand 163 states. Second operand 163 states. [2020-07-08 23:29:39,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:29:39,583 INFO L93 Difference]: Finished difference Result 163 states and 193 transitions. [2020-07-08 23:29:39,583 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 193 transitions. [2020-07-08 23:29:39,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:29:39,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:29:39,584 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:29:39,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:29:39,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-07-08 23:29:39,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 193 transitions. [2020-07-08 23:29:39,591 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 193 transitions. Word has length 32 [2020-07-08 23:29:39,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:29:39,591 INFO L479 AbstractCegarLoop]: Abstraction has 163 states and 193 transitions. [2020-07-08 23:29:39,591 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 23:29:39,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 163 states and 193 transitions. [2020-07-08 23:29:39,886 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:29:39,886 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 193 transitions. [2020-07-08 23:29:39,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-08 23:29:39,887 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:29:39,888 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:29:39,888 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 23:29:39,888 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:29:39,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:29:39,889 INFO L82 PathProgramCache]: Analyzing trace with hash 576498569, now seen corresponding path program 1 times [2020-07-08 23:29:39,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:29:39,889 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [280107608] [2020-07-08 23:29:39,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:29:39,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:29:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:29:39,980 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {4418#true} is VALID [2020-07-08 23:29:39,980 INFO L280 TraceCheckUtils]: 1: Hoare triple {4418#true} ~m_initVerify~0 := 2; {4418#true} is VALID [2020-07-08 23:29:39,980 INFO L280 TraceCheckUtils]: 2: Hoare triple {4418#true} ~m_Signature~0 := 3; {4418#true} is VALID [2020-07-08 23:29:39,980 INFO L280 TraceCheckUtils]: 3: Hoare triple {4418#true} ~m_sign~0 := 4; {4418#true} is VALID [2020-07-08 23:29:39,981 INFO L280 TraceCheckUtils]: 4: Hoare triple {4418#true} ~m_verify~0 := 5; {4418#true} is VALID [2020-07-08 23:29:39,981 INFO L280 TraceCheckUtils]: 5: Hoare triple {4418#true} ~m_update~0 := 6; {4418#true} is VALID [2020-07-08 23:29:39,981 INFO L280 TraceCheckUtils]: 6: Hoare triple {4418#true} assume true; {4418#true} is VALID [2020-07-08 23:29:39,982 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {4418#true} {4418#true} #484#return; {4418#true} is VALID [2020-07-08 23:29:39,983 INFO L263 TraceCheckUtils]: 0: Hoare triple {4418#true} call ULTIMATE.init(); {4429#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID [2020-07-08 23:29:39,983 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {4418#true} is VALID [2020-07-08 23:29:39,983 INFO L280 TraceCheckUtils]: 2: Hoare triple {4418#true} ~m_initVerify~0 := 2; {4418#true} is VALID [2020-07-08 23:29:39,984 INFO L280 TraceCheckUtils]: 3: Hoare triple {4418#true} ~m_Signature~0 := 3; {4418#true} is VALID [2020-07-08 23:29:39,984 INFO L280 TraceCheckUtils]: 4: Hoare triple {4418#true} ~m_sign~0 := 4; {4418#true} is VALID [2020-07-08 23:29:39,984 INFO L280 TraceCheckUtils]: 5: Hoare triple {4418#true} ~m_verify~0 := 5; {4418#true} is VALID [2020-07-08 23:29:39,984 INFO L280 TraceCheckUtils]: 6: Hoare triple {4418#true} ~m_update~0 := 6; {4418#true} is VALID [2020-07-08 23:29:39,985 INFO L280 TraceCheckUtils]: 7: Hoare triple {4418#true} assume true; {4418#true} is VALID [2020-07-08 23:29:39,985 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {4418#true} {4418#true} #484#return; {4418#true} is VALID [2020-07-08 23:29:39,985 INFO L263 TraceCheckUtils]: 9: Hoare triple {4418#true} call #t~ret21 := main(); {4418#true} is VALID [2020-07-08 23:29:39,985 INFO L280 TraceCheckUtils]: 10: Hoare triple {4418#true} ~q~0 := 0; {4418#true} is VALID [2020-07-08 23:29:39,986 INFO L280 TraceCheckUtils]: 11: Hoare triple {4418#true} havoc ~method_id~0; {4418#true} is VALID [2020-07-08 23:29:39,986 INFO L280 TraceCheckUtils]: 12: Hoare triple {4418#true} ~this_state~0 := 0; {4418#true} is VALID [2020-07-08 23:29:39,986 INFO L280 TraceCheckUtils]: 13: Hoare triple {4418#true} goto; {4418#true} is VALID [2020-07-08 23:29:39,986 INFO L280 TraceCheckUtils]: 14: Hoare triple {4418#true} assume !false; {4418#true} is VALID [2020-07-08 23:29:39,987 INFO L280 TraceCheckUtils]: 15: Hoare triple {4418#true} assume 0 == ~q~0; {4418#true} is VALID [2020-07-08 23:29:39,987 INFO L280 TraceCheckUtils]: 16: Hoare triple {4418#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {4418#true} is VALID [2020-07-08 23:29:39,987 INFO L280 TraceCheckUtils]: 17: Hoare triple {4418#true} assume 0 != #t~nondet0; {4418#true} is VALID [2020-07-08 23:29:39,987 INFO L280 TraceCheckUtils]: 18: Hoare triple {4418#true} havoc #t~nondet0; {4418#true} is VALID [2020-07-08 23:29:39,988 INFO L280 TraceCheckUtils]: 19: Hoare triple {4418#true} ~method_id~0 := 3; {4418#true} is VALID [2020-07-08 23:29:39,988 INFO L280 TraceCheckUtils]: 20: Hoare triple {4418#true} assume !false; {4418#true} is VALID [2020-07-08 23:29:39,988 INFO L280 TraceCheckUtils]: 21: Hoare triple {4418#true} ~q~0 := 2; {4418#true} is VALID [2020-07-08 23:29:39,989 INFO L280 TraceCheckUtils]: 22: Hoare triple {4418#true} ~this_state~0 := 0; {4428#(<= main_~this_state~0 0)} is VALID [2020-07-08 23:29:39,989 INFO L280 TraceCheckUtils]: 23: Hoare triple {4428#(<= main_~this_state~0 0)} assume !false; {4428#(<= main_~this_state~0 0)} is VALID [2020-07-08 23:29:39,990 INFO L280 TraceCheckUtils]: 24: Hoare triple {4428#(<= main_~this_state~0 0)} assume !(0 == ~q~0); {4428#(<= main_~this_state~0 0)} is VALID [2020-07-08 23:29:39,991 INFO L280 TraceCheckUtils]: 25: Hoare triple {4428#(<= main_~this_state~0 0)} assume !(1 == ~q~0); {4428#(<= main_~this_state~0 0)} is VALID [2020-07-08 23:29:39,991 INFO L280 TraceCheckUtils]: 26: Hoare triple {4428#(<= main_~this_state~0 0)} assume 2 == ~q~0; {4428#(<= main_~this_state~0 0)} is VALID [2020-07-08 23:29:39,992 INFO L280 TraceCheckUtils]: 27: Hoare triple {4428#(<= main_~this_state~0 0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {4428#(<= main_~this_state~0 0)} is VALID [2020-07-08 23:29:39,992 INFO L280 TraceCheckUtils]: 28: Hoare triple {4428#(<= main_~this_state~0 0)} assume !(0 != #t~nondet4); {4428#(<= main_~this_state~0 0)} is VALID [2020-07-08 23:29:39,993 INFO L280 TraceCheckUtils]: 29: Hoare triple {4428#(<= main_~this_state~0 0)} havoc #t~nondet4; {4428#(<= main_~this_state~0 0)} is VALID [2020-07-08 23:29:39,993 INFO L280 TraceCheckUtils]: 30: Hoare triple {4428#(<= main_~this_state~0 0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {4428#(<= main_~this_state~0 0)} is VALID [2020-07-08 23:29:39,994 INFO L280 TraceCheckUtils]: 31: Hoare triple {4428#(<= main_~this_state~0 0)} assume !(0 != #t~nondet5); {4428#(<= main_~this_state~0 0)} is VALID [2020-07-08 23:29:39,994 INFO L280 TraceCheckUtils]: 32: Hoare triple {4428#(<= main_~this_state~0 0)} havoc #t~nondet5; {4428#(<= main_~this_state~0 0)} is VALID [2020-07-08 23:29:39,995 INFO L280 TraceCheckUtils]: 33: Hoare triple {4428#(<= main_~this_state~0 0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {4428#(<= main_~this_state~0 0)} is VALID [2020-07-08 23:29:39,995 INFO L280 TraceCheckUtils]: 34: Hoare triple {4428#(<= main_~this_state~0 0)} assume 0 != #t~nondet6; {4428#(<= main_~this_state~0 0)} is VALID [2020-07-08 23:29:39,996 INFO L280 TraceCheckUtils]: 35: Hoare triple {4428#(<= main_~this_state~0 0)} havoc #t~nondet6; {4428#(<= main_~this_state~0 0)} is VALID [2020-07-08 23:29:39,997 INFO L280 TraceCheckUtils]: 36: Hoare triple {4428#(<= main_~this_state~0 0)} ~method_id~0 := 4; {4428#(<= main_~this_state~0 0)} is VALID [2020-07-08 23:29:39,997 INFO L280 TraceCheckUtils]: 37: Hoare triple {4428#(<= main_~this_state~0 0)} assume 2 == ~this_state~0; {4419#false} is VALID [2020-07-08 23:29:39,998 INFO L280 TraceCheckUtils]: 38: Hoare triple {4419#false} assume !false; {4419#false} is VALID [2020-07-08 23:29:40,000 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 23:29:40,001 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [280107608] [2020-07-08 23:29:40,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:29:40,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 23:29:40,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605484326] [2020-07-08 23:29:40,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-07-08 23:29:40,002 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:29:40,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 23:29:40,045 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:29:40,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 23:29:40,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:29:40,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 23:29:40,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 23:29:40,047 INFO L87 Difference]: Start difference. First operand 163 states and 193 transitions. Second operand 4 states. [2020-07-08 23:29:42,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:29:42,028 INFO L93 Difference]: Finished difference Result 429 states and 517 transitions. [2020-07-08 23:29:42,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 23:29:42,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-07-08 23:29:42,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:29:42,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 23:29:42,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 515 transitions. [2020-07-08 23:29:42,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 23:29:42,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 515 transitions. [2020-07-08 23:29:42,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 515 transitions. [2020-07-08 23:29:42,688 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 515 edges. 515 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:29:42,696 INFO L225 Difference]: With dead ends: 429 [2020-07-08 23:29:42,696 INFO L226 Difference]: Without dead ends: 275 [2020-07-08 23:29:42,697 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 23:29:42,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-07-08 23:29:43,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 243. [2020-07-08 23:29:43,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:29:43,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 275 states. Second operand 243 states. [2020-07-08 23:29:43,591 INFO L74 IsIncluded]: Start isIncluded. First operand 275 states. Second operand 243 states. [2020-07-08 23:29:43,591 INFO L87 Difference]: Start difference. First operand 275 states. Second operand 243 states. [2020-07-08 23:29:43,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:29:43,601 INFO L93 Difference]: Finished difference Result 275 states and 319 transitions. [2020-07-08 23:29:43,601 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 319 transitions. [2020-07-08 23:29:43,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:29:43,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:29:43,603 INFO L74 IsIncluded]: Start isIncluded. First operand 243 states. Second operand 275 states. [2020-07-08 23:29:43,603 INFO L87 Difference]: Start difference. First operand 243 states. Second operand 275 states. [2020-07-08 23:29:43,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:29:43,613 INFO L93 Difference]: Finished difference Result 275 states and 319 transitions. [2020-07-08 23:29:43,613 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 319 transitions. [2020-07-08 23:29:43,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:29:43,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:29:43,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:29:43,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:29:43,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2020-07-08 23:29:43,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 288 transitions. [2020-07-08 23:29:43,622 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 288 transitions. Word has length 39 [2020-07-08 23:29:43,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:29:43,622 INFO L479 AbstractCegarLoop]: Abstraction has 243 states and 288 transitions. [2020-07-08 23:29:43,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 23:29:43,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 243 states and 288 transitions. [2020-07-08 23:29:44,052 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 288 edges. 288 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:29:44,052 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 288 transitions. [2020-07-08 23:29:44,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-08 23:29:44,054 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:29:44,054 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:29:44,055 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 23:29:44,055 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:29:44,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:29:44,055 INFO L82 PathProgramCache]: Analyzing trace with hash -47890514, now seen corresponding path program 1 times [2020-07-08 23:29:44,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:29:44,056 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [420020643] [2020-07-08 23:29:44,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:29:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:29:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:29:44,122 INFO L280 TraceCheckUtils]: 0: Hoare triple {6340#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {6329#true} is VALID [2020-07-08 23:29:44,122 INFO L280 TraceCheckUtils]: 1: Hoare triple {6329#true} ~m_initVerify~0 := 2; {6329#true} is VALID [2020-07-08 23:29:44,122 INFO L280 TraceCheckUtils]: 2: Hoare triple {6329#true} ~m_Signature~0 := 3; {6329#true} is VALID [2020-07-08 23:29:44,122 INFO L280 TraceCheckUtils]: 3: Hoare triple {6329#true} ~m_sign~0 := 4; {6329#true} is VALID [2020-07-08 23:29:44,123 INFO L280 TraceCheckUtils]: 4: Hoare triple {6329#true} ~m_verify~0 := 5; {6329#true} is VALID [2020-07-08 23:29:44,123 INFO L280 TraceCheckUtils]: 5: Hoare triple {6329#true} ~m_update~0 := 6; {6329#true} is VALID [2020-07-08 23:29:44,123 INFO L280 TraceCheckUtils]: 6: Hoare triple {6329#true} assume true; {6329#true} is VALID [2020-07-08 23:29:44,123 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {6329#true} {6329#true} #484#return; {6329#true} is VALID [2020-07-08 23:29:44,126 INFO L263 TraceCheckUtils]: 0: Hoare triple {6329#true} call ULTIMATE.init(); {6340#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID [2020-07-08 23:29:44,126 INFO L280 TraceCheckUtils]: 1: Hoare triple {6340#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {6329#true} is VALID [2020-07-08 23:29:44,127 INFO L280 TraceCheckUtils]: 2: Hoare triple {6329#true} ~m_initVerify~0 := 2; {6329#true} is VALID [2020-07-08 23:29:44,127 INFO L280 TraceCheckUtils]: 3: Hoare triple {6329#true} ~m_Signature~0 := 3; {6329#true} is VALID [2020-07-08 23:29:44,127 INFO L280 TraceCheckUtils]: 4: Hoare triple {6329#true} ~m_sign~0 := 4; {6329#true} is VALID [2020-07-08 23:29:44,127 INFO L280 TraceCheckUtils]: 5: Hoare triple {6329#true} ~m_verify~0 := 5; {6329#true} is VALID [2020-07-08 23:29:44,128 INFO L280 TraceCheckUtils]: 6: Hoare triple {6329#true} ~m_update~0 := 6; {6329#true} is VALID [2020-07-08 23:29:44,128 INFO L280 TraceCheckUtils]: 7: Hoare triple {6329#true} assume true; {6329#true} is VALID [2020-07-08 23:29:44,128 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {6329#true} {6329#true} #484#return; {6329#true} is VALID [2020-07-08 23:29:44,129 INFO L263 TraceCheckUtils]: 9: Hoare triple {6329#true} call #t~ret21 := main(); {6329#true} is VALID [2020-07-08 23:29:44,129 INFO L280 TraceCheckUtils]: 10: Hoare triple {6329#true} ~q~0 := 0; {6329#true} is VALID [2020-07-08 23:29:44,129 INFO L280 TraceCheckUtils]: 11: Hoare triple {6329#true} havoc ~method_id~0; {6329#true} is VALID [2020-07-08 23:29:44,129 INFO L280 TraceCheckUtils]: 12: Hoare triple {6329#true} ~this_state~0 := 0; {6329#true} is VALID [2020-07-08 23:29:44,130 INFO L280 TraceCheckUtils]: 13: Hoare triple {6329#true} goto; {6329#true} is VALID [2020-07-08 23:29:44,130 INFO L280 TraceCheckUtils]: 14: Hoare triple {6329#true} assume !false; {6329#true} is VALID [2020-07-08 23:29:44,130 INFO L280 TraceCheckUtils]: 15: Hoare triple {6329#true} assume 0 == ~q~0; {6329#true} is VALID [2020-07-08 23:29:44,131 INFO L280 TraceCheckUtils]: 16: Hoare triple {6329#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {6329#true} is VALID [2020-07-08 23:29:44,131 INFO L280 TraceCheckUtils]: 17: Hoare triple {6329#true} assume 0 != #t~nondet0; {6329#true} is VALID [2020-07-08 23:29:44,131 INFO L280 TraceCheckUtils]: 18: Hoare triple {6329#true} havoc #t~nondet0; {6329#true} is VALID [2020-07-08 23:29:44,131 INFO L280 TraceCheckUtils]: 19: Hoare triple {6329#true} ~method_id~0 := 3; {6329#true} is VALID [2020-07-08 23:29:44,132 INFO L280 TraceCheckUtils]: 20: Hoare triple {6329#true} assume !false; {6329#true} is VALID [2020-07-08 23:29:44,139 INFO L280 TraceCheckUtils]: 21: Hoare triple {6329#true} ~q~0 := 2; {6339#(= 2 main_~q~0)} is VALID [2020-07-08 23:29:44,139 INFO L280 TraceCheckUtils]: 22: Hoare triple {6339#(= 2 main_~q~0)} ~this_state~0 := 0; {6339#(= 2 main_~q~0)} is VALID [2020-07-08 23:29:44,142 INFO L280 TraceCheckUtils]: 23: Hoare triple {6339#(= 2 main_~q~0)} assume !false; {6339#(= 2 main_~q~0)} is VALID [2020-07-08 23:29:44,144 INFO L280 TraceCheckUtils]: 24: Hoare triple {6339#(= 2 main_~q~0)} assume !(0 == ~q~0); {6339#(= 2 main_~q~0)} is VALID [2020-07-08 23:29:44,145 INFO L280 TraceCheckUtils]: 25: Hoare triple {6339#(= 2 main_~q~0)} assume !(1 == ~q~0); {6339#(= 2 main_~q~0)} is VALID [2020-07-08 23:29:44,145 INFO L280 TraceCheckUtils]: 26: Hoare triple {6339#(= 2 main_~q~0)} assume !(2 == ~q~0); {6330#false} is VALID [2020-07-08 23:29:44,146 INFO L280 TraceCheckUtils]: 27: Hoare triple {6330#false} assume 3 == ~q~0; {6330#false} is VALID [2020-07-08 23:29:44,146 INFO L280 TraceCheckUtils]: 28: Hoare triple {6330#false} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {6330#false} is VALID [2020-07-08 23:29:44,146 INFO L280 TraceCheckUtils]: 29: Hoare triple {6330#false} assume !(0 != #t~nondet9); {6330#false} is VALID [2020-07-08 23:29:44,146 INFO L280 TraceCheckUtils]: 30: Hoare triple {6330#false} havoc #t~nondet9; {6330#false} is VALID [2020-07-08 23:29:44,147 INFO L280 TraceCheckUtils]: 31: Hoare triple {6330#false} assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; {6330#false} is VALID [2020-07-08 23:29:44,147 INFO L280 TraceCheckUtils]: 32: Hoare triple {6330#false} assume !(0 != #t~nondet10); {6330#false} is VALID [2020-07-08 23:29:44,147 INFO L280 TraceCheckUtils]: 33: Hoare triple {6330#false} havoc #t~nondet10; {6330#false} is VALID [2020-07-08 23:29:44,147 INFO L280 TraceCheckUtils]: 34: Hoare triple {6330#false} assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; {6330#false} is VALID [2020-07-08 23:29:44,147 INFO L280 TraceCheckUtils]: 35: Hoare triple {6330#false} assume 0 != #t~nondet11; {6330#false} is VALID [2020-07-08 23:29:44,148 INFO L280 TraceCheckUtils]: 36: Hoare triple {6330#false} havoc #t~nondet11; {6330#false} is VALID [2020-07-08 23:29:44,148 INFO L280 TraceCheckUtils]: 37: Hoare triple {6330#false} ~method_id~0 := 4; {6330#false} is VALID [2020-07-08 23:29:44,148 INFO L280 TraceCheckUtils]: 38: Hoare triple {6330#false} assume 2 != ~this_state~0; {6330#false} is VALID [2020-07-08 23:29:44,148 INFO L280 TraceCheckUtils]: 39: Hoare triple {6330#false} assume !false; {6330#false} is VALID [2020-07-08 23:29:44,151 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 23:29:44,151 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [420020643] [2020-07-08 23:29:44,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:29:44,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 23:29:44,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315323122] [2020-07-08 23:29:44,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2020-07-08 23:29:44,153 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:29:44,153 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 23:29:44,186 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:29:44,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 23:29:44,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:29:44,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 23:29:44,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 23:29:44,187 INFO L87 Difference]: Start difference. First operand 243 states and 288 transitions. Second operand 4 states. [2020-07-08 23:29:45,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:29:45,582 INFO L93 Difference]: Finished difference Result 407 states and 484 transitions. [2020-07-08 23:29:45,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 23:29:45,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2020-07-08 23:29:45,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:29:45,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 23:29:45,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 365 transitions. [2020-07-08 23:29:45,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 23:29:45,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 365 transitions. [2020-07-08 23:29:45,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 365 transitions. [2020-07-08 23:29:46,023 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 365 edges. 365 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:29:46,027 INFO L225 Difference]: With dead ends: 407 [2020-07-08 23:29:46,027 INFO L226 Difference]: Without dead ends: 188 [2020-07-08 23:29:46,028 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 23:29:46,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-07-08 23:29:46,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2020-07-08 23:29:46,718 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:29:46,718 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand 186 states. [2020-07-08 23:29:46,718 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand 186 states. [2020-07-08 23:29:46,718 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 186 states. [2020-07-08 23:29:46,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:29:46,724 INFO L93 Difference]: Finished difference Result 188 states and 219 transitions. [2020-07-08 23:29:46,724 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 219 transitions. [2020-07-08 23:29:46,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:29:46,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:29:46,725 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand 188 states. [2020-07-08 23:29:46,725 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 188 states. [2020-07-08 23:29:46,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:29:46,730 INFO L93 Difference]: Finished difference Result 188 states and 219 transitions. [2020-07-08 23:29:46,730 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 219 transitions. [2020-07-08 23:29:46,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:29:46,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:29:46,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:29:46,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:29:46,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-07-08 23:29:46,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 218 transitions. [2020-07-08 23:29:46,736 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 218 transitions. Word has length 40 [2020-07-08 23:29:46,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:29:46,736 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 218 transitions. [2020-07-08 23:29:46,736 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 23:29:46,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 186 states and 218 transitions. [2020-07-08 23:29:47,049 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:29:47,049 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 218 transitions. [2020-07-08 23:29:47,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-08 23:29:47,050 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:29:47,051 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:29:47,051 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 23:29:47,051 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:29:47,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:29:47,052 INFO L82 PathProgramCache]: Analyzing trace with hash 946604760, now seen corresponding path program 1 times [2020-07-08 23:29:47,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:29:47,052 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [985442394] [2020-07-08 23:29:47,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:29:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:29:47,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:29:47,195 INFO L280 TraceCheckUtils]: 0: Hoare triple {7919#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {7908#true} is VALID [2020-07-08 23:29:47,195 INFO L280 TraceCheckUtils]: 1: Hoare triple {7908#true} ~m_initVerify~0 := 2; {7908#true} is VALID [2020-07-08 23:29:47,195 INFO L280 TraceCheckUtils]: 2: Hoare triple {7908#true} ~m_Signature~0 := 3; {7908#true} is VALID [2020-07-08 23:29:47,196 INFO L280 TraceCheckUtils]: 3: Hoare triple {7908#true} ~m_sign~0 := 4; {7908#true} is VALID [2020-07-08 23:29:47,196 INFO L280 TraceCheckUtils]: 4: Hoare triple {7908#true} ~m_verify~0 := 5; {7908#true} is VALID [2020-07-08 23:29:47,196 INFO L280 TraceCheckUtils]: 5: Hoare triple {7908#true} ~m_update~0 := 6; {7908#true} is VALID [2020-07-08 23:29:47,196 INFO L280 TraceCheckUtils]: 6: Hoare triple {7908#true} assume true; {7908#true} is VALID [2020-07-08 23:29:47,197 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {7908#true} {7908#true} #484#return; {7908#true} is VALID [2020-07-08 23:29:47,205 INFO L263 TraceCheckUtils]: 0: Hoare triple {7908#true} call ULTIMATE.init(); {7919#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID [2020-07-08 23:29:47,205 INFO L280 TraceCheckUtils]: 1: Hoare triple {7919#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {7908#true} is VALID [2020-07-08 23:29:47,205 INFO L280 TraceCheckUtils]: 2: Hoare triple {7908#true} ~m_initVerify~0 := 2; {7908#true} is VALID [2020-07-08 23:29:47,206 INFO L280 TraceCheckUtils]: 3: Hoare triple {7908#true} ~m_Signature~0 := 3; {7908#true} is VALID [2020-07-08 23:29:47,206 INFO L280 TraceCheckUtils]: 4: Hoare triple {7908#true} ~m_sign~0 := 4; {7908#true} is VALID [2020-07-08 23:29:47,206 INFO L280 TraceCheckUtils]: 5: Hoare triple {7908#true} ~m_verify~0 := 5; {7908#true} is VALID [2020-07-08 23:29:47,206 INFO L280 TraceCheckUtils]: 6: Hoare triple {7908#true} ~m_update~0 := 6; {7908#true} is VALID [2020-07-08 23:29:47,206 INFO L280 TraceCheckUtils]: 7: Hoare triple {7908#true} assume true; {7908#true} is VALID [2020-07-08 23:29:47,207 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {7908#true} {7908#true} #484#return; {7908#true} is VALID [2020-07-08 23:29:47,207 INFO L263 TraceCheckUtils]: 9: Hoare triple {7908#true} call #t~ret21 := main(); {7908#true} is VALID [2020-07-08 23:29:47,207 INFO L280 TraceCheckUtils]: 10: Hoare triple {7908#true} ~q~0 := 0; {7908#true} is VALID [2020-07-08 23:29:47,207 INFO L280 TraceCheckUtils]: 11: Hoare triple {7908#true} havoc ~method_id~0; {7908#true} is VALID [2020-07-08 23:29:47,208 INFO L280 TraceCheckUtils]: 12: Hoare triple {7908#true} ~this_state~0 := 0; {7908#true} is VALID [2020-07-08 23:29:47,208 INFO L280 TraceCheckUtils]: 13: Hoare triple {7908#true} goto; {7908#true} is VALID [2020-07-08 23:29:47,208 INFO L280 TraceCheckUtils]: 14: Hoare triple {7908#true} assume !false; {7908#true} is VALID [2020-07-08 23:29:47,208 INFO L280 TraceCheckUtils]: 15: Hoare triple {7908#true} assume 0 == ~q~0; {7908#true} is VALID [2020-07-08 23:29:47,208 INFO L280 TraceCheckUtils]: 16: Hoare triple {7908#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {7908#true} is VALID [2020-07-08 23:29:47,209 INFO L280 TraceCheckUtils]: 17: Hoare triple {7908#true} assume 0 != #t~nondet0; {7908#true} is VALID [2020-07-08 23:29:47,209 INFO L280 TraceCheckUtils]: 18: Hoare triple {7908#true} havoc #t~nondet0; {7908#true} is VALID [2020-07-08 23:29:47,210 INFO L280 TraceCheckUtils]: 19: Hoare triple {7908#true} ~method_id~0 := 3; {7908#true} is VALID [2020-07-08 23:29:47,210 INFO L280 TraceCheckUtils]: 20: Hoare triple {7908#true} assume !false; {7908#true} is VALID [2020-07-08 23:29:47,210 INFO L280 TraceCheckUtils]: 21: Hoare triple {7908#true} ~q~0 := 2; {7908#true} is VALID [2020-07-08 23:29:47,211 INFO L280 TraceCheckUtils]: 22: Hoare triple {7908#true} ~this_state~0 := 0; {7908#true} is VALID [2020-07-08 23:29:47,211 INFO L280 TraceCheckUtils]: 23: Hoare triple {7908#true} assume !false; {7908#true} is VALID [2020-07-08 23:29:47,212 INFO L280 TraceCheckUtils]: 24: Hoare triple {7908#true} assume !(0 == ~q~0); {7908#true} is VALID [2020-07-08 23:29:47,212 INFO L280 TraceCheckUtils]: 25: Hoare triple {7908#true} assume !(1 == ~q~0); {7908#true} is VALID [2020-07-08 23:29:47,213 INFO L280 TraceCheckUtils]: 26: Hoare triple {7908#true} assume 2 == ~q~0; {7908#true} is VALID [2020-07-08 23:29:47,213 INFO L280 TraceCheckUtils]: 27: Hoare triple {7908#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {7908#true} is VALID [2020-07-08 23:29:47,214 INFO L280 TraceCheckUtils]: 28: Hoare triple {7908#true} assume 0 != #t~nondet4; {7908#true} is VALID [2020-07-08 23:29:47,214 INFO L280 TraceCheckUtils]: 29: Hoare triple {7908#true} havoc #t~nondet4; {7908#true} is VALID [2020-07-08 23:29:47,215 INFO L280 TraceCheckUtils]: 30: Hoare triple {7908#true} ~method_id~0 := 1; {7908#true} is VALID [2020-07-08 23:29:47,215 INFO L280 TraceCheckUtils]: 31: Hoare triple {7908#true} assume !false; {7908#true} is VALID [2020-07-08 23:29:47,219 INFO L280 TraceCheckUtils]: 32: Hoare triple {7908#true} ~q~0 := 3; {7918#(<= 3 main_~q~0)} is VALID [2020-07-08 23:29:47,220 INFO L280 TraceCheckUtils]: 33: Hoare triple {7918#(<= 3 main_~q~0)} ~this_state~0 := 2; {7918#(<= 3 main_~q~0)} is VALID [2020-07-08 23:29:47,221 INFO L280 TraceCheckUtils]: 34: Hoare triple {7918#(<= 3 main_~q~0)} assume !false; {7918#(<= 3 main_~q~0)} is VALID [2020-07-08 23:29:47,222 INFO L280 TraceCheckUtils]: 35: Hoare triple {7918#(<= 3 main_~q~0)} assume !(0 == ~q~0); {7918#(<= 3 main_~q~0)} is VALID [2020-07-08 23:29:47,223 INFO L280 TraceCheckUtils]: 36: Hoare triple {7918#(<= 3 main_~q~0)} assume !(1 == ~q~0); {7918#(<= 3 main_~q~0)} is VALID [2020-07-08 23:29:47,224 INFO L280 TraceCheckUtils]: 37: Hoare triple {7918#(<= 3 main_~q~0)} assume 2 == ~q~0; {7909#false} is VALID [2020-07-08 23:29:47,224 INFO L280 TraceCheckUtils]: 38: Hoare triple {7909#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {7909#false} is VALID [2020-07-08 23:29:47,224 INFO L280 TraceCheckUtils]: 39: Hoare triple {7909#false} assume !(0 != #t~nondet4); {7909#false} is VALID [2020-07-08 23:29:47,225 INFO L280 TraceCheckUtils]: 40: Hoare triple {7909#false} havoc #t~nondet4; {7909#false} is VALID [2020-07-08 23:29:47,225 INFO L280 TraceCheckUtils]: 41: Hoare triple {7909#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {7909#false} is VALID [2020-07-08 23:29:47,225 INFO L280 TraceCheckUtils]: 42: Hoare triple {7909#false} assume !(0 != #t~nondet5); {7909#false} is VALID [2020-07-08 23:29:47,226 INFO L280 TraceCheckUtils]: 43: Hoare triple {7909#false} havoc #t~nondet5; {7909#false} is VALID [2020-07-08 23:29:47,226 INFO L280 TraceCheckUtils]: 44: Hoare triple {7909#false} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {7909#false} is VALID [2020-07-08 23:29:47,226 INFO L280 TraceCheckUtils]: 45: Hoare triple {7909#false} assume 0 != #t~nondet6; {7909#false} is VALID [2020-07-08 23:29:47,227 INFO L280 TraceCheckUtils]: 46: Hoare triple {7909#false} havoc #t~nondet6; {7909#false} is VALID [2020-07-08 23:29:47,227 INFO L280 TraceCheckUtils]: 47: Hoare triple {7909#false} ~method_id~0 := 4; {7909#false} is VALID [2020-07-08 23:29:47,227 INFO L280 TraceCheckUtils]: 48: Hoare triple {7909#false} assume 2 == ~this_state~0; {7909#false} is VALID [2020-07-08 23:29:47,228 INFO L280 TraceCheckUtils]: 49: Hoare triple {7909#false} assume !false; {7909#false} is VALID [2020-07-08 23:29:47,234 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-08 23:29:47,235 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [985442394] [2020-07-08 23:29:47,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:29:47,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 23:29:47,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251319117] [2020-07-08 23:29:47,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2020-07-08 23:29:47,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:29:47,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 23:29:47,296 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:29:47,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 23:29:47,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:29:47,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 23:29:47,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 23:29:47,298 INFO L87 Difference]: Start difference. First operand 186 states and 218 transitions. Second operand 4 states. [2020-07-08 23:29:48,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:29:48,493 INFO L93 Difference]: Finished difference Result 301 states and 357 transitions. [2020-07-08 23:29:48,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 23:29:48,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2020-07-08 23:29:48,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:29:48,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 23:29:48,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 352 transitions. [2020-07-08 23:29:48,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 23:29:48,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 352 transitions. [2020-07-08 23:29:48,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 352 transitions. [2020-07-08 23:29:48,900 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 352 edges. 352 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:29:48,903 INFO L225 Difference]: With dead ends: 301 [2020-07-08 23:29:48,903 INFO L226 Difference]: Without dead ends: 158 [2020-07-08 23:29:48,904 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 23:29:48,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-07-08 23:29:49,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2020-07-08 23:29:49,455 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:29:49,455 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand 158 states. [2020-07-08 23:29:49,455 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 158 states. [2020-07-08 23:29:49,455 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 158 states. [2020-07-08 23:29:49,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:29:49,460 INFO L93 Difference]: Finished difference Result 158 states and 184 transitions. [2020-07-08 23:29:49,460 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 184 transitions. [2020-07-08 23:29:49,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:29:49,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:29:49,461 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 158 states. [2020-07-08 23:29:49,461 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 158 states. [2020-07-08 23:29:49,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:29:49,465 INFO L93 Difference]: Finished difference Result 158 states and 184 transitions. [2020-07-08 23:29:49,465 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 184 transitions. [2020-07-08 23:29:49,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:29:49,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:29:49,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:29:49,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:29:49,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2020-07-08 23:29:49,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 184 transitions. [2020-07-08 23:29:49,469 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 184 transitions. Word has length 50 [2020-07-08 23:29:49,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:29:49,470 INFO L479 AbstractCegarLoop]: Abstraction has 158 states and 184 transitions. [2020-07-08 23:29:49,470 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 23:29:49,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 158 states and 184 transitions. [2020-07-08 23:29:49,744 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:29:49,745 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 184 transitions. [2020-07-08 23:29:49,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-08 23:29:49,746 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:29:49,746 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:29:49,747 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 23:29:49,747 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:29:49,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:29:49,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1459500481, now seen corresponding path program 1 times [2020-07-08 23:29:49,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:29:49,748 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [359133355] [2020-07-08 23:29:49,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:29:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:29:49,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:29:49,869 INFO L280 TraceCheckUtils]: 0: Hoare triple {9170#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {9159#true} is VALID [2020-07-08 23:29:49,870 INFO L280 TraceCheckUtils]: 1: Hoare triple {9159#true} ~m_initVerify~0 := 2; {9159#true} is VALID [2020-07-08 23:29:49,870 INFO L280 TraceCheckUtils]: 2: Hoare triple {9159#true} ~m_Signature~0 := 3; {9159#true} is VALID [2020-07-08 23:29:49,872 INFO L280 TraceCheckUtils]: 3: Hoare triple {9159#true} ~m_sign~0 := 4; {9159#true} is VALID [2020-07-08 23:29:49,872 INFO L280 TraceCheckUtils]: 4: Hoare triple {9159#true} ~m_verify~0 := 5; {9159#true} is VALID [2020-07-08 23:29:49,873 INFO L280 TraceCheckUtils]: 5: Hoare triple {9159#true} ~m_update~0 := 6; {9159#true} is VALID [2020-07-08 23:29:49,873 INFO L280 TraceCheckUtils]: 6: Hoare triple {9159#true} assume true; {9159#true} is VALID [2020-07-08 23:29:49,873 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {9159#true} {9159#true} #484#return; {9159#true} is VALID [2020-07-08 23:29:49,879 INFO L263 TraceCheckUtils]: 0: Hoare triple {9159#true} call ULTIMATE.init(); {9170#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID [2020-07-08 23:29:49,880 INFO L280 TraceCheckUtils]: 1: Hoare triple {9170#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {9159#true} is VALID [2020-07-08 23:29:49,880 INFO L280 TraceCheckUtils]: 2: Hoare triple {9159#true} ~m_initVerify~0 := 2; {9159#true} is VALID [2020-07-08 23:29:49,880 INFO L280 TraceCheckUtils]: 3: Hoare triple {9159#true} ~m_Signature~0 := 3; {9159#true} is VALID [2020-07-08 23:29:49,880 INFO L280 TraceCheckUtils]: 4: Hoare triple {9159#true} ~m_sign~0 := 4; {9159#true} is VALID [2020-07-08 23:29:49,881 INFO L280 TraceCheckUtils]: 5: Hoare triple {9159#true} ~m_verify~0 := 5; {9159#true} is VALID [2020-07-08 23:29:49,881 INFO L280 TraceCheckUtils]: 6: Hoare triple {9159#true} ~m_update~0 := 6; {9159#true} is VALID [2020-07-08 23:29:49,881 INFO L280 TraceCheckUtils]: 7: Hoare triple {9159#true} assume true; {9159#true} is VALID [2020-07-08 23:29:49,881 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {9159#true} {9159#true} #484#return; {9159#true} is VALID [2020-07-08 23:29:49,882 INFO L263 TraceCheckUtils]: 9: Hoare triple {9159#true} call #t~ret21 := main(); {9159#true} is VALID [2020-07-08 23:29:49,882 INFO L280 TraceCheckUtils]: 10: Hoare triple {9159#true} ~q~0 := 0; {9159#true} is VALID [2020-07-08 23:29:49,882 INFO L280 TraceCheckUtils]: 11: Hoare triple {9159#true} havoc ~method_id~0; {9159#true} is VALID [2020-07-08 23:29:49,882 INFO L280 TraceCheckUtils]: 12: Hoare triple {9159#true} ~this_state~0 := 0; {9159#true} is VALID [2020-07-08 23:29:49,882 INFO L280 TraceCheckUtils]: 13: Hoare triple {9159#true} goto; {9159#true} is VALID [2020-07-08 23:29:49,883 INFO L280 TraceCheckUtils]: 14: Hoare triple {9159#true} assume !false; {9159#true} is VALID [2020-07-08 23:29:49,883 INFO L280 TraceCheckUtils]: 15: Hoare triple {9159#true} assume 0 == ~q~0; {9159#true} is VALID [2020-07-08 23:29:49,883 INFO L280 TraceCheckUtils]: 16: Hoare triple {9159#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {9159#true} is VALID [2020-07-08 23:29:49,883 INFO L280 TraceCheckUtils]: 17: Hoare triple {9159#true} assume 0 != #t~nondet0; {9159#true} is VALID [2020-07-08 23:29:49,883 INFO L280 TraceCheckUtils]: 18: Hoare triple {9159#true} havoc #t~nondet0; {9159#true} is VALID [2020-07-08 23:29:49,884 INFO L280 TraceCheckUtils]: 19: Hoare triple {9159#true} ~method_id~0 := 3; {9159#true} is VALID [2020-07-08 23:29:49,884 INFO L280 TraceCheckUtils]: 20: Hoare triple {9159#true} assume !false; {9159#true} is VALID [2020-07-08 23:29:49,884 INFO L280 TraceCheckUtils]: 21: Hoare triple {9159#true} ~q~0 := 2; {9159#true} is VALID [2020-07-08 23:29:49,885 INFO L280 TraceCheckUtils]: 22: Hoare triple {9159#true} ~this_state~0 := 0; {9159#true} is VALID [2020-07-08 23:29:49,885 INFO L280 TraceCheckUtils]: 23: Hoare triple {9159#true} assume !false; {9159#true} is VALID [2020-07-08 23:29:49,885 INFO L280 TraceCheckUtils]: 24: Hoare triple {9159#true} assume !(0 == ~q~0); {9159#true} is VALID [2020-07-08 23:29:49,886 INFO L280 TraceCheckUtils]: 25: Hoare triple {9159#true} assume !(1 == ~q~0); {9159#true} is VALID [2020-07-08 23:29:49,886 INFO L280 TraceCheckUtils]: 26: Hoare triple {9159#true} assume 2 == ~q~0; {9159#true} is VALID [2020-07-08 23:29:49,886 INFO L280 TraceCheckUtils]: 27: Hoare triple {9159#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {9159#true} is VALID [2020-07-08 23:29:49,887 INFO L280 TraceCheckUtils]: 28: Hoare triple {9159#true} assume 0 != #t~nondet4; {9159#true} is VALID [2020-07-08 23:29:49,887 INFO L280 TraceCheckUtils]: 29: Hoare triple {9159#true} havoc #t~nondet4; {9159#true} is VALID [2020-07-08 23:29:49,887 INFO L280 TraceCheckUtils]: 30: Hoare triple {9159#true} ~method_id~0 := 1; {9159#true} is VALID [2020-07-08 23:29:49,887 INFO L280 TraceCheckUtils]: 31: Hoare triple {9159#true} assume !false; {9159#true} is VALID [2020-07-08 23:29:49,887 INFO L280 TraceCheckUtils]: 32: Hoare triple {9159#true} ~q~0 := 3; {9159#true} is VALID [2020-07-08 23:29:49,888 INFO L280 TraceCheckUtils]: 33: Hoare triple {9159#true} ~this_state~0 := 2; {9169#(= 2 main_~this_state~0)} is VALID [2020-07-08 23:29:49,889 INFO L280 TraceCheckUtils]: 34: Hoare triple {9169#(= 2 main_~this_state~0)} assume !false; {9169#(= 2 main_~this_state~0)} is VALID [2020-07-08 23:29:49,889 INFO L280 TraceCheckUtils]: 35: Hoare triple {9169#(= 2 main_~this_state~0)} assume !(0 == ~q~0); {9169#(= 2 main_~this_state~0)} is VALID [2020-07-08 23:29:49,890 INFO L280 TraceCheckUtils]: 36: Hoare triple {9169#(= 2 main_~this_state~0)} assume !(1 == ~q~0); {9169#(= 2 main_~this_state~0)} is VALID [2020-07-08 23:29:49,890 INFO L280 TraceCheckUtils]: 37: Hoare triple {9169#(= 2 main_~this_state~0)} assume !(2 == ~q~0); {9169#(= 2 main_~this_state~0)} is VALID [2020-07-08 23:29:49,891 INFO L280 TraceCheckUtils]: 38: Hoare triple {9169#(= 2 main_~this_state~0)} assume 3 == ~q~0; {9169#(= 2 main_~this_state~0)} is VALID [2020-07-08 23:29:49,891 INFO L280 TraceCheckUtils]: 39: Hoare triple {9169#(= 2 main_~this_state~0)} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {9169#(= 2 main_~this_state~0)} is VALID [2020-07-08 23:29:49,892 INFO L280 TraceCheckUtils]: 40: Hoare triple {9169#(= 2 main_~this_state~0)} assume !(0 != #t~nondet9); {9169#(= 2 main_~this_state~0)} is VALID [2020-07-08 23:29:49,892 INFO L280 TraceCheckUtils]: 41: Hoare triple {9169#(= 2 main_~this_state~0)} havoc #t~nondet9; {9169#(= 2 main_~this_state~0)} is VALID [2020-07-08 23:29:49,893 INFO L280 TraceCheckUtils]: 42: Hoare triple {9169#(= 2 main_~this_state~0)} assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; {9169#(= 2 main_~this_state~0)} is VALID [2020-07-08 23:29:49,900 INFO L280 TraceCheckUtils]: 43: Hoare triple {9169#(= 2 main_~this_state~0)} assume !(0 != #t~nondet10); {9169#(= 2 main_~this_state~0)} is VALID [2020-07-08 23:29:49,902 INFO L280 TraceCheckUtils]: 44: Hoare triple {9169#(= 2 main_~this_state~0)} havoc #t~nondet10; {9169#(= 2 main_~this_state~0)} is VALID [2020-07-08 23:29:49,903 INFO L280 TraceCheckUtils]: 45: Hoare triple {9169#(= 2 main_~this_state~0)} assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; {9169#(= 2 main_~this_state~0)} is VALID [2020-07-08 23:29:49,904 INFO L280 TraceCheckUtils]: 46: Hoare triple {9169#(= 2 main_~this_state~0)} assume 0 != #t~nondet11; {9169#(= 2 main_~this_state~0)} is VALID [2020-07-08 23:29:49,905 INFO L280 TraceCheckUtils]: 47: Hoare triple {9169#(= 2 main_~this_state~0)} havoc #t~nondet11; {9169#(= 2 main_~this_state~0)} is VALID [2020-07-08 23:29:49,906 INFO L280 TraceCheckUtils]: 48: Hoare triple {9169#(= 2 main_~this_state~0)} ~method_id~0 := 4; {9169#(= 2 main_~this_state~0)} is VALID [2020-07-08 23:29:49,906 INFO L280 TraceCheckUtils]: 49: Hoare triple {9169#(= 2 main_~this_state~0)} assume 2 != ~this_state~0; {9160#false} is VALID [2020-07-08 23:29:49,907 INFO L280 TraceCheckUtils]: 50: Hoare triple {9160#false} assume !false; {9160#false} is VALID [2020-07-08 23:29:49,910 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 23:29:49,910 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [359133355] [2020-07-08 23:29:49,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:29:49,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 23:29:49,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30832038] [2020-07-08 23:29:49,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2020-07-08 23:29:49,912 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:29:49,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 23:29:49,960 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:29:49,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 23:29:49,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:29:49,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 23:29:49,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 23:29:49,961 INFO L87 Difference]: Start difference. First operand 158 states and 184 transitions. Second operand 4 states. [2020-07-08 23:29:51,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:29:51,825 INFO L93 Difference]: Finished difference Result 356 states and 426 transitions. [2020-07-08 23:29:51,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 23:29:51,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2020-07-08 23:29:51,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:29:51,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 23:29:51,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 421 transitions. [2020-07-08 23:29:51,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 23:29:51,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 421 transitions. [2020-07-08 23:29:51,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 421 transitions. [2020-07-08 23:29:52,365 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 421 edges. 421 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:29:52,372 INFO L225 Difference]: With dead ends: 356 [2020-07-08 23:29:52,372 INFO L226 Difference]: Without dead ends: 248 [2020-07-08 23:29:52,373 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-08 23:29:52,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2020-07-08 23:29:53,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 223. [2020-07-08 23:29:53,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:29:53,237 INFO L82 GeneralOperation]: Start isEquivalent. First operand 248 states. Second operand 223 states. [2020-07-08 23:29:53,237 INFO L74 IsIncluded]: Start isIncluded. First operand 248 states. Second operand 223 states. [2020-07-08 23:29:53,237 INFO L87 Difference]: Start difference. First operand 248 states. Second operand 223 states. [2020-07-08 23:29:53,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:29:53,244 INFO L93 Difference]: Finished difference Result 248 states and 286 transitions. [2020-07-08 23:29:53,244 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 286 transitions. [2020-07-08 23:29:53,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:29:53,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:29:53,245 INFO L74 IsIncluded]: Start isIncluded. First operand 223 states. Second operand 248 states. [2020-07-08 23:29:53,246 INFO L87 Difference]: Start difference. First operand 223 states. Second operand 248 states. [2020-07-08 23:29:53,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:29:53,252 INFO L93 Difference]: Finished difference Result 248 states and 286 transitions. [2020-07-08 23:29:53,252 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 286 transitions. [2020-07-08 23:29:53,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:29:53,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:29:53,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:29:53,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:29:53,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2020-07-08 23:29:53,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 262 transitions. [2020-07-08 23:29:53,258 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 262 transitions. Word has length 51 [2020-07-08 23:29:53,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:29:53,258 INFO L479 AbstractCegarLoop]: Abstraction has 223 states and 262 transitions. [2020-07-08 23:29:53,258 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 23:29:53,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 223 states and 262 transitions. [2020-07-08 23:29:53,679 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 262 edges. 262 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:29:53,679 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 262 transitions. [2020-07-08 23:29:53,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-08 23:29:53,681 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:29:53,681 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:29:53,681 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-08 23:29:53,681 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:29:53,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:29:53,682 INFO L82 PathProgramCache]: Analyzing trace with hash -389028907, now seen corresponding path program 1 times [2020-07-08 23:29:53,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:29:53,682 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1660359991] [2020-07-08 23:29:53,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:29:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:29:53,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:29:53,739 INFO L280 TraceCheckUtils]: 0: Hoare triple {10841#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {10830#true} is VALID [2020-07-08 23:29:53,740 INFO L280 TraceCheckUtils]: 1: Hoare triple {10830#true} ~m_initVerify~0 := 2; {10830#true} is VALID [2020-07-08 23:29:53,740 INFO L280 TraceCheckUtils]: 2: Hoare triple {10830#true} ~m_Signature~0 := 3; {10830#true} is VALID [2020-07-08 23:29:53,740 INFO L280 TraceCheckUtils]: 3: Hoare triple {10830#true} ~m_sign~0 := 4; {10830#true} is VALID [2020-07-08 23:29:53,740 INFO L280 TraceCheckUtils]: 4: Hoare triple {10830#true} ~m_verify~0 := 5; {10830#true} is VALID [2020-07-08 23:29:53,741 INFO L280 TraceCheckUtils]: 5: Hoare triple {10830#true} ~m_update~0 := 6; {10830#true} is VALID [2020-07-08 23:29:53,741 INFO L280 TraceCheckUtils]: 6: Hoare triple {10830#true} assume true; {10830#true} is VALID [2020-07-08 23:29:53,741 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {10830#true} {10830#true} #484#return; {10830#true} is VALID [2020-07-08 23:29:53,742 INFO L263 TraceCheckUtils]: 0: Hoare triple {10830#true} call ULTIMATE.init(); {10841#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID [2020-07-08 23:29:53,742 INFO L280 TraceCheckUtils]: 1: Hoare triple {10841#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {10830#true} is VALID [2020-07-08 23:29:53,743 INFO L280 TraceCheckUtils]: 2: Hoare triple {10830#true} ~m_initVerify~0 := 2; {10830#true} is VALID [2020-07-08 23:29:53,743 INFO L280 TraceCheckUtils]: 3: Hoare triple {10830#true} ~m_Signature~0 := 3; {10830#true} is VALID [2020-07-08 23:29:53,743 INFO L280 TraceCheckUtils]: 4: Hoare triple {10830#true} ~m_sign~0 := 4; {10830#true} is VALID [2020-07-08 23:29:53,743 INFO L280 TraceCheckUtils]: 5: Hoare triple {10830#true} ~m_verify~0 := 5; {10830#true} is VALID [2020-07-08 23:29:53,743 INFO L280 TraceCheckUtils]: 6: Hoare triple {10830#true} ~m_update~0 := 6; {10830#true} is VALID [2020-07-08 23:29:53,743 INFO L280 TraceCheckUtils]: 7: Hoare triple {10830#true} assume true; {10830#true} is VALID [2020-07-08 23:29:53,743 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {10830#true} {10830#true} #484#return; {10830#true} is VALID [2020-07-08 23:29:53,744 INFO L263 TraceCheckUtils]: 9: Hoare triple {10830#true} call #t~ret21 := main(); {10830#true} is VALID [2020-07-08 23:29:53,744 INFO L280 TraceCheckUtils]: 10: Hoare triple {10830#true} ~q~0 := 0; {10830#true} is VALID [2020-07-08 23:29:53,744 INFO L280 TraceCheckUtils]: 11: Hoare triple {10830#true} havoc ~method_id~0; {10830#true} is VALID [2020-07-08 23:29:53,744 INFO L280 TraceCheckUtils]: 12: Hoare triple {10830#true} ~this_state~0 := 0; {10830#true} is VALID [2020-07-08 23:29:53,744 INFO L280 TraceCheckUtils]: 13: Hoare triple {10830#true} goto; {10830#true} is VALID [2020-07-08 23:29:53,744 INFO L280 TraceCheckUtils]: 14: Hoare triple {10830#true} assume !false; {10830#true} is VALID [2020-07-08 23:29:53,745 INFO L280 TraceCheckUtils]: 15: Hoare triple {10830#true} assume 0 == ~q~0; {10830#true} is VALID [2020-07-08 23:29:53,745 INFO L280 TraceCheckUtils]: 16: Hoare triple {10830#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {10830#true} is VALID [2020-07-08 23:29:53,745 INFO L280 TraceCheckUtils]: 17: Hoare triple {10830#true} assume 0 != #t~nondet0; {10830#true} is VALID [2020-07-08 23:29:53,745 INFO L280 TraceCheckUtils]: 18: Hoare triple {10830#true} havoc #t~nondet0; {10830#true} is VALID [2020-07-08 23:29:53,745 INFO L280 TraceCheckUtils]: 19: Hoare triple {10830#true} ~method_id~0 := 3; {10830#true} is VALID [2020-07-08 23:29:53,745 INFO L280 TraceCheckUtils]: 20: Hoare triple {10830#true} assume !false; {10830#true} is VALID [2020-07-08 23:29:53,745 INFO L280 TraceCheckUtils]: 21: Hoare triple {10830#true} ~q~0 := 2; {10830#true} is VALID [2020-07-08 23:29:53,746 INFO L280 TraceCheckUtils]: 22: Hoare triple {10830#true} ~this_state~0 := 0; {10830#true} is VALID [2020-07-08 23:29:53,746 INFO L280 TraceCheckUtils]: 23: Hoare triple {10830#true} assume !false; {10830#true} is VALID [2020-07-08 23:29:53,746 INFO L280 TraceCheckUtils]: 24: Hoare triple {10830#true} assume !(0 == ~q~0); {10830#true} is VALID [2020-07-08 23:29:53,746 INFO L280 TraceCheckUtils]: 25: Hoare triple {10830#true} assume !(1 == ~q~0); {10830#true} is VALID [2020-07-08 23:29:53,746 INFO L280 TraceCheckUtils]: 26: Hoare triple {10830#true} assume 2 == ~q~0; {10830#true} is VALID [2020-07-08 23:29:53,746 INFO L280 TraceCheckUtils]: 27: Hoare triple {10830#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {10830#true} is VALID [2020-07-08 23:29:53,746 INFO L280 TraceCheckUtils]: 28: Hoare triple {10830#true} assume 0 != #t~nondet4; {10830#true} is VALID [2020-07-08 23:29:53,747 INFO L280 TraceCheckUtils]: 29: Hoare triple {10830#true} havoc #t~nondet4; {10830#true} is VALID [2020-07-08 23:29:53,747 INFO L280 TraceCheckUtils]: 30: Hoare triple {10830#true} ~method_id~0 := 1; {10830#true} is VALID [2020-07-08 23:29:53,747 INFO L280 TraceCheckUtils]: 31: Hoare triple {10830#true} assume !false; {10830#true} is VALID [2020-07-08 23:29:53,748 INFO L280 TraceCheckUtils]: 32: Hoare triple {10830#true} ~q~0 := 3; {10840#(= 3 main_~q~0)} is VALID [2020-07-08 23:29:53,748 INFO L280 TraceCheckUtils]: 33: Hoare triple {10840#(= 3 main_~q~0)} ~this_state~0 := 2; {10840#(= 3 main_~q~0)} is VALID [2020-07-08 23:29:53,749 INFO L280 TraceCheckUtils]: 34: Hoare triple {10840#(= 3 main_~q~0)} assume !false; {10840#(= 3 main_~q~0)} is VALID [2020-07-08 23:29:53,749 INFO L280 TraceCheckUtils]: 35: Hoare triple {10840#(= 3 main_~q~0)} assume !(0 == ~q~0); {10840#(= 3 main_~q~0)} is VALID [2020-07-08 23:29:53,750 INFO L280 TraceCheckUtils]: 36: Hoare triple {10840#(= 3 main_~q~0)} assume !(1 == ~q~0); {10840#(= 3 main_~q~0)} is VALID [2020-07-08 23:29:53,750 INFO L280 TraceCheckUtils]: 37: Hoare triple {10840#(= 3 main_~q~0)} assume !(2 == ~q~0); {10840#(= 3 main_~q~0)} is VALID [2020-07-08 23:29:53,751 INFO L280 TraceCheckUtils]: 38: Hoare triple {10840#(= 3 main_~q~0)} assume !(3 == ~q~0); {10831#false} is VALID [2020-07-08 23:29:53,751 INFO L280 TraceCheckUtils]: 39: Hoare triple {10831#false} assume 4 == ~q~0; {10831#false} is VALID [2020-07-08 23:29:53,751 INFO L280 TraceCheckUtils]: 40: Hoare triple {10831#false} assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647; {10831#false} is VALID [2020-07-08 23:29:53,751 INFO L280 TraceCheckUtils]: 41: Hoare triple {10831#false} assume !(0 != #t~nondet15); {10831#false} is VALID [2020-07-08 23:29:53,752 INFO L280 TraceCheckUtils]: 42: Hoare triple {10831#false} havoc #t~nondet15; {10831#false} is VALID [2020-07-08 23:29:53,752 INFO L280 TraceCheckUtils]: 43: Hoare triple {10831#false} assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; {10831#false} is VALID [2020-07-08 23:29:53,752 INFO L280 TraceCheckUtils]: 44: Hoare triple {10831#false} assume !(0 != #t~nondet16); {10831#false} is VALID [2020-07-08 23:29:53,752 INFO L280 TraceCheckUtils]: 45: Hoare triple {10831#false} havoc #t~nondet16; {10831#false} is VALID [2020-07-08 23:29:53,752 INFO L280 TraceCheckUtils]: 46: Hoare triple {10831#false} assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647; {10831#false} is VALID [2020-07-08 23:29:53,753 INFO L280 TraceCheckUtils]: 47: Hoare triple {10831#false} assume 0 != #t~nondet17; {10831#false} is VALID [2020-07-08 23:29:53,753 INFO L280 TraceCheckUtils]: 48: Hoare triple {10831#false} havoc #t~nondet17; {10831#false} is VALID [2020-07-08 23:29:53,753 INFO L280 TraceCheckUtils]: 49: Hoare triple {10831#false} ~method_id~0 := 4; {10831#false} is VALID [2020-07-08 23:29:53,753 INFO L280 TraceCheckUtils]: 50: Hoare triple {10831#false} assume 2 == ~this_state~0; {10831#false} is VALID [2020-07-08 23:29:53,753 INFO L280 TraceCheckUtils]: 51: Hoare triple {10831#false} assume !false; {10831#false} is VALID [2020-07-08 23:29:53,756 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 23:29:53,756 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1660359991] [2020-07-08 23:29:53,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:29:53,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 23:29:53,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25621362] [2020-07-08 23:29:53,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2020-07-08 23:29:53,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:29:53,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 23:29:53,808 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:29:53,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 23:29:53,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:29:53,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 23:29:53,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 23:29:53,809 INFO L87 Difference]: Start difference. First operand 223 states and 262 transitions. Second operand 4 states. [2020-07-08 23:29:55,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:29:55,192 INFO L93 Difference]: Finished difference Result 369 states and 437 transitions. [2020-07-08 23:29:55,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 23:29:55,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2020-07-08 23:29:55,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:29:55,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 23:29:55,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 314 transitions. [2020-07-08 23:29:55,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 23:29:55,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 314 transitions. [2020-07-08 23:29:55,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 314 transitions. [2020-07-08 23:29:55,559 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 314 edges. 314 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:29:55,564 INFO L225 Difference]: With dead ends: 369 [2020-07-08 23:29:55,564 INFO L226 Difference]: Without dead ends: 199 [2020-07-08 23:29:55,565 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 23:29:55,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2020-07-08 23:29:56,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 197. [2020-07-08 23:29:56,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:29:56,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 199 states. Second operand 197 states. [2020-07-08 23:29:56,364 INFO L74 IsIncluded]: Start isIncluded. First operand 199 states. Second operand 197 states. [2020-07-08 23:29:56,364 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 197 states. [2020-07-08 23:29:56,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:29:56,369 INFO L93 Difference]: Finished difference Result 199 states and 229 transitions. [2020-07-08 23:29:56,369 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 229 transitions. [2020-07-08 23:29:56,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:29:56,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:29:56,370 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand 199 states. [2020-07-08 23:29:56,370 INFO L87 Difference]: Start difference. First operand 197 states. Second operand 199 states. [2020-07-08 23:29:56,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:29:56,374 INFO L93 Difference]: Finished difference Result 199 states and 229 transitions. [2020-07-08 23:29:56,375 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 229 transitions. [2020-07-08 23:29:56,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:29:56,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:29:56,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:29:56,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:29:56,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2020-07-08 23:29:56,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 228 transitions. [2020-07-08 23:29:56,379 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 228 transitions. Word has length 52 [2020-07-08 23:29:56,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:29:56,380 INFO L479 AbstractCegarLoop]: Abstraction has 197 states and 228 transitions. [2020-07-08 23:29:56,380 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 23:29:56,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 197 states and 228 transitions. [2020-07-08 23:29:56,736 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:29:56,737 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 228 transitions. [2020-07-08 23:29:56,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-08 23:29:56,738 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:29:56,738 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:29:56,738 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-08 23:29:56,739 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:29:56,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:29:56,739 INFO L82 PathProgramCache]: Analyzing trace with hash 910217494, now seen corresponding path program 1 times [2020-07-08 23:29:56,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:29:56,740 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [870837009] [2020-07-08 23:29:56,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:29:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:29:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:29:56,799 INFO L280 TraceCheckUtils]: 0: Hoare triple {12388#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {12377#true} is VALID [2020-07-08 23:29:56,800 INFO L280 TraceCheckUtils]: 1: Hoare triple {12377#true} ~m_initVerify~0 := 2; {12377#true} is VALID [2020-07-08 23:29:56,800 INFO L280 TraceCheckUtils]: 2: Hoare triple {12377#true} ~m_Signature~0 := 3; {12377#true} is VALID [2020-07-08 23:29:56,800 INFO L280 TraceCheckUtils]: 3: Hoare triple {12377#true} ~m_sign~0 := 4; {12377#true} is VALID [2020-07-08 23:29:56,800 INFO L280 TraceCheckUtils]: 4: Hoare triple {12377#true} ~m_verify~0 := 5; {12377#true} is VALID [2020-07-08 23:29:56,800 INFO L280 TraceCheckUtils]: 5: Hoare triple {12377#true} ~m_update~0 := 6; {12377#true} is VALID [2020-07-08 23:29:56,801 INFO L280 TraceCheckUtils]: 6: Hoare triple {12377#true} assume true; {12377#true} is VALID [2020-07-08 23:29:56,801 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {12377#true} {12377#true} #484#return; {12377#true} is VALID [2020-07-08 23:29:56,802 INFO L263 TraceCheckUtils]: 0: Hoare triple {12377#true} call ULTIMATE.init(); {12388#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID [2020-07-08 23:29:56,802 INFO L280 TraceCheckUtils]: 1: Hoare triple {12388#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {12377#true} is VALID [2020-07-08 23:29:56,803 INFO L280 TraceCheckUtils]: 2: Hoare triple {12377#true} ~m_initVerify~0 := 2; {12377#true} is VALID [2020-07-08 23:29:56,803 INFO L280 TraceCheckUtils]: 3: Hoare triple {12377#true} ~m_Signature~0 := 3; {12377#true} is VALID [2020-07-08 23:29:56,803 INFO L280 TraceCheckUtils]: 4: Hoare triple {12377#true} ~m_sign~0 := 4; {12377#true} is VALID [2020-07-08 23:29:56,803 INFO L280 TraceCheckUtils]: 5: Hoare triple {12377#true} ~m_verify~0 := 5; {12377#true} is VALID [2020-07-08 23:29:56,804 INFO L280 TraceCheckUtils]: 6: Hoare triple {12377#true} ~m_update~0 := 6; {12377#true} is VALID [2020-07-08 23:29:56,804 INFO L280 TraceCheckUtils]: 7: Hoare triple {12377#true} assume true; {12377#true} is VALID [2020-07-08 23:29:56,804 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {12377#true} {12377#true} #484#return; {12377#true} is VALID [2020-07-08 23:29:56,804 INFO L263 TraceCheckUtils]: 9: Hoare triple {12377#true} call #t~ret21 := main(); {12377#true} is VALID [2020-07-08 23:29:56,804 INFO L280 TraceCheckUtils]: 10: Hoare triple {12377#true} ~q~0 := 0; {12377#true} is VALID [2020-07-08 23:29:56,805 INFO L280 TraceCheckUtils]: 11: Hoare triple {12377#true} havoc ~method_id~0; {12377#true} is VALID [2020-07-08 23:29:56,805 INFO L280 TraceCheckUtils]: 12: Hoare triple {12377#true} ~this_state~0 := 0; {12377#true} is VALID [2020-07-08 23:29:56,805 INFO L280 TraceCheckUtils]: 13: Hoare triple {12377#true} goto; {12377#true} is VALID [2020-07-08 23:29:56,805 INFO L280 TraceCheckUtils]: 14: Hoare triple {12377#true} assume !false; {12377#true} is VALID [2020-07-08 23:29:56,805 INFO L280 TraceCheckUtils]: 15: Hoare triple {12377#true} assume 0 == ~q~0; {12377#true} is VALID [2020-07-08 23:29:56,806 INFO L280 TraceCheckUtils]: 16: Hoare triple {12377#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {12377#true} is VALID [2020-07-08 23:29:56,806 INFO L280 TraceCheckUtils]: 17: Hoare triple {12377#true} assume 0 != #t~nondet0; {12377#true} is VALID [2020-07-08 23:29:56,806 INFO L280 TraceCheckUtils]: 18: Hoare triple {12377#true} havoc #t~nondet0; {12377#true} is VALID [2020-07-08 23:29:56,806 INFO L280 TraceCheckUtils]: 19: Hoare triple {12377#true} ~method_id~0 := 3; {12377#true} is VALID [2020-07-08 23:29:56,806 INFO L280 TraceCheckUtils]: 20: Hoare triple {12377#true} assume !false; {12377#true} is VALID [2020-07-08 23:29:56,807 INFO L280 TraceCheckUtils]: 21: Hoare triple {12377#true} ~q~0 := 2; {12377#true} is VALID [2020-07-08 23:29:56,807 INFO L280 TraceCheckUtils]: 22: Hoare triple {12377#true} ~this_state~0 := 0; {12377#true} is VALID [2020-07-08 23:29:56,807 INFO L280 TraceCheckUtils]: 23: Hoare triple {12377#true} assume !false; {12377#true} is VALID [2020-07-08 23:29:56,807 INFO L280 TraceCheckUtils]: 24: Hoare triple {12377#true} assume !(0 == ~q~0); {12377#true} is VALID [2020-07-08 23:29:56,807 INFO L280 TraceCheckUtils]: 25: Hoare triple {12377#true} assume !(1 == ~q~0); {12377#true} is VALID [2020-07-08 23:29:56,808 INFO L280 TraceCheckUtils]: 26: Hoare triple {12377#true} assume 2 == ~q~0; {12377#true} is VALID [2020-07-08 23:29:56,808 INFO L280 TraceCheckUtils]: 27: Hoare triple {12377#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {12377#true} is VALID [2020-07-08 23:29:56,808 INFO L280 TraceCheckUtils]: 28: Hoare triple {12377#true} assume !(0 != #t~nondet4); {12377#true} is VALID [2020-07-08 23:29:56,808 INFO L280 TraceCheckUtils]: 29: Hoare triple {12377#true} havoc #t~nondet4; {12377#true} is VALID [2020-07-08 23:29:56,808 INFO L280 TraceCheckUtils]: 30: Hoare triple {12377#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {12377#true} is VALID [2020-07-08 23:29:56,809 INFO L280 TraceCheckUtils]: 31: Hoare triple {12377#true} assume 0 != #t~nondet5; {12377#true} is VALID [2020-07-08 23:29:56,809 INFO L280 TraceCheckUtils]: 32: Hoare triple {12377#true} havoc #t~nondet5; {12377#true} is VALID [2020-07-08 23:29:56,809 INFO L280 TraceCheckUtils]: 33: Hoare triple {12377#true} ~method_id~0 := 2; {12377#true} is VALID [2020-07-08 23:29:56,809 INFO L280 TraceCheckUtils]: 34: Hoare triple {12377#true} assume !false; {12377#true} is VALID [2020-07-08 23:29:56,835 INFO L280 TraceCheckUtils]: 35: Hoare triple {12377#true} ~q~0 := 4; {12387#(<= 4 main_~q~0)} is VALID [2020-07-08 23:29:56,840 INFO L280 TraceCheckUtils]: 36: Hoare triple {12387#(<= 4 main_~q~0)} ~this_state~0 := 3; {12387#(<= 4 main_~q~0)} is VALID [2020-07-08 23:29:56,841 INFO L280 TraceCheckUtils]: 37: Hoare triple {12387#(<= 4 main_~q~0)} assume !false; {12387#(<= 4 main_~q~0)} is VALID [2020-07-08 23:29:56,845 INFO L280 TraceCheckUtils]: 38: Hoare triple {12387#(<= 4 main_~q~0)} assume !(0 == ~q~0); {12387#(<= 4 main_~q~0)} is VALID [2020-07-08 23:29:56,846 INFO L280 TraceCheckUtils]: 39: Hoare triple {12387#(<= 4 main_~q~0)} assume !(1 == ~q~0); {12387#(<= 4 main_~q~0)} is VALID [2020-07-08 23:29:56,847 INFO L280 TraceCheckUtils]: 40: Hoare triple {12387#(<= 4 main_~q~0)} assume !(2 == ~q~0); {12387#(<= 4 main_~q~0)} is VALID [2020-07-08 23:29:56,848 INFO L280 TraceCheckUtils]: 41: Hoare triple {12387#(<= 4 main_~q~0)} assume 3 == ~q~0; {12378#false} is VALID [2020-07-08 23:29:56,848 INFO L280 TraceCheckUtils]: 42: Hoare triple {12378#false} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {12378#false} is VALID [2020-07-08 23:29:56,848 INFO L280 TraceCheckUtils]: 43: Hoare triple {12378#false} assume !(0 != #t~nondet9); {12378#false} is VALID [2020-07-08 23:29:56,848 INFO L280 TraceCheckUtils]: 44: Hoare triple {12378#false} havoc #t~nondet9; {12378#false} is VALID [2020-07-08 23:29:56,849 INFO L280 TraceCheckUtils]: 45: Hoare triple {12378#false} assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; {12378#false} is VALID [2020-07-08 23:29:56,849 INFO L280 TraceCheckUtils]: 46: Hoare triple {12378#false} assume !(0 != #t~nondet10); {12378#false} is VALID [2020-07-08 23:29:56,849 INFO L280 TraceCheckUtils]: 47: Hoare triple {12378#false} havoc #t~nondet10; {12378#false} is VALID [2020-07-08 23:29:56,849 INFO L280 TraceCheckUtils]: 48: Hoare triple {12378#false} assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; {12378#false} is VALID [2020-07-08 23:29:56,849 INFO L280 TraceCheckUtils]: 49: Hoare triple {12378#false} assume 0 != #t~nondet11; {12378#false} is VALID [2020-07-08 23:29:56,850 INFO L280 TraceCheckUtils]: 50: Hoare triple {12378#false} havoc #t~nondet11; {12378#false} is VALID [2020-07-08 23:29:56,850 INFO L280 TraceCheckUtils]: 51: Hoare triple {12378#false} ~method_id~0 := 4; {12378#false} is VALID [2020-07-08 23:29:56,850 INFO L280 TraceCheckUtils]: 52: Hoare triple {12378#false} assume 2 != ~this_state~0; {12378#false} is VALID [2020-07-08 23:29:56,852 INFO L280 TraceCheckUtils]: 53: Hoare triple {12378#false} assume !false; {12378#false} is VALID [2020-07-08 23:29:56,854 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 23:29:56,854 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [870837009] [2020-07-08 23:29:56,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:29:56,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 23:29:56,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291706297] [2020-07-08 23:29:56,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2020-07-08 23:29:56,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:29:56,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 23:29:56,902 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:29:56,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 23:29:56,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:29:56,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 23:29:56,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 23:29:56,903 INFO L87 Difference]: Start difference. First operand 197 states and 228 transitions. Second operand 4 states. [2020-07-08 23:29:58,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:29:58,062 INFO L93 Difference]: Finished difference Result 300 states and 348 transitions. [2020-07-08 23:29:58,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 23:29:58,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2020-07-08 23:29:58,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:29:58,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 23:29:58,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 300 transitions. [2020-07-08 23:29:58,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 23:29:58,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 300 transitions. [2020-07-08 23:29:58,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 300 transitions. [2020-07-08 23:29:58,408 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 300 edges. 300 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:29:58,412 INFO L225 Difference]: With dead ends: 300 [2020-07-08 23:29:58,412 INFO L226 Difference]: Without dead ends: 156 [2020-07-08 23:29:58,413 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 23:29:58,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2020-07-08 23:29:59,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2020-07-08 23:29:59,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:29:59,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand 156 states. [2020-07-08 23:29:59,109 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 156 states. [2020-07-08 23:29:59,109 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 156 states. [2020-07-08 23:29:59,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:29:59,113 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2020-07-08 23:29:59,114 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions. [2020-07-08 23:29:59,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:29:59,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:29:59,115 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 156 states. [2020-07-08 23:29:59,115 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 156 states. [2020-07-08 23:29:59,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:29:59,130 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2020-07-08 23:29:59,130 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions. [2020-07-08 23:29:59,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:29:59,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:29:59,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:29:59,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:29:59,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-07-08 23:29:59,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 175 transitions. [2020-07-08 23:29:59,135 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 175 transitions. Word has length 54 [2020-07-08 23:29:59,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:29:59,135 INFO L479 AbstractCegarLoop]: Abstraction has 156 states and 175 transitions. [2020-07-08 23:29:59,135 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 23:29:59,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 156 states and 175 transitions. [2020-07-08 23:29:59,402 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:29:59,402 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions. [2020-07-08 23:29:59,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-08 23:29:59,403 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:29:59,404 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:29:59,404 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-08 23:29:59,404 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:29:59,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:29:59,405 INFO L82 PathProgramCache]: Analyzing trace with hash 57784286, now seen corresponding path program 1 times [2020-07-08 23:29:59,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:29:59,405 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [289153925] [2020-07-08 23:29:59,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:29:59,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:29:59,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:29:59,476 INFO L280 TraceCheckUtils]: 0: Hoare triple {13629#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {13618#true} is VALID [2020-07-08 23:29:59,477 INFO L280 TraceCheckUtils]: 1: Hoare triple {13618#true} ~m_initVerify~0 := 2; {13618#true} is VALID [2020-07-08 23:29:59,477 INFO L280 TraceCheckUtils]: 2: Hoare triple {13618#true} ~m_Signature~0 := 3; {13618#true} is VALID [2020-07-08 23:29:59,477 INFO L280 TraceCheckUtils]: 3: Hoare triple {13618#true} ~m_sign~0 := 4; {13618#true} is VALID [2020-07-08 23:29:59,477 INFO L280 TraceCheckUtils]: 4: Hoare triple {13618#true} ~m_verify~0 := 5; {13618#true} is VALID [2020-07-08 23:29:59,478 INFO L280 TraceCheckUtils]: 5: Hoare triple {13618#true} ~m_update~0 := 6; {13618#true} is VALID [2020-07-08 23:29:59,478 INFO L280 TraceCheckUtils]: 6: Hoare triple {13618#true} assume true; {13618#true} is VALID [2020-07-08 23:29:59,478 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {13618#true} {13618#true} #484#return; {13618#true} is VALID [2020-07-08 23:29:59,479 INFO L263 TraceCheckUtils]: 0: Hoare triple {13618#true} call ULTIMATE.init(); {13629#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID [2020-07-08 23:29:59,480 INFO L280 TraceCheckUtils]: 1: Hoare triple {13629#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {13618#true} is VALID [2020-07-08 23:29:59,480 INFO L280 TraceCheckUtils]: 2: Hoare triple {13618#true} ~m_initVerify~0 := 2; {13618#true} is VALID [2020-07-08 23:29:59,480 INFO L280 TraceCheckUtils]: 3: Hoare triple {13618#true} ~m_Signature~0 := 3; {13618#true} is VALID [2020-07-08 23:29:59,480 INFO L280 TraceCheckUtils]: 4: Hoare triple {13618#true} ~m_sign~0 := 4; {13618#true} is VALID [2020-07-08 23:29:59,480 INFO L280 TraceCheckUtils]: 5: Hoare triple {13618#true} ~m_verify~0 := 5; {13618#true} is VALID [2020-07-08 23:29:59,481 INFO L280 TraceCheckUtils]: 6: Hoare triple {13618#true} ~m_update~0 := 6; {13618#true} is VALID [2020-07-08 23:29:59,481 INFO L280 TraceCheckUtils]: 7: Hoare triple {13618#true} assume true; {13618#true} is VALID [2020-07-08 23:29:59,481 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {13618#true} {13618#true} #484#return; {13618#true} is VALID [2020-07-08 23:29:59,481 INFO L263 TraceCheckUtils]: 9: Hoare triple {13618#true} call #t~ret21 := main(); {13618#true} is VALID [2020-07-08 23:29:59,481 INFO L280 TraceCheckUtils]: 10: Hoare triple {13618#true} ~q~0 := 0; {13618#true} is VALID [2020-07-08 23:29:59,482 INFO L280 TraceCheckUtils]: 11: Hoare triple {13618#true} havoc ~method_id~0; {13618#true} is VALID [2020-07-08 23:29:59,482 INFO L280 TraceCheckUtils]: 12: Hoare triple {13618#true} ~this_state~0 := 0; {13618#true} is VALID [2020-07-08 23:29:59,482 INFO L280 TraceCheckUtils]: 13: Hoare triple {13618#true} goto; {13618#true} is VALID [2020-07-08 23:29:59,482 INFO L280 TraceCheckUtils]: 14: Hoare triple {13618#true} assume !false; {13618#true} is VALID [2020-07-08 23:29:59,483 INFO L280 TraceCheckUtils]: 15: Hoare triple {13618#true} assume 0 == ~q~0; {13618#true} is VALID [2020-07-08 23:29:59,483 INFO L280 TraceCheckUtils]: 16: Hoare triple {13618#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {13618#true} is VALID [2020-07-08 23:29:59,483 INFO L280 TraceCheckUtils]: 17: Hoare triple {13618#true} assume 0 != #t~nondet0; {13618#true} is VALID [2020-07-08 23:29:59,483 INFO L280 TraceCheckUtils]: 18: Hoare triple {13618#true} havoc #t~nondet0; {13618#true} is VALID [2020-07-08 23:29:59,483 INFO L280 TraceCheckUtils]: 19: Hoare triple {13618#true} ~method_id~0 := 3; {13618#true} is VALID [2020-07-08 23:29:59,484 INFO L280 TraceCheckUtils]: 20: Hoare triple {13618#true} assume !false; {13618#true} is VALID [2020-07-08 23:29:59,484 INFO L280 TraceCheckUtils]: 21: Hoare triple {13618#true} ~q~0 := 2; {13618#true} is VALID [2020-07-08 23:29:59,484 INFO L280 TraceCheckUtils]: 22: Hoare triple {13618#true} ~this_state~0 := 0; {13618#true} is VALID [2020-07-08 23:29:59,484 INFO L280 TraceCheckUtils]: 23: Hoare triple {13618#true} assume !false; {13618#true} is VALID [2020-07-08 23:29:59,484 INFO L280 TraceCheckUtils]: 24: Hoare triple {13618#true} assume !(0 == ~q~0); {13618#true} is VALID [2020-07-08 23:29:59,485 INFO L280 TraceCheckUtils]: 25: Hoare triple {13618#true} assume !(1 == ~q~0); {13618#true} is VALID [2020-07-08 23:29:59,485 INFO L280 TraceCheckUtils]: 26: Hoare triple {13618#true} assume 2 == ~q~0; {13618#true} is VALID [2020-07-08 23:29:59,485 INFO L280 TraceCheckUtils]: 27: Hoare triple {13618#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {13618#true} is VALID [2020-07-08 23:29:59,485 INFO L280 TraceCheckUtils]: 28: Hoare triple {13618#true} assume !(0 != #t~nondet4); {13618#true} is VALID [2020-07-08 23:29:59,485 INFO L280 TraceCheckUtils]: 29: Hoare triple {13618#true} havoc #t~nondet4; {13618#true} is VALID [2020-07-08 23:29:59,485 INFO L280 TraceCheckUtils]: 30: Hoare triple {13618#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {13618#true} is VALID [2020-07-08 23:29:59,486 INFO L280 TraceCheckUtils]: 31: Hoare triple {13618#true} assume 0 != #t~nondet5; {13618#true} is VALID [2020-07-08 23:29:59,486 INFO L280 TraceCheckUtils]: 32: Hoare triple {13618#true} havoc #t~nondet5; {13618#true} is VALID [2020-07-08 23:29:59,486 INFO L280 TraceCheckUtils]: 33: Hoare triple {13618#true} ~method_id~0 := 2; {13618#true} is VALID [2020-07-08 23:29:59,486 INFO L280 TraceCheckUtils]: 34: Hoare triple {13618#true} assume !false; {13618#true} is VALID [2020-07-08 23:29:59,487 INFO L280 TraceCheckUtils]: 35: Hoare triple {13618#true} ~q~0 := 4; {13618#true} is VALID [2020-07-08 23:29:59,489 INFO L280 TraceCheckUtils]: 36: Hoare triple {13618#true} ~this_state~0 := 3; {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-08 23:29:59,490 INFO L280 TraceCheckUtils]: 37: Hoare triple {13628#(<= 3 main_~this_state~0)} assume !false; {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-08 23:29:59,490 INFO L280 TraceCheckUtils]: 38: Hoare triple {13628#(<= 3 main_~this_state~0)} assume !(0 == ~q~0); {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-08 23:29:59,491 INFO L280 TraceCheckUtils]: 39: Hoare triple {13628#(<= 3 main_~this_state~0)} assume !(1 == ~q~0); {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-08 23:29:59,491 INFO L280 TraceCheckUtils]: 40: Hoare triple {13628#(<= 3 main_~this_state~0)} assume !(2 == ~q~0); {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-08 23:29:59,492 INFO L280 TraceCheckUtils]: 41: Hoare triple {13628#(<= 3 main_~this_state~0)} assume !(3 == ~q~0); {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-08 23:29:59,493 INFO L280 TraceCheckUtils]: 42: Hoare triple {13628#(<= 3 main_~this_state~0)} assume 4 == ~q~0; {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-08 23:29:59,493 INFO L280 TraceCheckUtils]: 43: Hoare triple {13628#(<= 3 main_~this_state~0)} assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647; {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-08 23:29:59,494 INFO L280 TraceCheckUtils]: 44: Hoare triple {13628#(<= 3 main_~this_state~0)} assume !(0 != #t~nondet15); {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-08 23:29:59,494 INFO L280 TraceCheckUtils]: 45: Hoare triple {13628#(<= 3 main_~this_state~0)} havoc #t~nondet15; {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-08 23:29:59,495 INFO L280 TraceCheckUtils]: 46: Hoare triple {13628#(<= 3 main_~this_state~0)} assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-08 23:29:59,495 INFO L280 TraceCheckUtils]: 47: Hoare triple {13628#(<= 3 main_~this_state~0)} assume !(0 != #t~nondet16); {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-08 23:29:59,496 INFO L280 TraceCheckUtils]: 48: Hoare triple {13628#(<= 3 main_~this_state~0)} havoc #t~nondet16; {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-08 23:29:59,497 INFO L280 TraceCheckUtils]: 49: Hoare triple {13628#(<= 3 main_~this_state~0)} assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647; {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-08 23:29:59,497 INFO L280 TraceCheckUtils]: 50: Hoare triple {13628#(<= 3 main_~this_state~0)} assume 0 != #t~nondet17; {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-08 23:29:59,498 INFO L280 TraceCheckUtils]: 51: Hoare triple {13628#(<= 3 main_~this_state~0)} havoc #t~nondet17; {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-08 23:29:59,498 INFO L280 TraceCheckUtils]: 52: Hoare triple {13628#(<= 3 main_~this_state~0)} ~method_id~0 := 4; {13628#(<= 3 main_~this_state~0)} is VALID [2020-07-08 23:29:59,499 INFO L280 TraceCheckUtils]: 53: Hoare triple {13628#(<= 3 main_~this_state~0)} assume 2 == ~this_state~0; {13619#false} is VALID [2020-07-08 23:29:59,499 INFO L280 TraceCheckUtils]: 54: Hoare triple {13619#false} assume !false; {13619#false} is VALID [2020-07-08 23:29:59,502 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 23:29:59,502 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [289153925] [2020-07-08 23:29:59,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:29:59,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 23:29:59,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416274661] [2020-07-08 23:29:59,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2020-07-08 23:29:59,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:29:59,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 23:29:59,553 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:29:59,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 23:29:59,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:29:59,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 23:29:59,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 23:29:59,554 INFO L87 Difference]: Start difference. First operand 156 states and 175 transitions. Second operand 4 states. [2020-07-08 23:30:00,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:30:00,700 INFO L93 Difference]: Finished difference Result 158 states and 176 transitions. [2020-07-08 23:30:00,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 23:30:00,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2020-07-08 23:30:00,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:30:00,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 23:30:00,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2020-07-08 23:30:00,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 23:30:00,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2020-07-08 23:30:00,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 172 transitions. [2020-07-08 23:30:00,934 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:30:00,938 INFO L225 Difference]: With dead ends: 158 [2020-07-08 23:30:00,938 INFO L226 Difference]: Without dead ends: 153 [2020-07-08 23:30:00,938 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 23:30:00,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2020-07-08 23:30:01,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2020-07-08 23:30:01,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:30:01,561 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand 153 states. [2020-07-08 23:30:01,561 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 153 states. [2020-07-08 23:30:01,561 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 153 states. [2020-07-08 23:30:01,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:30:01,564 INFO L93 Difference]: Finished difference Result 153 states and 171 transitions. [2020-07-08 23:30:01,564 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 171 transitions. [2020-07-08 23:30:01,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:30:01,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:30:01,565 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 153 states. [2020-07-08 23:30:01,565 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 153 states. [2020-07-08 23:30:01,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:30:01,567 INFO L93 Difference]: Finished difference Result 153 states and 171 transitions. [2020-07-08 23:30:01,567 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 171 transitions. [2020-07-08 23:30:01,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:30:01,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:30:01,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:30:01,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:30:01,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-07-08 23:30:01,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 171 transitions. [2020-07-08 23:30:01,570 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 171 transitions. Word has length 55 [2020-07-08 23:30:01,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:30:01,571 INFO L479 AbstractCegarLoop]: Abstraction has 153 states and 171 transitions. [2020-07-08 23:30:01,571 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 23:30:01,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 153 states and 171 transitions. [2020-07-08 23:30:01,842 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:30:01,842 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 171 transitions. [2020-07-08 23:30:01,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-08 23:30:01,843 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:30:01,844 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:30:01,844 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-08 23:30:01,844 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:30:01,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:30:01,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1987485698, now seen corresponding path program 1 times [2020-07-08 23:30:01,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:30:01,845 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [744575866] [2020-07-08 23:30:01,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:30:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:30:01,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:30:01,931 INFO L280 TraceCheckUtils]: 0: Hoare triple {14574#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {14563#true} is VALID [2020-07-08 23:30:01,932 INFO L280 TraceCheckUtils]: 1: Hoare triple {14563#true} ~m_initVerify~0 := 2; {14563#true} is VALID [2020-07-08 23:30:01,932 INFO L280 TraceCheckUtils]: 2: Hoare triple {14563#true} ~m_Signature~0 := 3; {14563#true} is VALID [2020-07-08 23:30:01,932 INFO L280 TraceCheckUtils]: 3: Hoare triple {14563#true} ~m_sign~0 := 4; {14563#true} is VALID [2020-07-08 23:30:01,932 INFO L280 TraceCheckUtils]: 4: Hoare triple {14563#true} ~m_verify~0 := 5; {14563#true} is VALID [2020-07-08 23:30:01,932 INFO L280 TraceCheckUtils]: 5: Hoare triple {14563#true} ~m_update~0 := 6; {14563#true} is VALID [2020-07-08 23:30:01,932 INFO L280 TraceCheckUtils]: 6: Hoare triple {14563#true} assume true; {14563#true} is VALID [2020-07-08 23:30:01,933 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {14563#true} {14563#true} #484#return; {14563#true} is VALID [2020-07-08 23:30:01,934 INFO L263 TraceCheckUtils]: 0: Hoare triple {14563#true} call ULTIMATE.init(); {14574#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID [2020-07-08 23:30:01,934 INFO L280 TraceCheckUtils]: 1: Hoare triple {14574#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {14563#true} is VALID [2020-07-08 23:30:01,934 INFO L280 TraceCheckUtils]: 2: Hoare triple {14563#true} ~m_initVerify~0 := 2; {14563#true} is VALID [2020-07-08 23:30:01,935 INFO L280 TraceCheckUtils]: 3: Hoare triple {14563#true} ~m_Signature~0 := 3; {14563#true} is VALID [2020-07-08 23:30:01,935 INFO L280 TraceCheckUtils]: 4: Hoare triple {14563#true} ~m_sign~0 := 4; {14563#true} is VALID [2020-07-08 23:30:01,935 INFO L280 TraceCheckUtils]: 5: Hoare triple {14563#true} ~m_verify~0 := 5; {14563#true} is VALID [2020-07-08 23:30:01,935 INFO L280 TraceCheckUtils]: 6: Hoare triple {14563#true} ~m_update~0 := 6; {14563#true} is VALID [2020-07-08 23:30:01,935 INFO L280 TraceCheckUtils]: 7: Hoare triple {14563#true} assume true; {14563#true} is VALID [2020-07-08 23:30:01,936 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {14563#true} {14563#true} #484#return; {14563#true} is VALID [2020-07-08 23:30:01,936 INFO L263 TraceCheckUtils]: 9: Hoare triple {14563#true} call #t~ret21 := main(); {14563#true} is VALID [2020-07-08 23:30:01,936 INFO L280 TraceCheckUtils]: 10: Hoare triple {14563#true} ~q~0 := 0; {14563#true} is VALID [2020-07-08 23:30:01,936 INFO L280 TraceCheckUtils]: 11: Hoare triple {14563#true} havoc ~method_id~0; {14563#true} is VALID [2020-07-08 23:30:01,937 INFO L280 TraceCheckUtils]: 12: Hoare triple {14563#true} ~this_state~0 := 0; {14563#true} is VALID [2020-07-08 23:30:01,937 INFO L280 TraceCheckUtils]: 13: Hoare triple {14563#true} goto; {14563#true} is VALID [2020-07-08 23:30:01,937 INFO L280 TraceCheckUtils]: 14: Hoare triple {14563#true} assume !false; {14563#true} is VALID [2020-07-08 23:30:01,937 INFO L280 TraceCheckUtils]: 15: Hoare triple {14563#true} assume 0 == ~q~0; {14563#true} is VALID [2020-07-08 23:30:01,937 INFO L280 TraceCheckUtils]: 16: Hoare triple {14563#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {14563#true} is VALID [2020-07-08 23:30:01,938 INFO L280 TraceCheckUtils]: 17: Hoare triple {14563#true} assume 0 != #t~nondet0; {14563#true} is VALID [2020-07-08 23:30:01,938 INFO L280 TraceCheckUtils]: 18: Hoare triple {14563#true} havoc #t~nondet0; {14563#true} is VALID [2020-07-08 23:30:01,938 INFO L280 TraceCheckUtils]: 19: Hoare triple {14563#true} ~method_id~0 := 3; {14563#true} is VALID [2020-07-08 23:30:01,938 INFO L280 TraceCheckUtils]: 20: Hoare triple {14563#true} assume !false; {14563#true} is VALID [2020-07-08 23:30:01,938 INFO L280 TraceCheckUtils]: 21: Hoare triple {14563#true} ~q~0 := 2; {14563#true} is VALID [2020-07-08 23:30:01,939 INFO L280 TraceCheckUtils]: 22: Hoare triple {14563#true} ~this_state~0 := 0; {14563#true} is VALID [2020-07-08 23:30:01,939 INFO L280 TraceCheckUtils]: 23: Hoare triple {14563#true} assume !false; {14563#true} is VALID [2020-07-08 23:30:01,939 INFO L280 TraceCheckUtils]: 24: Hoare triple {14563#true} assume !(0 == ~q~0); {14563#true} is VALID [2020-07-08 23:30:01,939 INFO L280 TraceCheckUtils]: 25: Hoare triple {14563#true} assume !(1 == ~q~0); {14563#true} is VALID [2020-07-08 23:30:01,939 INFO L280 TraceCheckUtils]: 26: Hoare triple {14563#true} assume 2 == ~q~0; {14563#true} is VALID [2020-07-08 23:30:01,940 INFO L280 TraceCheckUtils]: 27: Hoare triple {14563#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {14563#true} is VALID [2020-07-08 23:30:01,940 INFO L280 TraceCheckUtils]: 28: Hoare triple {14563#true} assume !(0 != #t~nondet4); {14563#true} is VALID [2020-07-08 23:30:01,940 INFO L280 TraceCheckUtils]: 29: Hoare triple {14563#true} havoc #t~nondet4; {14563#true} is VALID [2020-07-08 23:30:01,940 INFO L280 TraceCheckUtils]: 30: Hoare triple {14563#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {14563#true} is VALID [2020-07-08 23:30:01,940 INFO L280 TraceCheckUtils]: 31: Hoare triple {14563#true} assume 0 != #t~nondet5; {14563#true} is VALID [2020-07-08 23:30:01,941 INFO L280 TraceCheckUtils]: 32: Hoare triple {14563#true} havoc #t~nondet5; {14563#true} is VALID [2020-07-08 23:30:01,941 INFO L280 TraceCheckUtils]: 33: Hoare triple {14563#true} ~method_id~0 := 2; {14563#true} is VALID [2020-07-08 23:30:01,941 INFO L280 TraceCheckUtils]: 34: Hoare triple {14563#true} assume !false; {14563#true} is VALID [2020-07-08 23:30:01,941 INFO L280 TraceCheckUtils]: 35: Hoare triple {14563#true} ~q~0 := 4; {14563#true} is VALID [2020-07-08 23:30:01,942 INFO L280 TraceCheckUtils]: 36: Hoare triple {14563#true} ~this_state~0 := 3; {14573#(= 3 main_~this_state~0)} is VALID [2020-07-08 23:30:01,942 INFO L280 TraceCheckUtils]: 37: Hoare triple {14573#(= 3 main_~this_state~0)} assume !false; {14573#(= 3 main_~this_state~0)} is VALID [2020-07-08 23:30:01,943 INFO L280 TraceCheckUtils]: 38: Hoare triple {14573#(= 3 main_~this_state~0)} assume !(0 == ~q~0); {14573#(= 3 main_~this_state~0)} is VALID [2020-07-08 23:30:01,943 INFO L280 TraceCheckUtils]: 39: Hoare triple {14573#(= 3 main_~this_state~0)} assume !(1 == ~q~0); {14573#(= 3 main_~this_state~0)} is VALID [2020-07-08 23:30:01,944 INFO L280 TraceCheckUtils]: 40: Hoare triple {14573#(= 3 main_~this_state~0)} assume !(2 == ~q~0); {14573#(= 3 main_~this_state~0)} is VALID [2020-07-08 23:30:01,944 INFO L280 TraceCheckUtils]: 41: Hoare triple {14573#(= 3 main_~this_state~0)} assume !(3 == ~q~0); {14573#(= 3 main_~this_state~0)} is VALID [2020-07-08 23:30:01,945 INFO L280 TraceCheckUtils]: 42: Hoare triple {14573#(= 3 main_~this_state~0)} assume 4 == ~q~0; {14573#(= 3 main_~this_state~0)} is VALID [2020-07-08 23:30:01,945 INFO L280 TraceCheckUtils]: 43: Hoare triple {14573#(= 3 main_~this_state~0)} assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647; {14573#(= 3 main_~this_state~0)} is VALID [2020-07-08 23:30:01,946 INFO L280 TraceCheckUtils]: 44: Hoare triple {14573#(= 3 main_~this_state~0)} assume !(0 != #t~nondet15); {14573#(= 3 main_~this_state~0)} is VALID [2020-07-08 23:30:01,946 INFO L280 TraceCheckUtils]: 45: Hoare triple {14573#(= 3 main_~this_state~0)} havoc #t~nondet15; {14573#(= 3 main_~this_state~0)} is VALID [2020-07-08 23:30:01,947 INFO L280 TraceCheckUtils]: 46: Hoare triple {14573#(= 3 main_~this_state~0)} assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; {14573#(= 3 main_~this_state~0)} is VALID [2020-07-08 23:30:01,947 INFO L280 TraceCheckUtils]: 47: Hoare triple {14573#(= 3 main_~this_state~0)} assume !(0 != #t~nondet16); {14573#(= 3 main_~this_state~0)} is VALID [2020-07-08 23:30:01,948 INFO L280 TraceCheckUtils]: 48: Hoare triple {14573#(= 3 main_~this_state~0)} havoc #t~nondet16; {14573#(= 3 main_~this_state~0)} is VALID [2020-07-08 23:30:01,948 INFO L280 TraceCheckUtils]: 49: Hoare triple {14573#(= 3 main_~this_state~0)} assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647; {14573#(= 3 main_~this_state~0)} is VALID [2020-07-08 23:30:01,949 INFO L280 TraceCheckUtils]: 50: Hoare triple {14573#(= 3 main_~this_state~0)} assume !(0 != #t~nondet17); {14573#(= 3 main_~this_state~0)} is VALID [2020-07-08 23:30:01,949 INFO L280 TraceCheckUtils]: 51: Hoare triple {14573#(= 3 main_~this_state~0)} havoc #t~nondet17; {14573#(= 3 main_~this_state~0)} is VALID [2020-07-08 23:30:01,950 INFO L280 TraceCheckUtils]: 52: Hoare triple {14573#(= 3 main_~this_state~0)} assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647; {14573#(= 3 main_~this_state~0)} is VALID [2020-07-08 23:30:01,950 INFO L280 TraceCheckUtils]: 53: Hoare triple {14573#(= 3 main_~this_state~0)} assume 0 != #t~nondet18; {14573#(= 3 main_~this_state~0)} is VALID [2020-07-08 23:30:01,951 INFO L280 TraceCheckUtils]: 54: Hoare triple {14573#(= 3 main_~this_state~0)} havoc #t~nondet18; {14573#(= 3 main_~this_state~0)} is VALID [2020-07-08 23:30:01,951 INFO L280 TraceCheckUtils]: 55: Hoare triple {14573#(= 3 main_~this_state~0)} ~method_id~0 := 5; {14573#(= 3 main_~this_state~0)} is VALID [2020-07-08 23:30:01,952 INFO L280 TraceCheckUtils]: 56: Hoare triple {14573#(= 3 main_~this_state~0)} assume 3 != ~this_state~0; {14564#false} is VALID [2020-07-08 23:30:01,952 INFO L280 TraceCheckUtils]: 57: Hoare triple {14564#false} assume !false; {14564#false} is VALID [2020-07-08 23:30:01,954 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 23:30:01,954 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [744575866] [2020-07-08 23:30:01,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:30:01,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 23:30:01,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698598617] [2020-07-08 23:30:01,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2020-07-08 23:30:01,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:30:01,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 23:30:02,021 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:30:02,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 23:30:02,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:30:02,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 23:30:02,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 23:30:02,022 INFO L87 Difference]: Start difference. First operand 153 states and 171 transitions. Second operand 4 states. [2020-07-08 23:30:03,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:30:03,167 INFO L93 Difference]: Finished difference Result 243 states and 275 transitions. [2020-07-08 23:30:03,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 23:30:03,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2020-07-08 23:30:03,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:30:03,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 23:30:03,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 267 transitions. [2020-07-08 23:30:03,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 23:30:03,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 267 transitions. [2020-07-08 23:30:03,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 267 transitions. [2020-07-08 23:30:03,505 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 267 edges. 267 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:30:03,505 INFO L225 Difference]: With dead ends: 243 [2020-07-08 23:30:03,505 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 23:30:03,507 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 23:30:03,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 23:30:03,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 23:30:03,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:30:03,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 23:30:03,508 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 23:30:03,508 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 23:30:03,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:30:03,508 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 23:30:03,508 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 23:30:03,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:30:03,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:30:03,509 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 23:30:03,509 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 23:30:03,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:30:03,509 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 23:30:03,509 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 23:30:03,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:30:03,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:30:03,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:30:03,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:30:03,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 23:30:03,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 23:30:03,514 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2020-07-08 23:30:03,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:30:03,514 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 23:30:03,514 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 23:30:03,514 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-08 23:30:03,514 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:30:03,515 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 23:30:03,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:30:03,515 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-08 23:30:03,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 23:30:06,935 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 23:30:06,935 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-07-08 23:30:06,935 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 23:30:06,935 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-07-08 23:30:06,936 INFO L271 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: true [2020-07-08 23:30:06,936 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-07-08 23:30:06,936 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-08 23:30:06,936 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-08 23:30:06,936 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-08 23:30:06,937 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 23:30:06,937 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 23:30:06,937 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-08 23:30:06,938 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 390) the Hoare annotation is: true [2020-07-08 23:30:06,938 INFO L264 CegarLoopResult]: At program point L366(lines 366 377) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-08 23:30:06,938 INFO L264 CegarLoopResult]: At program point L300(line 300) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-08 23:30:06,938 INFO L264 CegarLoopResult]: At program point L300-1(lines 300 315) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-08 23:30:06,938 INFO L264 CegarLoopResult]: At program point L234(lines 234 245) the Hoare annotation is: (or (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) (and (<= 3 main_~q~0) (= 2 main_~this_state~0))) [2020-07-08 23:30:06,938 INFO L264 CegarLoopResult]: At program point L300-2(line 300) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-08 23:30:06,939 INFO L264 CegarLoopResult]: At program point L300-3(line 300) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-08 23:30:06,939 INFO L264 CegarLoopResult]: At program point L102(lines 102 113) the Hoare annotation is: (= 2 main_~q~0) [2020-07-08 23:30:06,939 INFO L264 CegarLoopResult]: At program point L334(lines 334 345) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-08 23:30:06,939 INFO L264 CegarLoopResult]: At program point L268(line 268) the Hoare annotation is: false [2020-07-08 23:30:06,942 INFO L264 CegarLoopResult]: At program point L202(lines 202 213) the Hoare annotation is: (= 3 main_~q~0) [2020-07-08 23:30:06,942 INFO L264 CegarLoopResult]: At program point L70(lines 70 72) the Hoare annotation is: false [2020-07-08 23:30:06,942 INFO L264 CegarLoopResult]: At program point L368(line 368) the Hoare annotation is: false [2020-07-08 23:30:06,942 INFO L264 CegarLoopResult]: At program point L302(lines 302 313) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-08 23:30:06,942 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 390) the Hoare annotation is: true [2020-07-08 23:30:06,943 INFO L264 CegarLoopResult]: At program point L170(lines 170 172) the Hoare annotation is: (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) [2020-07-08 23:30:06,943 INFO L264 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: (and (= 0 main_~q~0) (<= main_~this_state~0 0)) [2020-07-08 23:30:06,943 INFO L264 CegarLoopResult]: At program point L270(lines 270 272) the Hoare annotation is: false [2020-07-08 23:30:06,945 INFO L264 CegarLoopResult]: At program point L138(lines 138 140) the Hoare annotation is: (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) [2020-07-08 23:30:06,945 INFO L264 CegarLoopResult]: At program point L370(lines 370 372) the Hoare annotation is: false [2020-07-08 23:30:06,945 INFO L264 CegarLoopResult]: At program point L238(lines 238 240) the Hoare annotation is: (or (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) (and (<= 3 main_~q~0) (= 2 main_~this_state~0))) [2020-07-08 23:30:06,945 INFO L264 CegarLoopResult]: At program point L106(lines 106 108) the Hoare annotation is: (= 2 main_~q~0) [2020-07-08 23:30:06,945 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-08 23:30:06,946 INFO L264 CegarLoopResult]: At program point L371(lines 13 390) the Hoare annotation is: false [2020-07-08 23:30:06,946 INFO L264 CegarLoopResult]: At program point L338(lines 338 340) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-08 23:30:06,946 INFO L264 CegarLoopResult]: At program point L206(lines 206 208) the Hoare annotation is: (= 3 main_~q~0) [2020-07-08 23:30:06,946 INFO L271 CegarLoopResult]: At program point L74(line 74) the Hoare annotation is: true [2020-07-08 23:30:06,946 INFO L264 CegarLoopResult]: At program point L306(lines 306 308) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-08 23:30:06,946 INFO L271 CegarLoopResult]: At program point L174(line 174) the Hoare annotation is: true [2020-07-08 23:30:06,946 INFO L264 CegarLoopResult]: At program point L274(line 274) the Hoare annotation is: false [2020-07-08 23:30:06,947 INFO L271 CegarLoopResult]: At program point L142(line 142) the Hoare annotation is: true [2020-07-08 23:30:06,947 INFO L264 CegarLoopResult]: At program point L374(line 374) the Hoare annotation is: false [2020-07-08 23:30:06,947 INFO L271 CegarLoopResult]: At program point L242(line 242) the Hoare annotation is: true [2020-07-08 23:30:06,947 INFO L264 CegarLoopResult]: At program point L110(line 110) the Hoare annotation is: (= 2 main_~q~0) [2020-07-08 23:30:06,947 INFO L264 CegarLoopResult]: At program point L342(line 342) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-08 23:30:06,947 INFO L264 CegarLoopResult]: At program point L276(line 276) the Hoare annotation is: false [2020-07-08 23:30:06,947 INFO L264 CegarLoopResult]: At program point L210(line 210) the Hoare annotation is: (= 3 main_~q~0) [2020-07-08 23:30:06,948 INFO L264 CegarLoopResult]: At program point L376(line 376) the Hoare annotation is: false [2020-07-08 23:30:06,948 INFO L264 CegarLoopResult]: At program point L310(line 310) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-08 23:30:06,948 INFO L264 CegarLoopResult]: At program point L112(line 112) the Hoare annotation is: (= 3 main_~q~0) [2020-07-08 23:30:06,948 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 389) the Hoare annotation is: false [2020-07-08 23:30:06,949 INFO L264 CegarLoopResult]: At program point L344(line 344) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-08 23:30:06,949 INFO L264 CegarLoopResult]: At program point L212(line 212) the Hoare annotation is: (<= 4 main_~q~0) [2020-07-08 23:30:06,949 INFO L264 CegarLoopResult]: At program point L80(line 80) the Hoare annotation is: false [2020-07-08 23:30:06,949 INFO L264 CegarLoopResult]: At program point L47(lines 47 98) the Hoare annotation is: (or (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) (and (= 3 main_~q~0) (= 2 main_~this_state~0)) (and (<= main_~this_state~0 0) (= 2 main_~q~0))) [2020-07-08 23:30:06,949 INFO L264 CegarLoopResult]: At program point L80-1(lines 80 95) the Hoare annotation is: false [2020-07-08 23:30:06,949 INFO L264 CegarLoopResult]: At program point L80-2(line 80) the Hoare annotation is: false [2020-07-08 23:30:06,949 INFO L264 CegarLoopResult]: At program point L80-3(line 80) the Hoare annotation is: false [2020-07-08 23:30:06,949 INFO L264 CegarLoopResult]: At program point L312(line 312) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-08 23:30:06,950 INFO L264 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: false [2020-07-08 23:30:06,950 INFO L264 CegarLoopResult]: At program point L48-1(lines 48 63) the Hoare annotation is: false [2020-07-08 23:30:06,950 INFO L264 CegarLoopResult]: At program point L48-2(line 48) the Hoare annotation is: false [2020-07-08 23:30:06,951 INFO L264 CegarLoopResult]: At program point L48-3(line 48) the Hoare annotation is: false [2020-07-08 23:30:06,951 INFO L264 CegarLoopResult]: At program point L148(line 148) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-08 23:30:06,951 INFO L264 CegarLoopResult]: At program point L148-1(lines 148 163) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-08 23:30:06,951 INFO L264 CegarLoopResult]: At program point L82(lines 82 93) the Hoare annotation is: false [2020-07-08 23:30:06,951 INFO L264 CegarLoopResult]: At program point L148-2(line 148) the Hoare annotation is: (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) [2020-07-08 23:30:06,952 INFO L264 CegarLoopResult]: At program point L148-3(line 148) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-08 23:30:06,952 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (= 0 main_~q~0) [2020-07-08 23:30:06,952 INFO L264 CegarLoopResult]: At program point L248(line 248) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-08 23:30:06,952 INFO L264 CegarLoopResult]: At program point L248-1(lines 248 263) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-08 23:30:06,952 INFO L264 CegarLoopResult]: At program point L248-2(line 248) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-08 23:30:06,952 INFO L264 CegarLoopResult]: At program point L248-3(line 248) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-08 23:30:06,952 INFO L264 CegarLoopResult]: At program point L116(line 116) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-08 23:30:06,952 INFO L264 CegarLoopResult]: At program point L116-1(lines 116 131) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-08 23:30:06,953 INFO L264 CegarLoopResult]: At program point L50(lines 50 61) the Hoare annotation is: false [2020-07-08 23:30:06,953 INFO L264 CegarLoopResult]: At program point L116-2(line 116) the Hoare annotation is: (= 2 main_~q~0) [2020-07-08 23:30:06,953 INFO L264 CegarLoopResult]: At program point L116-3(line 116) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-08 23:30:06,953 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 23:30:06,953 INFO L264 CegarLoopResult]: At program point L348(line 348) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-08 23:30:06,953 INFO L264 CegarLoopResult]: At program point L348-1(lines 348 363) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-08 23:30:06,953 INFO L264 CegarLoopResult]: At program point L348-2(line 348) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-08 23:30:06,954 INFO L264 CegarLoopResult]: At program point L348-3(line 348) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-08 23:30:06,954 INFO L264 CegarLoopResult]: At program point L216(line 216) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-08 23:30:06,954 INFO L264 CegarLoopResult]: At program point L183(lines 183 282) the Hoare annotation is: (or (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) (and (= 3 main_~q~0) (= 2 main_~this_state~0))) [2020-07-08 23:30:06,955 INFO L264 CegarLoopResult]: At program point L216-1(lines 216 231) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-08 23:30:06,955 INFO L264 CegarLoopResult]: At program point L150(lines 150 161) the Hoare annotation is: (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) [2020-07-08 23:30:06,955 INFO L264 CegarLoopResult]: At program point L216-2(line 216) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-08 23:30:06,955 INFO L264 CegarLoopResult]: At program point L216-3(line 216) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-08 23:30:06,955 INFO L264 CegarLoopResult]: At program point L316(line 316) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-08 23:30:06,955 INFO L264 CegarLoopResult]: At program point L283(lines 283 382) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-08 23:30:06,955 INFO L264 CegarLoopResult]: At program point L316-1(lines 316 331) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-08 23:30:06,956 INFO L264 CegarLoopResult]: At program point L250(lines 250 261) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-08 23:30:06,956 INFO L264 CegarLoopResult]: At program point L316-2(line 316) the Hoare annotation is: (or (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) (and (<= 4 main_~q~0) (<= 3 main_~this_state~0))) [2020-07-08 23:30:06,956 INFO L264 CegarLoopResult]: At program point L316-3(line 316) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-08 23:30:06,956 INFO L264 CegarLoopResult]: At program point L184(line 184) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-08 23:30:06,956 INFO L264 CegarLoopResult]: At program point L184-1(lines 184 199) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-08 23:30:06,956 INFO L264 CegarLoopResult]: At program point L118(lines 118 129) the Hoare annotation is: (= 2 main_~q~0) [2020-07-08 23:30:06,956 INFO L264 CegarLoopResult]: At program point L184-2(line 184) the Hoare annotation is: (= 3 main_~q~0) [2020-07-08 23:30:06,956 INFO L264 CegarLoopResult]: At program point L184-3(line 184) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-08 23:30:06,957 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (= 0 main_~q~0) [2020-07-08 23:30:06,957 INFO L264 CegarLoopResult]: At program point L350(lines 350 361) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-08 23:30:06,957 INFO L264 CegarLoopResult]: At program point L284(line 284) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-08 23:30:06,957 INFO L264 CegarLoopResult]: At program point L284-1(lines 284 299) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-08 23:30:06,957 INFO L264 CegarLoopResult]: At program point L218(lines 218 229) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-08 23:30:06,957 INFO L264 CegarLoopResult]: At program point L284-2(line 284) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-08 23:30:06,957 INFO L264 CegarLoopResult]: At program point L284-3(line 284) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-08 23:30:06,957 INFO L264 CegarLoopResult]: At program point L86(lines 86 88) the Hoare annotation is: false [2020-07-08 23:30:06,958 INFO L264 CegarLoopResult]: At program point L318(lines 318 329) the Hoare annotation is: (or (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) (and (<= 4 main_~q~0) (<= 3 main_~this_state~0))) [2020-07-08 23:30:06,958 INFO L264 CegarLoopResult]: At program point L252(line 252) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-08 23:30:06,958 INFO L264 CegarLoopResult]: At program point L186(lines 186 197) the Hoare annotation is: (= 3 main_~q~0) [2020-07-08 23:30:06,958 INFO L264 CegarLoopResult]: At program point L54(lines 54 56) the Hoare annotation is: false [2020-07-08 23:30:06,958 INFO L264 CegarLoopResult]: At program point L352(line 352) the Hoare annotation is: false [2020-07-08 23:30:06,958 INFO L264 CegarLoopResult]: At program point L286(lines 286 297) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-08 23:30:06,958 INFO L264 CegarLoopResult]: At program point L154(lines 154 156) the Hoare annotation is: (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) [2020-07-08 23:30:06,958 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 23:30:06,959 INFO L271 CegarLoopResult]: At program point L22-3(lines 22 385) the Hoare annotation is: true [2020-07-08 23:30:06,959 INFO L264 CegarLoopResult]: At program point L254(lines 254 256) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-08 23:30:06,959 INFO L264 CegarLoopResult]: At program point L122(lines 122 124) the Hoare annotation is: (= 2 main_~q~0) [2020-07-08 23:30:06,959 INFO L264 CegarLoopResult]: At program point L354(lines 354 356) the Hoare annotation is: false [2020-07-08 23:30:06,959 INFO L264 CegarLoopResult]: At program point L222(lines 222 224) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-08 23:30:06,959 INFO L271 CegarLoopResult]: At program point L90(line 90) the Hoare annotation is: true [2020-07-08 23:30:06,959 INFO L264 CegarLoopResult]: At program point L322(lines 322 324) the Hoare annotation is: (or (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) (and (<= 4 main_~q~0) (<= 3 main_~this_state~0))) [2020-07-08 23:30:06,959 INFO L264 CegarLoopResult]: At program point L190(lines 190 192) the Hoare annotation is: (= 3 main_~q~0) [2020-07-08 23:30:06,960 INFO L271 CegarLoopResult]: At program point L58(line 58) the Hoare annotation is: true [2020-07-08 23:30:06,960 INFO L264 CegarLoopResult]: At program point L290(lines 290 292) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-08 23:30:06,961 INFO L271 CegarLoopResult]: At program point L158(line 158) the Hoare annotation is: true [2020-07-08 23:30:06,961 INFO L264 CegarLoopResult]: At program point L258(line 258) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-08 23:30:06,961 INFO L264 CegarLoopResult]: At program point L126(line 126) the Hoare annotation is: (= 2 main_~q~0) [2020-07-08 23:30:06,961 INFO L264 CegarLoopResult]: At program point L27(lines 27 46) the Hoare annotation is: (let ((.cse0 (<= main_~this_state~0 0))) (or (and (= 0 main_~q~0) .cse0) (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) (and (= 3 main_~q~0) (= 2 main_~this_state~0)) (and .cse0 (= 2 main_~q~0)))) [2020-07-08 23:30:06,961 INFO L264 CegarLoopResult]: At program point L358(line 358) the Hoare annotation is: false [2020-07-08 23:30:06,962 INFO L264 CegarLoopResult]: At program point L226(line 226) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-08 23:30:06,962 INFO L264 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: (and (= 0 main_~q~0) (<= main_~this_state~0 0)) [2020-07-08 23:30:06,962 INFO L264 CegarLoopResult]: At program point L28-1(lines 28 43) the Hoare annotation is: (and (= 0 main_~q~0) (<= main_~this_state~0 0)) [2020-07-08 23:30:06,962 INFO L264 CegarLoopResult]: At program point L28-2(line 28) the Hoare annotation is: (and (= 0 main_~q~0) (<= main_~this_state~0 0)) [2020-07-08 23:30:06,962 INFO L264 CegarLoopResult]: At program point L28-3(line 28) the Hoare annotation is: (and (= 0 main_~q~0) (<= main_~this_state~0 0)) [2020-07-08 23:30:06,962 INFO L271 CegarLoopResult]: At program point L326(line 326) the Hoare annotation is: true [2020-07-08 23:30:06,962 INFO L264 CegarLoopResult]: At program point L260(line 260) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-08 23:30:06,962 INFO L264 CegarLoopResult]: At program point L194(line 194) the Hoare annotation is: (= 3 main_~q~0) [2020-07-08 23:30:06,963 INFO L264 CegarLoopResult]: At program point L128(line 128) the Hoare annotation is: (<= 4 main_~q~0) [2020-07-08 23:30:06,963 INFO L264 CegarLoopResult]: At program point L360(line 360) the Hoare annotation is: false [2020-07-08 23:30:06,963 INFO L264 CegarLoopResult]: At program point L294(line 294) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-08 23:30:06,963 INFO L264 CegarLoopResult]: At program point L228(line 228) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-08 23:30:06,963 INFO L264 CegarLoopResult]: At program point L30(lines 30 41) the Hoare annotation is: (and (= 0 main_~q~0) (<= main_~this_state~0 0)) [2020-07-08 23:30:06,963 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 390) the Hoare annotation is: true [2020-07-08 23:30:06,963 INFO L264 CegarLoopResult]: At program point L196(line 196) the Hoare annotation is: (= 3 main_~q~0) [2020-07-08 23:30:06,963 INFO L264 CegarLoopResult]: At program point L64(line 64) the Hoare annotation is: false [2020-07-08 23:30:06,964 INFO L264 CegarLoopResult]: At program point L64-1(lines 64 79) the Hoare annotation is: false [2020-07-08 23:30:06,964 INFO L264 CegarLoopResult]: At program point L64-2(line 64) the Hoare annotation is: false [2020-07-08 23:30:06,964 INFO L264 CegarLoopResult]: At program point L64-3(line 64) the Hoare annotation is: false [2020-07-08 23:30:06,964 INFO L264 CegarLoopResult]: At program point L296(line 296) the Hoare annotation is: (and (= 3 main_~q~0) (= 3 main_~this_state~0)) [2020-07-08 23:30:06,964 INFO L264 CegarLoopResult]: At program point L164(line 164) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-08 23:30:06,964 INFO L264 CegarLoopResult]: At program point L164-1(lines 164 179) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-08 23:30:06,964 INFO L264 CegarLoopResult]: At program point L164-2(line 164) the Hoare annotation is: (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) [2020-07-08 23:30:06,964 INFO L264 CegarLoopResult]: At program point L164-3(line 164) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-08 23:30:06,965 INFO L264 CegarLoopResult]: At program point L264(line 264) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-08 23:30:06,965 INFO L264 CegarLoopResult]: At program point L264-1(lines 264 279) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-08 23:30:06,965 INFO L264 CegarLoopResult]: At program point L264-2(line 264) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-08 23:30:06,965 INFO L264 CegarLoopResult]: At program point L264-3(line 264) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-08 23:30:06,965 INFO L264 CegarLoopResult]: At program point L132(line 132) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-08 23:30:06,965 INFO L264 CegarLoopResult]: At program point L99(lines 99 182) the Hoare annotation is: (or (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) (and (= 3 main_~q~0) (= 2 main_~this_state~0)) (and (<= main_~this_state~0 0) (= 2 main_~q~0))) [2020-07-08 23:30:06,965 INFO L264 CegarLoopResult]: At program point L132-1(lines 132 147) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-08 23:30:06,965 INFO L264 CegarLoopResult]: At program point L66(lines 66 77) the Hoare annotation is: false [2020-07-08 23:30:06,966 INFO L264 CegarLoopResult]: At program point L132-2(line 132) the Hoare annotation is: (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) [2020-07-08 23:30:06,966 INFO L264 CegarLoopResult]: At program point L132-3(line 132) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-08 23:30:06,966 INFO L264 CegarLoopResult]: At program point L364(line 364) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-08 23:30:06,966 INFO L264 CegarLoopResult]: At program point L364-1(lines 364 379) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-08 23:30:06,966 INFO L264 CegarLoopResult]: At program point L364-2(line 364) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-08 23:30:06,966 INFO L264 CegarLoopResult]: At program point L364-3(line 364) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-08 23:30:06,966 INFO L264 CegarLoopResult]: At program point L232(line 232) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-08 23:30:06,966 INFO L264 CegarLoopResult]: At program point L232-1(lines 232 247) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-08 23:30:06,967 INFO L264 CegarLoopResult]: At program point L166(lines 166 177) the Hoare annotation is: (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) [2020-07-08 23:30:06,967 INFO L264 CegarLoopResult]: At program point L232-2(line 232) the Hoare annotation is: (or (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) (and (<= 3 main_~q~0) (= 2 main_~this_state~0))) [2020-07-08 23:30:06,967 INFO L264 CegarLoopResult]: At program point L232-3(line 232) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-08 23:30:06,967 INFO L264 CegarLoopResult]: At program point L100(line 100) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-08 23:30:06,967 INFO L264 CegarLoopResult]: At program point L100-1(lines 100 115) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-08 23:30:06,967 INFO L264 CegarLoopResult]: At program point L34(lines 34 36) the Hoare annotation is: (and (= 0 main_~q~0) (<= main_~this_state~0 0)) [2020-07-08 23:30:06,967 INFO L264 CegarLoopResult]: At program point L100-2(line 100) the Hoare annotation is: (= 2 main_~q~0) [2020-07-08 23:30:06,968 INFO L264 CegarLoopResult]: At program point L100-3(line 100) the Hoare annotation is: (and (<= main_~this_state~0 0) (= 2 main_~q~0)) [2020-07-08 23:30:06,968 INFO L264 CegarLoopResult]: At program point L332(line 332) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-08 23:30:06,968 INFO L264 CegarLoopResult]: At program point L332-1(lines 332 347) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-08 23:30:06,968 INFO L264 CegarLoopResult]: At program point L266(lines 266 277) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-08 23:30:06,968 INFO L264 CegarLoopResult]: At program point L332-2(line 332) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-08 23:30:06,968 INFO L264 CegarLoopResult]: At program point L332-3(line 332) the Hoare annotation is: (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) [2020-07-08 23:30:06,968 INFO L264 CegarLoopResult]: At program point L200(line 200) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-08 23:30:06,968 INFO L264 CegarLoopResult]: At program point L200-1(lines 200 215) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-08 23:30:06,969 INFO L264 CegarLoopResult]: At program point L134(lines 134 145) the Hoare annotation is: (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) [2020-07-08 23:30:06,969 INFO L264 CegarLoopResult]: At program point L200-2(line 200) the Hoare annotation is: (= 3 main_~q~0) [2020-07-08 23:30:06,969 INFO L264 CegarLoopResult]: At program point L200-3(line 200) the Hoare annotation is: (and (= 3 main_~q~0) (= 2 main_~this_state~0)) [2020-07-08 23:30:07,058 INFO L163 areAnnotationChecker]: CFG has 260 edges. 260 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 23:30:07,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 11:30:07 BoogieIcfgContainer [2020-07-08 23:30:07,084 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 23:30:07,088 INFO L168 Benchmark]: Toolchain (without parser) took 37774.25 ms. Allocated memory was 138.9 MB in the beginning and 470.8 MB in the end (delta: 331.9 MB). Free memory was 102.2 MB in the beginning and 147.7 MB in the end (delta: -45.5 MB). Peak memory consumption was 286.4 MB. Max. memory is 7.1 GB. [2020-07-08 23:30:07,089 INFO L168 Benchmark]: CDTParser took 0.94 ms. Allocated memory is still 138.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-07-08 23:30:07,091 INFO L168 Benchmark]: CACSL2BoogieTranslator took 548.12 ms. Allocated memory was 138.9 MB in the beginning and 205.0 MB in the end (delta: 66.1 MB). Free memory was 102.0 MB in the beginning and 183.1 MB in the end (delta: -81.1 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2020-07-08 23:30:07,092 INFO L168 Benchmark]: Boogie Preprocessor took 90.35 ms. Allocated memory is still 205.0 MB. Free memory was 183.1 MB in the beginning and 181.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-07-08 23:30:07,097 INFO L168 Benchmark]: RCFGBuilder took 872.23 ms. Allocated memory is still 205.0 MB. Free memory was 181.1 MB in the beginning and 116.1 MB in the end (delta: 65.0 MB). Peak memory consumption was 65.0 MB. Max. memory is 7.1 GB. [2020-07-08 23:30:07,098 INFO L168 Benchmark]: TraceAbstraction took 36254.52 ms. Allocated memory was 205.0 MB in the beginning and 470.8 MB in the end (delta: 265.8 MB). Free memory was 116.1 MB in the beginning and 147.7 MB in the end (delta: -31.6 MB). Peak memory consumption was 234.2 MB. Max. memory is 7.1 GB. [2020-07-08 23:30:07,103 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.94 ms. Allocated memory is still 138.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 548.12 ms. Allocated memory was 138.9 MB in the beginning and 205.0 MB in the end (delta: 66.1 MB). Free memory was 102.0 MB in the beginning and 183.1 MB in the end (delta: -81.1 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 90.35 ms. Allocated memory is still 205.0 MB. Free memory was 183.1 MB in the beginning and 181.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 872.23 ms. Allocated memory is still 205.0 MB. Free memory was 181.1 MB in the beginning and 116.1 MB in the end (delta: 65.0 MB). Peak memory consumption was 65.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 36254.52 ms. Allocated memory was 205.0 MB in the beginning and 470.8 MB in the end (delta: 265.8 MB). Free memory was 116.1 MB in the beginning and 147.7 MB in the end (delta: -31.6 MB). Peak memory consumption was 234.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 389]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((0 == q && this_state <= 0) || (3 == q && 2 == this_state)) || (4 <= q && 3 == this_state)) || (this_state <= 0 && 2 == q) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (0 == q && this_state <= 0) || (4 <= q && 3 == this_state) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 191 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 32.6s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 20.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1996 SDtfs, 2887 SDslu, 123 SDs, 0 SdLazy, 1238 SolverSat, 97 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=243occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 61 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 191 LocationsWithAnnotation, 191 PreInvPairs, 355 NumberOfFragments, 1069 HoareAnnotationTreeSize, 191 FomulaSimplifications, 3354 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 191 FomulaSimplificationsInter, 3787 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 476 NumberOfCodeBlocks, 476 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 465 ConstructedInterpolants, 0 QuantifiedInterpolants, 39149 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 56/56 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...