./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 49452e318e3c9c4b1e038ab7778998d33b04e5b2 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:27:05,935 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:27:05,937 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:27:05,952 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:27:05,953 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:27:05,955 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:27:05,957 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:27:05,960 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:27:05,965 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:27:05,967 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:27:05,969 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:27:05,975 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:27:05,976 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:27:05,977 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:27:05,980 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:27:05,982 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:27:05,983 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:27:05,987 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:27:05,991 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:27:05,993 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:27:05,997 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:27:06,001 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:27:06,004 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:27:06,005 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:27:06,009 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:27:06,010 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:27:06,010 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:27:06,012 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:27:06,013 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:27:06,015 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:27:06,015 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:27:06,016 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:27:06,017 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:27:06,018 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:27:06,020 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:27:06,020 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:27:06,022 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:27:06,023 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:27:06,023 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:27:06,025 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:27:06,027 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:27:06,028 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-11-28 20:27:06,054 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:27:06,054 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:27:06,058 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:27:06,059 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:27:06,059 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:27:06,059 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:27:06,059 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:27:06,063 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:27:06,063 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:27:06,063 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:27:06,063 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:27:06,064 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 20:27:06,064 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:27:06,064 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 20:27:06,064 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-28 20:27:06,064 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:27:06,065 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:27:06,065 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:27:06,065 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 20:27:06,065 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:27:06,065 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:27:06,066 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:27:06,066 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:27:06,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:27:06,066 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:27:06,066 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:27:06,067 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 20:27:06,068 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:27:06,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:27:06,068 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 20:27:06,069 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:27:06,069 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 49452e318e3c9c4b1e038ab7778998d33b04e5b2 [2019-11-28 20:27:06,372 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:27:06,389 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:27:06,393 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:27:06,395 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:27:06,397 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:27:06,397 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2019-11-28 20:27:06,475 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ee6a4486/c9299304eb734762b0e445de91684786/FLAG43f78f213 [2019-11-28 20:27:07,019 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:27:07,020 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2019-11-28 20:27:07,040 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ee6a4486/c9299304eb734762b0e445de91684786/FLAG43f78f213 [2019-11-28 20:27:07,290 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ee6a4486/c9299304eb734762b0e445de91684786 [2019-11-28 20:27:07,293 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:27:07,295 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:27:07,296 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:27:07,296 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:27:07,299 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:27:07,300 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:27:07" (1/1) ... [2019-11-28 20:27:07,303 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1476b3be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:07, skipping insertion in model container [2019-11-28 20:27:07,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:27:07" (1/1) ... [2019-11-28 20:27:07,312 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:27:07,378 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:27:07,662 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:27:07,667 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:27:07,812 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:27:07,828 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:27:07,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:07 WrapperNode [2019-11-28 20:27:07,829 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:27:07,830 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:27:07,830 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:27:07,830 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:27:07,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:07" (1/1) ... [2019-11-28 20:27:07,851 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:07" (1/1) ... [2019-11-28 20:27:07,908 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:27:07,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:27:07,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:27:07,909 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:27:07,919 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:07" (1/1) ... [2019-11-28 20:27:07,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:07" (1/1) ... [2019-11-28 20:27:07,936 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:07" (1/1) ... [2019-11-28 20:27:07,936 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:07" (1/1) ... [2019-11-28 20:27:07,956 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:07" (1/1) ... [2019-11-28 20:27:07,976 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:07" (1/1) ... [2019-11-28 20:27:07,979 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:07" (1/1) ... [2019-11-28 20:27:07,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:27:07,993 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:27:07,995 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:27:07,995 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:27:07,997 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:07" (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 [2019-11-28 20:27:08,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:27:08,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:27:08,331 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 20:27:09,047 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-28 20:27:09,048 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-28 20:27:09,049 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:27:09,049 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 20:27:09,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:27:09 BoogieIcfgContainer [2019-11-28 20:27:09,051 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:27:09,053 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:27:09,053 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:27:09,056 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:27:09,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:27:07" (1/3) ... [2019-11-28 20:27:09,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@579319e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:27:09, skipping insertion in model container [2019-11-28 20:27:09,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:07" (2/3) ... [2019-11-28 20:27:09,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@579319e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:27:09, skipping insertion in model container [2019-11-28 20:27:09,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:27:09" (3/3) ... [2019-11-28 20:27:09,060 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.BV.c.cil.c [2019-11-28 20:27:09,071 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:27:09,079 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-28 20:27:09,092 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-28 20:27:09,123 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:27:09,124 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 20:27:09,124 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:27:09,124 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:27:09,124 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:27:09,125 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:27:09,125 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:27:09,125 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:27:09,144 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2019-11-28 20:27:09,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 20:27:09,150 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:09,151 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:09,151 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:09,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:09,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1272360941, now seen corresponding path program 1 times [2019-11-28 20:27:09,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:09,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704172005] [2019-11-28 20:27:09,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:09,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:09,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:27:09,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704172005] [2019-11-28 20:27:09,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:09,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:09,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94536919] [2019-11-28 20:27:09,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:09,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:09,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:09,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:09,360 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 3 states. [2019-11-28 20:27:09,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:09,629 INFO L93 Difference]: Finished difference Result 311 states and 519 transitions. [2019-11-28 20:27:09,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:09,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 20:27:09,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:09,650 INFO L225 Difference]: With dead ends: 311 [2019-11-28 20:27:09,650 INFO L226 Difference]: Without dead ends: 149 [2019-11-28 20:27:09,657 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:09,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-28 20:27:09,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-11-28 20:27:09,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-28 20:27:09,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 224 transitions. [2019-11-28 20:27:09,746 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 224 transitions. Word has length 17 [2019-11-28 20:27:09,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:09,748 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 224 transitions. [2019-11-28 20:27:09,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:09,748 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 224 transitions. [2019-11-28 20:27:09,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 20:27:09,750 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:09,750 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:09,750 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:09,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:09,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1039871977, now seen corresponding path program 1 times [2019-11-28 20:27:09,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:09,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050381551] [2019-11-28 20:27:09,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:09,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:09,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:27:09,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050381551] [2019-11-28 20:27:09,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:09,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:09,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626944333] [2019-11-28 20:27:09,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:09,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:09,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:09,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:09,872 INFO L87 Difference]: Start difference. First operand 149 states and 224 transitions. Second operand 3 states. [2019-11-28 20:27:10,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:10,084 INFO L93 Difference]: Finished difference Result 301 states and 450 transitions. [2019-11-28 20:27:10,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:10,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 20:27:10,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:10,088 INFO L225 Difference]: With dead ends: 301 [2019-11-28 20:27:10,089 INFO L226 Difference]: Without dead ends: 159 [2019-11-28 20:27:10,093 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:10,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-28 20:27:10,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 150. [2019-11-28 20:27:10,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-28 20:27:10,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 225 transitions. [2019-11-28 20:27:10,122 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 225 transitions. Word has length 18 [2019-11-28 20:27:10,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:10,122 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 225 transitions. [2019-11-28 20:27:10,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:10,123 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 225 transitions. [2019-11-28 20:27:10,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 20:27:10,125 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:10,125 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:10,126 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:10,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:10,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1005531851, now seen corresponding path program 1 times [2019-11-28 20:27:10,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:10,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767699536] [2019-11-28 20:27:10,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:10,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:27:10,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767699536] [2019-11-28 20:27:10,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:10,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:10,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858370890] [2019-11-28 20:27:10,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:10,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:10,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:10,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:10,215 INFO L87 Difference]: Start difference. First operand 150 states and 225 transitions. Second operand 3 states. [2019-11-28 20:27:10,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:10,376 INFO L93 Difference]: Finished difference Result 303 states and 452 transitions. [2019-11-28 20:27:10,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:10,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 20:27:10,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:10,379 INFO L225 Difference]: With dead ends: 303 [2019-11-28 20:27:10,379 INFO L226 Difference]: Without dead ends: 160 [2019-11-28 20:27:10,381 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:10,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-28 20:27:10,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 151. [2019-11-28 20:27:10,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-28 20:27:10,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 226 transitions. [2019-11-28 20:27:10,394 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 226 transitions. Word has length 19 [2019-11-28 20:27:10,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:10,395 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 226 transitions. [2019-11-28 20:27:10,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:10,395 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 226 transitions. [2019-11-28 20:27:10,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 20:27:10,396 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:10,396 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:10,397 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:10,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:10,397 INFO L82 PathProgramCache]: Analyzing trace with hash -994026446, now seen corresponding path program 1 times [2019-11-28 20:27:10,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:10,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301415288] [2019-11-28 20:27:10,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:10,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:27:10,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301415288] [2019-11-28 20:27:10,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:10,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:10,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116886170] [2019-11-28 20:27:10,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:10,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:10,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:10,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:10,443 INFO L87 Difference]: Start difference. First operand 151 states and 226 transitions. Second operand 3 states. [2019-11-28 20:27:10,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:10,635 INFO L93 Difference]: Finished difference Result 305 states and 454 transitions. [2019-11-28 20:27:10,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:10,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 20:27:10,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:10,637 INFO L225 Difference]: With dead ends: 305 [2019-11-28 20:27:10,637 INFO L226 Difference]: Without dead ends: 161 [2019-11-28 20:27:10,638 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:10,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-11-28 20:27:10,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 152. [2019-11-28 20:27:10,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-28 20:27:10,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 227 transitions. [2019-11-28 20:27:10,649 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 227 transitions. Word has length 20 [2019-11-28 20:27:10,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:10,650 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 227 transitions. [2019-11-28 20:27:10,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:10,650 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 227 transitions. [2019-11-28 20:27:10,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 20:27:10,651 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:10,651 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:10,652 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:10,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:10,652 INFO L82 PathProgramCache]: Analyzing trace with hash 461608262, now seen corresponding path program 1 times [2019-11-28 20:27:10,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:10,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267029669] [2019-11-28 20:27:10,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:10,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:27:10,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267029669] [2019-11-28 20:27:10,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:10,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:10,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835983001] [2019-11-28 20:27:10,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:10,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:10,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:10,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:10,715 INFO L87 Difference]: Start difference. First operand 152 states and 227 transitions. Second operand 3 states. [2019-11-28 20:27:10,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:10,865 INFO L93 Difference]: Finished difference Result 307 states and 456 transitions. [2019-11-28 20:27:10,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:10,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 20:27:10,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:10,869 INFO L225 Difference]: With dead ends: 307 [2019-11-28 20:27:10,869 INFO L226 Difference]: Without dead ends: 162 [2019-11-28 20:27:10,870 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:10,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-28 20:27:10,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 153. [2019-11-28 20:27:10,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-28 20:27:10,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 228 transitions. [2019-11-28 20:27:10,888 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 228 transitions. Word has length 21 [2019-11-28 20:27:10,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:10,889 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 228 transitions. [2019-11-28 20:27:10,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:10,890 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 228 transitions. [2019-11-28 20:27:10,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-28 20:27:10,896 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:10,896 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:10,896 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:10,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:10,897 INFO L82 PathProgramCache]: Analyzing trace with hash 205704618, now seen corresponding path program 1 times [2019-11-28 20:27:10,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:10,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083907165] [2019-11-28 20:27:10,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:10,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:27:10,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083907165] [2019-11-28 20:27:10,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:10,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:10,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310035553] [2019-11-28 20:27:10,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:10,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:10,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:10,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:10,988 INFO L87 Difference]: Start difference. First operand 153 states and 228 transitions. Second operand 3 states. [2019-11-28 20:27:11,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:11,180 INFO L93 Difference]: Finished difference Result 330 states and 498 transitions. [2019-11-28 20:27:11,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:11,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-11-28 20:27:11,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:11,183 INFO L225 Difference]: With dead ends: 330 [2019-11-28 20:27:11,183 INFO L226 Difference]: Without dead ends: 184 [2019-11-28 20:27:11,184 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:11,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-28 20:27:11,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-11-28 20:27:11,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-28 20:27:11,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 280 transitions. [2019-11-28 20:27:11,193 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 280 transitions. Word has length 46 [2019-11-28 20:27:11,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:11,194 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 280 transitions. [2019-11-28 20:27:11,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:11,194 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 280 transitions. [2019-11-28 20:27:11,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-28 20:27:11,196 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:11,196 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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] [2019-11-28 20:27:11,196 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:11,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:11,197 INFO L82 PathProgramCache]: Analyzing trace with hash 2094953876, now seen corresponding path program 1 times [2019-11-28 20:27:11,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:11,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119107482] [2019-11-28 20:27:11,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:11,233 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 20:27:11,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119107482] [2019-11-28 20:27:11,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:11,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:11,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764155963] [2019-11-28 20:27:11,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:11,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:11,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:11,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:11,236 INFO L87 Difference]: Start difference. First operand 184 states and 280 transitions. Second operand 3 states. [2019-11-28 20:27:11,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:11,387 INFO L93 Difference]: Finished difference Result 379 states and 574 transitions. [2019-11-28 20:27:11,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:11,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-11-28 20:27:11,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:11,390 INFO L225 Difference]: With dead ends: 379 [2019-11-28 20:27:11,390 INFO L226 Difference]: Without dead ends: 202 [2019-11-28 20:27:11,391 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:11,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-11-28 20:27:11,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2019-11-28 20:27:11,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-28 20:27:11,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 301 transitions. [2019-11-28 20:27:11,403 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 301 transitions. Word has length 58 [2019-11-28 20:27:11,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:11,403 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 301 transitions. [2019-11-28 20:27:11,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:11,404 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 301 transitions. [2019-11-28 20:27:11,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-28 20:27:11,406 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:11,406 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 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] [2019-11-28 20:27:11,407 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:11,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:11,407 INFO L82 PathProgramCache]: Analyzing trace with hash 2134557448, now seen corresponding path program 1 times [2019-11-28 20:27:11,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:11,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125449321] [2019-11-28 20:27:11,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:11,467 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 20:27:11,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125449321] [2019-11-28 20:27:11,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:11,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:11,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864321846] [2019-11-28 20:27:11,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:11,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:11,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:11,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:11,471 INFO L87 Difference]: Start difference. First operand 200 states and 301 transitions. Second operand 3 states. [2019-11-28 20:27:11,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:11,606 INFO L93 Difference]: Finished difference Result 396 states and 595 transitions. [2019-11-28 20:27:11,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:11,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-11-28 20:27:11,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:11,608 INFO L225 Difference]: With dead ends: 396 [2019-11-28 20:27:11,608 INFO L226 Difference]: Without dead ends: 203 [2019-11-28 20:27:11,609 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:11,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-11-28 20:27:11,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2019-11-28 20:27:11,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-11-28 20:27:11,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 301 transitions. [2019-11-28 20:27:11,638 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 301 transitions. Word has length 59 [2019-11-28 20:27:11,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:11,639 INFO L462 AbstractCegarLoop]: Abstraction has 201 states and 301 transitions. [2019-11-28 20:27:11,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:11,639 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 301 transitions. [2019-11-28 20:27:11,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-28 20:27:11,640 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:11,640 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-28 20:27:11,640 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:11,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:11,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1607957135, now seen corresponding path program 1 times [2019-11-28 20:27:11,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:11,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879639002] [2019-11-28 20:27:11,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:11,696 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 20:27:11,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879639002] [2019-11-28 20:27:11,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:11,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:11,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454915229] [2019-11-28 20:27:11,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:11,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:11,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:11,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:11,699 INFO L87 Difference]: Start difference. First operand 201 states and 301 transitions. Second operand 3 states. [2019-11-28 20:27:11,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:11,868 INFO L93 Difference]: Finished difference Result 439 states and 666 transitions. [2019-11-28 20:27:11,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:11,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-28 20:27:11,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:11,871 INFO L225 Difference]: With dead ends: 439 [2019-11-28 20:27:11,871 INFO L226 Difference]: Without dead ends: 245 [2019-11-28 20:27:11,872 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:11,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-11-28 20:27:11,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2019-11-28 20:27:11,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-28 20:27:11,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 372 transitions. [2019-11-28 20:27:11,883 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 372 transitions. Word has length 72 [2019-11-28 20:27:11,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:11,884 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 372 transitions. [2019-11-28 20:27:11,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:11,884 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 372 transitions. [2019-11-28 20:27:11,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-28 20:27:11,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:11,885 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-28 20:27:11,886 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:11,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:11,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1882884773, now seen corresponding path program 1 times [2019-11-28 20:27:11,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:11,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935068389] [2019-11-28 20:27:11,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:11,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:11,952 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 20:27:11,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935068389] [2019-11-28 20:27:11,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:11,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:11,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609016813] [2019-11-28 20:27:11,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:11,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:11,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:11,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:11,957 INFO L87 Difference]: Start difference. First operand 243 states and 372 transitions. Second operand 3 states. [2019-11-28 20:27:12,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:12,118 INFO L93 Difference]: Finished difference Result 513 states and 788 transitions. [2019-11-28 20:27:12,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:12,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-28 20:27:12,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:12,120 INFO L225 Difference]: With dead ends: 513 [2019-11-28 20:27:12,121 INFO L226 Difference]: Without dead ends: 277 [2019-11-28 20:27:12,121 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:12,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-11-28 20:27:12,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 270. [2019-11-28 20:27:12,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-11-28 20:27:12,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 412 transitions. [2019-11-28 20:27:12,138 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 412 transitions. Word has length 73 [2019-11-28 20:27:12,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:12,139 INFO L462 AbstractCegarLoop]: Abstraction has 270 states and 412 transitions. [2019-11-28 20:27:12,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:12,140 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 412 transitions. [2019-11-28 20:27:12,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-28 20:27:12,141 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:12,141 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-28 20:27:12,141 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:12,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:12,142 INFO L82 PathProgramCache]: Analyzing trace with hash -369256571, now seen corresponding path program 1 times [2019-11-28 20:27:12,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:12,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486548878] [2019-11-28 20:27:12,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:12,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:12,187 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 20:27:12,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486548878] [2019-11-28 20:27:12,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:12,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:12,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986605646] [2019-11-28 20:27:12,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:12,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:12,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:12,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:12,190 INFO L87 Difference]: Start difference. First operand 270 states and 412 transitions. Second operand 3 states. [2019-11-28 20:27:12,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:12,339 INFO L93 Difference]: Finished difference Result 536 states and 817 transitions. [2019-11-28 20:27:12,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:12,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-28 20:27:12,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:12,341 INFO L225 Difference]: With dead ends: 536 [2019-11-28 20:27:12,342 INFO L226 Difference]: Without dead ends: 273 [2019-11-28 20:27:12,343 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:12,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-28 20:27:12,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2019-11-28 20:27:12,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-11-28 20:27:12,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 412 transitions. [2019-11-28 20:27:12,355 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 412 transitions. Word has length 73 [2019-11-28 20:27:12,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:12,355 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 412 transitions. [2019-11-28 20:27:12,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:12,355 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 412 transitions. [2019-11-28 20:27:12,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-28 20:27:12,356 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:12,356 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-28 20:27:12,357 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:12,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:12,357 INFO L82 PathProgramCache]: Analyzing trace with hash -189803919, now seen corresponding path program 1 times [2019-11-28 20:27:12,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:12,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695236647] [2019-11-28 20:27:12,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:12,394 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 20:27:12,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695236647] [2019-11-28 20:27:12,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:12,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:12,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174243630] [2019-11-28 20:27:12,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:12,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:12,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:12,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:12,397 INFO L87 Difference]: Start difference. First operand 271 states and 412 transitions. Second operand 3 states. [2019-11-28 20:27:12,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:12,537 INFO L93 Difference]: Finished difference Result 542 states and 825 transitions. [2019-11-28 20:27:12,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:12,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-11-28 20:27:12,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:12,540 INFO L225 Difference]: With dead ends: 542 [2019-11-28 20:27:12,540 INFO L226 Difference]: Without dead ends: 278 [2019-11-28 20:27:12,541 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:12,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-11-28 20:27:12,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 271. [2019-11-28 20:27:12,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-11-28 20:27:12,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 409 transitions. [2019-11-28 20:27:12,552 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 409 transitions. Word has length 74 [2019-11-28 20:27:12,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:12,553 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 409 transitions. [2019-11-28 20:27:12,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:12,553 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 409 transitions. [2019-11-28 20:27:12,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-28 20:27:12,554 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:12,555 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-28 20:27:12,555 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:12,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:12,556 INFO L82 PathProgramCache]: Analyzing trace with hash 873313086, now seen corresponding path program 1 times [2019-11-28 20:27:12,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:12,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598742577] [2019-11-28 20:27:12,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:12,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:12,592 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 20:27:12,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598742577] [2019-11-28 20:27:12,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:12,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:12,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084501719] [2019-11-28 20:27:12,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:12,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:12,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:12,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:12,595 INFO L87 Difference]: Start difference. First operand 271 states and 409 transitions. Second operand 3 states. [2019-11-28 20:27:12,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:12,762 INFO L93 Difference]: Finished difference Result 582 states and 881 transitions. [2019-11-28 20:27:12,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:12,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-11-28 20:27:12,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:12,766 INFO L225 Difference]: With dead ends: 582 [2019-11-28 20:27:12,766 INFO L226 Difference]: Without dead ends: 318 [2019-11-28 20:27:12,767 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:12,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-11-28 20:27:12,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 314. [2019-11-28 20:27:12,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-11-28 20:27:12,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 478 transitions. [2019-11-28 20:27:12,781 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 478 transitions. Word has length 89 [2019-11-28 20:27:12,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:12,782 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 478 transitions. [2019-11-28 20:27:12,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:12,782 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 478 transitions. [2019-11-28 20:27:12,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-28 20:27:12,783 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:12,783 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-28 20:27:12,783 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:12,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:12,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1282770437, now seen corresponding path program 1 times [2019-11-28 20:27:12,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:12,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902736300] [2019-11-28 20:27:12,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:12,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:12,844 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 20:27:12,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902736300] [2019-11-28 20:27:12,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:12,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:12,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985182138] [2019-11-28 20:27:12,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:12,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:12,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:12,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:12,846 INFO L87 Difference]: Start difference. First operand 314 states and 478 transitions. Second operand 3 states. [2019-11-28 20:27:13,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:13,016 INFO L93 Difference]: Finished difference Result 637 states and 972 transitions. [2019-11-28 20:27:13,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:13,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-11-28 20:27:13,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:13,019 INFO L225 Difference]: With dead ends: 637 [2019-11-28 20:27:13,019 INFO L226 Difference]: Without dead ends: 328 [2019-11-28 20:27:13,020 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:13,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-11-28 20:27:13,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 324. [2019-11-28 20:27:13,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-11-28 20:27:13,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 497 transitions. [2019-11-28 20:27:13,033 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 497 transitions. Word has length 90 [2019-11-28 20:27:13,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:13,035 INFO L462 AbstractCegarLoop]: Abstraction has 324 states and 497 transitions. [2019-11-28 20:27:13,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:13,035 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 497 transitions. [2019-11-28 20:27:13,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-28 20:27:13,037 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:13,037 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-28 20:27:13,037 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:13,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:13,038 INFO L82 PathProgramCache]: Analyzing trace with hash 630357241, now seen corresponding path program 1 times [2019-11-28 20:27:13,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:13,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301370461] [2019-11-28 20:27:13,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:13,089 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-28 20:27:13,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301370461] [2019-11-28 20:27:13,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:13,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:13,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948611167] [2019-11-28 20:27:13,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:13,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:13,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:13,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:13,091 INFO L87 Difference]: Start difference. First operand 324 states and 497 transitions. Second operand 3 states. [2019-11-28 20:27:13,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:13,235 INFO L93 Difference]: Finished difference Result 678 states and 1042 transitions. [2019-11-28 20:27:13,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:13,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-28 20:27:13,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:13,238 INFO L225 Difference]: With dead ends: 678 [2019-11-28 20:27:13,238 INFO L226 Difference]: Without dead ends: 361 [2019-11-28 20:27:13,241 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:13,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-11-28 20:27:13,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 349. [2019-11-28 20:27:13,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-11-28 20:27:13,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 531 transitions. [2019-11-28 20:27:13,257 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 531 transitions. Word has length 99 [2019-11-28 20:27:13,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:13,258 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 531 transitions. [2019-11-28 20:27:13,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:13,258 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 531 transitions. [2019-11-28 20:27:13,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-28 20:27:13,259 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:13,260 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:13,260 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:13,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:13,260 INFO L82 PathProgramCache]: Analyzing trace with hash 757835045, now seen corresponding path program 1 times [2019-11-28 20:27:13,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:13,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504077503] [2019-11-28 20:27:13,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:13,306 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-28 20:27:13,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504077503] [2019-11-28 20:27:13,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:13,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:13,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000196070] [2019-11-28 20:27:13,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:13,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:13,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:13,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:13,310 INFO L87 Difference]: Start difference. First operand 349 states and 531 transitions. Second operand 3 states. [2019-11-28 20:27:13,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:13,468 INFO L93 Difference]: Finished difference Result 703 states and 1071 transitions. [2019-11-28 20:27:13,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:13,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-28 20:27:13,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:13,471 INFO L225 Difference]: With dead ends: 703 [2019-11-28 20:27:13,471 INFO L226 Difference]: Without dead ends: 361 [2019-11-28 20:27:13,472 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:13,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-11-28 20:27:13,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 349. [2019-11-28 20:27:13,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-11-28 20:27:13,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 526 transitions. [2019-11-28 20:27:13,489 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 526 transitions. Word has length 100 [2019-11-28 20:27:13,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:13,489 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 526 transitions. [2019-11-28 20:27:13,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:13,489 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 526 transitions. [2019-11-28 20:27:13,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-28 20:27:13,491 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:13,491 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2019-11-28 20:27:13,491 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:13,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:13,492 INFO L82 PathProgramCache]: Analyzing trace with hash -927735321, now seen corresponding path program 1 times [2019-11-28 20:27:13,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:13,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811933610] [2019-11-28 20:27:13,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:13,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:13,549 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-28 20:27:13,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811933610] [2019-11-28 20:27:13,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:13,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:13,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399749759] [2019-11-28 20:27:13,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:13,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:13,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:13,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:13,551 INFO L87 Difference]: Start difference. First operand 349 states and 526 transitions. Second operand 3 states. [2019-11-28 20:27:13,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:13,718 INFO L93 Difference]: Finished difference Result 718 states and 1081 transitions. [2019-11-28 20:27:13,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:13,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-11-28 20:27:13,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:13,722 INFO L225 Difference]: With dead ends: 718 [2019-11-28 20:27:13,722 INFO L226 Difference]: Without dead ends: 376 [2019-11-28 20:27:13,723 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:13,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-11-28 20:27:13,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 373. [2019-11-28 20:27:13,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-11-28 20:27:13,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 556 transitions. [2019-11-28 20:27:13,738 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 556 transitions. Word has length 119 [2019-11-28 20:27:13,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:13,738 INFO L462 AbstractCegarLoop]: Abstraction has 373 states and 556 transitions. [2019-11-28 20:27:13,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:13,739 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 556 transitions. [2019-11-28 20:27:13,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-28 20:27:13,740 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:13,740 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-28 20:27:13,740 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:13,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:13,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1207090035, now seen corresponding path program 1 times [2019-11-28 20:27:13,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:13,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729695820] [2019-11-28 20:27:13,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:13,787 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-28 20:27:13,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729695820] [2019-11-28 20:27:13,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:13,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:13,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187620515] [2019-11-28 20:27:13,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:13,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:13,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:13,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:13,790 INFO L87 Difference]: Start difference. First operand 373 states and 556 transitions. Second operand 3 states. [2019-11-28 20:27:13,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:13,965 INFO L93 Difference]: Finished difference Result 742 states and 1105 transitions. [2019-11-28 20:27:13,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:13,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-28 20:27:13,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:13,969 INFO L225 Difference]: With dead ends: 742 [2019-11-28 20:27:13,969 INFO L226 Difference]: Without dead ends: 376 [2019-11-28 20:27:13,970 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:13,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-11-28 20:27:13,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 373. [2019-11-28 20:27:13,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-11-28 20:27:13,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 550 transitions. [2019-11-28 20:27:13,990 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 550 transitions. Word has length 120 [2019-11-28 20:27:13,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:13,990 INFO L462 AbstractCegarLoop]: Abstraction has 373 states and 550 transitions. [2019-11-28 20:27:13,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:13,991 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 550 transitions. [2019-11-28 20:27:13,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-28 20:27:13,993 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:13,993 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2019-11-28 20:27:13,993 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:13,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:13,994 INFO L82 PathProgramCache]: Analyzing trace with hash -568364771, now seen corresponding path program 1 times [2019-11-28 20:27:13,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:13,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046767848] [2019-11-28 20:27:13,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:14,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:14,068 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-28 20:27:14,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046767848] [2019-11-28 20:27:14,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:14,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:14,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028964379] [2019-11-28 20:27:14,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:14,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:14,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:14,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:14,073 INFO L87 Difference]: Start difference. First operand 373 states and 550 transitions. Second operand 3 states. [2019-11-28 20:27:14,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:14,286 INFO L93 Difference]: Finished difference Result 784 states and 1155 transitions. [2019-11-28 20:27:14,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:14,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-11-28 20:27:14,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:14,289 INFO L225 Difference]: With dead ends: 784 [2019-11-28 20:27:14,290 INFO L226 Difference]: Without dead ends: 418 [2019-11-28 20:27:14,291 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:14,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-11-28 20:27:14,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 414. [2019-11-28 20:27:14,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-11-28 20:27:14,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 609 transitions. [2019-11-28 20:27:14,317 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 609 transitions. Word has length 129 [2019-11-28 20:27:14,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:14,317 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 609 transitions. [2019-11-28 20:27:14,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:14,318 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 609 transitions. [2019-11-28 20:27:14,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-28 20:27:14,320 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:14,321 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2019-11-28 20:27:14,321 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:14,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:14,322 INFO L82 PathProgramCache]: Analyzing trace with hash 12959108, now seen corresponding path program 1 times [2019-11-28 20:27:14,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:14,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621234521] [2019-11-28 20:27:14,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:14,384 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-28 20:27:14,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621234521] [2019-11-28 20:27:14,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:14,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:14,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259599413] [2019-11-28 20:27:14,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:14,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:14,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:14,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:14,387 INFO L87 Difference]: Start difference. First operand 414 states and 609 transitions. Second operand 3 states. [2019-11-28 20:27:14,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:14,548 INFO L93 Difference]: Finished difference Result 825 states and 1212 transitions. [2019-11-28 20:27:14,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:14,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-11-28 20:27:14,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:14,552 INFO L225 Difference]: With dead ends: 825 [2019-11-28 20:27:14,552 INFO L226 Difference]: Without dead ends: 416 [2019-11-28 20:27:14,553 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:14,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2019-11-28 20:27:14,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 412. [2019-11-28 20:27:14,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-11-28 20:27:14,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 604 transitions. [2019-11-28 20:27:14,570 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 604 transitions. Word has length 130 [2019-11-28 20:27:14,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:14,571 INFO L462 AbstractCegarLoop]: Abstraction has 412 states and 604 transitions. [2019-11-28 20:27:14,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:14,571 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 604 transitions. [2019-11-28 20:27:14,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-28 20:27:14,574 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:14,574 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 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] [2019-11-28 20:27:14,574 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:14,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:14,575 INFO L82 PathProgramCache]: Analyzing trace with hash -637521445, now seen corresponding path program 1 times [2019-11-28 20:27:14,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:14,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462344371] [2019-11-28 20:27:14,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:14,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:14,617 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 20:27:14,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462344371] [2019-11-28 20:27:14,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:14,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:14,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924437334] [2019-11-28 20:27:14,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:14,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:14,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:14,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:14,621 INFO L87 Difference]: Start difference. First operand 412 states and 604 transitions. Second operand 3 states. [2019-11-28 20:27:14,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:14,752 INFO L93 Difference]: Finished difference Result 842 states and 1234 transitions. [2019-11-28 20:27:14,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:14,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-11-28 20:27:14,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:14,755 INFO L225 Difference]: With dead ends: 842 [2019-11-28 20:27:14,756 INFO L226 Difference]: Without dead ends: 437 [2019-11-28 20:27:14,757 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:14,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-11-28 20:27:14,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 433. [2019-11-28 20:27:14,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-11-28 20:27:14,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 627 transitions. [2019-11-28 20:27:14,773 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 627 transitions. Word has length 140 [2019-11-28 20:27:14,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:14,773 INFO L462 AbstractCegarLoop]: Abstraction has 433 states and 627 transitions. [2019-11-28 20:27:14,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:14,774 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 627 transitions. [2019-11-28 20:27:14,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-28 20:27:14,776 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:14,776 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 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] [2019-11-28 20:27:14,776 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:14,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:14,777 INFO L82 PathProgramCache]: Analyzing trace with hash 871119983, now seen corresponding path program 1 times [2019-11-28 20:27:14,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:14,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109071309] [2019-11-28 20:27:14,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:14,813 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 20:27:14,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109071309] [2019-11-28 20:27:14,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:14,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:14,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156993368] [2019-11-28 20:27:14,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:14,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:14,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:14,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:14,816 INFO L87 Difference]: Start difference. First operand 433 states and 627 transitions. Second operand 3 states. [2019-11-28 20:27:14,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:14,939 INFO L93 Difference]: Finished difference Result 863 states and 1249 transitions. [2019-11-28 20:27:14,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:14,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-11-28 20:27:14,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:14,943 INFO L225 Difference]: With dead ends: 863 [2019-11-28 20:27:14,943 INFO L226 Difference]: Without dead ends: 437 [2019-11-28 20:27:14,944 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:14,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-11-28 20:27:14,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 433. [2019-11-28 20:27:14,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-11-28 20:27:14,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 619 transitions. [2019-11-28 20:27:14,961 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 619 transitions. Word has length 141 [2019-11-28 20:27:14,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:14,961 INFO L462 AbstractCegarLoop]: Abstraction has 433 states and 619 transitions. [2019-11-28 20:27:14,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:14,961 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 619 transitions. [2019-11-28 20:27:14,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-28 20:27:14,963 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:14,963 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 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] [2019-11-28 20:27:14,964 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:14,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:14,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1128117336, now seen corresponding path program 1 times [2019-11-28 20:27:14,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:14,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076213851] [2019-11-28 20:27:14,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:14,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:15,006 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-11-28 20:27:15,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076213851] [2019-11-28 20:27:15,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:15,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:27:15,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415262844] [2019-11-28 20:27:15,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:15,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:15,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:15,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:15,008 INFO L87 Difference]: Start difference. First operand 433 states and 619 transitions. Second operand 3 states. [2019-11-28 20:27:15,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:15,053 INFO L93 Difference]: Finished difference Result 1279 states and 1823 transitions. [2019-11-28 20:27:15,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:15,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-11-28 20:27:15,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:15,058 INFO L225 Difference]: With dead ends: 1279 [2019-11-28 20:27:15,059 INFO L226 Difference]: Without dead ends: 853 [2019-11-28 20:27:15,060 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:15,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2019-11-28 20:27:15,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 434. [2019-11-28 20:27:15,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-11-28 20:27:15,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 620 transitions. [2019-11-28 20:27:15,084 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 620 transitions. Word has length 156 [2019-11-28 20:27:15,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:15,085 INFO L462 AbstractCegarLoop]: Abstraction has 434 states and 620 transitions. [2019-11-28 20:27:15,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:15,085 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 620 transitions. [2019-11-28 20:27:15,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-28 20:27:15,088 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:15,088 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 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] [2019-11-28 20:27:15,088 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:15,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:15,089 INFO L82 PathProgramCache]: Analyzing trace with hash 386659640, now seen corresponding path program 1 times [2019-11-28 20:27:15,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:15,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69106495] [2019-11-28 20:27:15,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:15,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:15,177 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-28 20:27:15,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69106495] [2019-11-28 20:27:15,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528865693] [2019-11-28 20:27:15,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:27:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:15,318 INFO L264 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 20:27:15,341 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:27:15,405 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-28 20:27:15,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:27:15,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-28 20:27:15,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736806913] [2019-11-28 20:27:15,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:27:15,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:15,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:27:15,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:27:15,410 INFO L87 Difference]: Start difference. First operand 434 states and 620 transitions. Second operand 4 states. [2019-11-28 20:27:15,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:15,811 INFO L93 Difference]: Finished difference Result 1355 states and 1932 transitions. [2019-11-28 20:27:15,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:27:15,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-11-28 20:27:15,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:15,818 INFO L225 Difference]: With dead ends: 1355 [2019-11-28 20:27:15,818 INFO L226 Difference]: Without dead ends: 903 [2019-11-28 20:27:15,820 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:27:15,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-11-28 20:27:15,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 532. [2019-11-28 20:27:15,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-11-28 20:27:15,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 761 transitions. [2019-11-28 20:27:15,854 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 761 transitions. Word has length 156 [2019-11-28 20:27:15,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:15,854 INFO L462 AbstractCegarLoop]: Abstraction has 532 states and 761 transitions. [2019-11-28 20:27:15,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:27:15,855 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 761 transitions. [2019-11-28 20:27:15,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-28 20:27:15,857 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:15,857 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 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] [2019-11-28 20:27:16,063 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:27:16,063 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:16,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:16,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1891443376, now seen corresponding path program 1 times [2019-11-28 20:27:16,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:16,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664931955] [2019-11-28 20:27:16,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:16,184 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 120 proven. 7 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-28 20:27:16,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664931955] [2019-11-28 20:27:16,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961160199] [2019-11-28 20:27:16,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:27:16,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:16,301 INFO L264 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 20:27:16,318 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:27:16,377 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 120 proven. 7 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-28 20:27:16,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:27:16,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-28 20:27:16,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389024305] [2019-11-28 20:27:16,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:27:16,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:16,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:27:16,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:27:16,384 INFO L87 Difference]: Start difference. First operand 532 states and 761 transitions. Second operand 4 states. [2019-11-28 20:27:16,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:16,749 INFO L93 Difference]: Finished difference Result 1476 states and 2098 transitions. [2019-11-28 20:27:16,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:27:16,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-11-28 20:27:16,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:16,755 INFO L225 Difference]: With dead ends: 1476 [2019-11-28 20:27:16,755 INFO L226 Difference]: Without dead ends: 951 [2019-11-28 20:27:16,756 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:27:16,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-11-28 20:27:16,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 587. [2019-11-28 20:27:16,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-11-28 20:27:16,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 801 transitions. [2019-11-28 20:27:16,793 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 801 transitions. Word has length 158 [2019-11-28 20:27:16,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:16,793 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 801 transitions. [2019-11-28 20:27:16,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:27:16,794 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 801 transitions. [2019-11-28 20:27:16,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-28 20:27:16,796 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:16,796 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2019-11-28 20:27:17,001 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:27:17,004 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:17,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:17,005 INFO L82 PathProgramCache]: Analyzing trace with hash -136801648, now seen corresponding path program 1 times [2019-11-28 20:27:17,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:17,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948320712] [2019-11-28 20:27:17,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:17,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:17,069 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 97 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-28 20:27:17,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948320712] [2019-11-28 20:27:17,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981788829] [2019-11-28 20:27:17,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:27:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:17,144 INFO L264 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 20:27:17,147 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:27:17,170 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 97 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-28 20:27:17,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:27:17,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-28 20:27:17,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420768890] [2019-11-28 20:27:17,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:27:17,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:17,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:27:17,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:27:17,172 INFO L87 Difference]: Start difference. First operand 587 states and 801 transitions. Second operand 4 states. [2019-11-28 20:27:17,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:17,545 INFO L93 Difference]: Finished difference Result 1484 states and 2022 transitions. [2019-11-28 20:27:17,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:27:17,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-11-28 20:27:17,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:17,550 INFO L225 Difference]: With dead ends: 1484 [2019-11-28 20:27:17,550 INFO L226 Difference]: Without dead ends: 897 [2019-11-28 20:27:17,552 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:27:17,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-11-28 20:27:17,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 515. [2019-11-28 20:27:17,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2019-11-28 20:27:17,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 700 transitions. [2019-11-28 20:27:17,579 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 700 transitions. Word has length 166 [2019-11-28 20:27:17,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:17,580 INFO L462 AbstractCegarLoop]: Abstraction has 515 states and 700 transitions. [2019-11-28 20:27:17,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:27:17,580 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 700 transitions. [2019-11-28 20:27:17,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-28 20:27:17,583 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:17,583 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2019-11-28 20:27:17,787 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:27:17,792 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:17,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:17,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1003230858, now seen corresponding path program 1 times [2019-11-28 20:27:17,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:17,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581914051] [2019-11-28 20:27:17,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:17,887 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-28 20:27:17,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581914051] [2019-11-28 20:27:17,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:17,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:27:17,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964818241] [2019-11-28 20:27:17,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:17,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:17,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:17,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:17,890 INFO L87 Difference]: Start difference. First operand 515 states and 700 transitions. Second operand 3 states. [2019-11-28 20:27:17,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:17,931 INFO L93 Difference]: Finished difference Result 1226 states and 1656 transitions. [2019-11-28 20:27:17,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:17,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-11-28 20:27:17,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:17,934 INFO L225 Difference]: With dead ends: 1226 [2019-11-28 20:27:17,935 INFO L226 Difference]: Without dead ends: 477 [2019-11-28 20:27:17,936 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:17,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-11-28 20:27:17,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2019-11-28 20:27:17,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-11-28 20:27:17,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 648 transitions. [2019-11-28 20:27:17,957 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 648 transitions. Word has length 168 [2019-11-28 20:27:17,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:17,958 INFO L462 AbstractCegarLoop]: Abstraction has 477 states and 648 transitions. [2019-11-28 20:27:17,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:17,958 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 648 transitions. [2019-11-28 20:27:17,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-11-28 20:27:17,961 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:17,961 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 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] [2019-11-28 20:27:17,962 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:17,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:17,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1602987784, now seen corresponding path program 1 times [2019-11-28 20:27:17,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:17,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456490906] [2019-11-28 20:27:17,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:18,053 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-11-28 20:27:18,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456490906] [2019-11-28 20:27:18,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:18,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:18,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342007854] [2019-11-28 20:27:18,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:18,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:18,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:18,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:18,057 INFO L87 Difference]: Start difference. First operand 477 states and 648 transitions. Second operand 3 states. [2019-11-28 20:27:18,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:18,252 INFO L93 Difference]: Finished difference Result 964 states and 1304 transitions. [2019-11-28 20:27:18,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:18,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-11-28 20:27:18,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:18,257 INFO L225 Difference]: With dead ends: 964 [2019-11-28 20:27:18,257 INFO L226 Difference]: Without dead ends: 482 [2019-11-28 20:27:18,259 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:18,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-11-28 20:27:18,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 478. [2019-11-28 20:27:18,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2019-11-28 20:27:18,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 639 transitions. [2019-11-28 20:27:18,284 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 639 transitions. Word has length 200 [2019-11-28 20:27:18,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:18,285 INFO L462 AbstractCegarLoop]: Abstraction has 478 states and 639 transitions. [2019-11-28 20:27:18,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:18,286 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 639 transitions. [2019-11-28 20:27:18,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-11-28 20:27:18,297 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:18,297 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:18,298 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:18,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:18,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1001955789, now seen corresponding path program 1 times [2019-11-28 20:27:18,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:18,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762347762] [2019-11-28 20:27:18,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:18,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 700 proven. 0 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2019-11-28 20:27:18,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762347762] [2019-11-28 20:27:18,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:18,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:27:18,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473753451] [2019-11-28 20:27:18,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:18,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:18,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:18,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:18,490 INFO L87 Difference]: Start difference. First operand 478 states and 639 transitions. Second operand 3 states. [2019-11-28 20:27:18,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:18,685 INFO L93 Difference]: Finished difference Result 985 states and 1310 transitions. [2019-11-28 20:27:18,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:18,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 339 [2019-11-28 20:27:18,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:18,689 INFO L225 Difference]: With dead ends: 985 [2019-11-28 20:27:18,690 INFO L226 Difference]: Without dead ends: 514 [2019-11-28 20:27:18,691 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:18,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-11-28 20:27:18,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 512. [2019-11-28 20:27:18,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-11-28 20:27:18,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 678 transitions. [2019-11-28 20:27:18,723 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 678 transitions. Word has length 339 [2019-11-28 20:27:18,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:18,724 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 678 transitions. [2019-11-28 20:27:18,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:18,724 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 678 transitions. [2019-11-28 20:27:18,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-11-28 20:27:18,736 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:18,737 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 4, 4, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:18,737 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:18,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:18,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1590673358, now seen corresponding path program 1 times [2019-11-28 20:27:18,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:18,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628924056] [2019-11-28 20:27:18,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:18,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1424 backedges. 824 proven. 0 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2019-11-28 20:27:18,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628924056] [2019-11-28 20:27:18,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:18,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:27:18,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483447265] [2019-11-28 20:27:18,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:18,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:18,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:18,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:18,959 INFO L87 Difference]: Start difference. First operand 512 states and 678 transitions. Second operand 3 states. [2019-11-28 20:27:19,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:19,126 INFO L93 Difference]: Finished difference Result 1055 states and 1392 transitions. [2019-11-28 20:27:19,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:19,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 370 [2019-11-28 20:27:19,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:19,130 INFO L225 Difference]: With dead ends: 1055 [2019-11-28 20:27:19,130 INFO L226 Difference]: Without dead ends: 550 [2019-11-28 20:27:19,131 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:19,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-11-28 20:27:19,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 548. [2019-11-28 20:27:19,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-11-28 20:27:19,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 719 transitions. [2019-11-28 20:27:19,159 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 719 transitions. Word has length 370 [2019-11-28 20:27:19,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:19,160 INFO L462 AbstractCegarLoop]: Abstraction has 548 states and 719 transitions. [2019-11-28 20:27:19,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:19,161 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 719 transitions. [2019-11-28 20:27:19,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-11-28 20:27:19,170 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:19,170 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 5, 5, 4, 4, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:19,170 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:19,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:19,171 INFO L82 PathProgramCache]: Analyzing trace with hash 458339096, now seen corresponding path program 1 times [2019-11-28 20:27:19,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:19,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886748930] [2019-11-28 20:27:19,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:19,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:19,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 970 proven. 0 refuted. 0 times theorem prover too weak. 749 trivial. 0 not checked. [2019-11-28 20:27:19,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886748930] [2019-11-28 20:27:19,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:19,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:27:19,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682167912] [2019-11-28 20:27:19,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:19,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:19,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:19,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:19,411 INFO L87 Difference]: Start difference. First operand 548 states and 719 transitions. Second operand 3 states. [2019-11-28 20:27:19,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:19,478 INFO L93 Difference]: Finished difference Result 1630 states and 2135 transitions. [2019-11-28 20:27:19,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:19,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 403 [2019-11-28 20:27:19,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:19,486 INFO L225 Difference]: With dead ends: 1630 [2019-11-28 20:27:19,487 INFO L226 Difference]: Without dead ends: 1089 [2019-11-28 20:27:19,488 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:19,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2019-11-28 20:27:19,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1087. [2019-11-28 20:27:19,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1087 states. [2019-11-28 20:27:19,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1426 transitions. [2019-11-28 20:27:19,549 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1426 transitions. Word has length 403 [2019-11-28 20:27:19,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:19,550 INFO L462 AbstractCegarLoop]: Abstraction has 1087 states and 1426 transitions. [2019-11-28 20:27:19,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:19,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1426 transitions. [2019-11-28 20:27:19,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-11-28 20:27:19,562 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:19,562 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 5, 5, 4, 4, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:19,563 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:19,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:19,563 INFO L82 PathProgramCache]: Analyzing trace with hash 747158486, now seen corresponding path program 1 times [2019-11-28 20:27:19,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:19,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757235042] [2019-11-28 20:27:19,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:19,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 354 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-11-28 20:27:19,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757235042] [2019-11-28 20:27:19,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362197595] [2019-11-28 20:27:19,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:27:19,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:19,895 INFO L264 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 20:27:19,899 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:27:20,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 354 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-11-28 20:27:20,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:27:20,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-28 20:27:20,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959621754] [2019-11-28 20:27:20,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:27:20,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:20,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:27:20,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:27:20,020 INFO L87 Difference]: Start difference. First operand 1087 states and 1426 transitions. Second operand 4 states. [2019-11-28 20:27:20,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:20,381 INFO L93 Difference]: Finished difference Result 2539 states and 3361 transitions. [2019-11-28 20:27:20,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:27:20,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 403 [2019-11-28 20:27:20,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:20,383 INFO L225 Difference]: With dead ends: 2539 [2019-11-28 20:27:20,384 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 20:27:20,387 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:27:20,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 20:27:20,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 20:27:20,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 20:27:20,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 20:27:20,388 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 403 [2019-11-28 20:27:20,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:20,389 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:27:20,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:27:20,389 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:27:20,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 20:27:20,594 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:27:20,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 20:27:21,637 WARN L192 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 194 [2019-11-28 20:27:22,068 WARN L192 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 194 [2019-11-28 20:27:22,454 WARN L192 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-11-28 20:27:22,913 WARN L192 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-11-28 20:27:23,223 WARN L192 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-11-28 20:27:23,423 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 47 [2019-11-28 20:27:23,647 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 33 [2019-11-28 20:27:23,866 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 47 [2019-11-28 20:27:24,092 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 47 [2019-11-28 20:27:24,354 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2019-11-28 20:27:24,546 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 46 [2019-11-28 20:27:24,749 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 46 [2019-11-28 20:27:24,943 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 14 [2019-11-28 20:27:25,137 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 47 [2019-11-28 20:27:25,366 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 14 [2019-11-28 20:27:25,770 WARN L192 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 52 [2019-11-28 20:27:27,445 WARN L192 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 181 DAG size of output: 68 [2019-11-28 20:27:27,667 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 6 [2019-11-28 20:27:27,867 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 48 [2019-11-28 20:27:29,476 WARN L192 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 181 DAG size of output: 68 [2019-11-28 20:27:29,661 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2019-11-28 20:27:29,665 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 260) no Hoare annotation was computed. [2019-11-28 20:27:29,665 INFO L246 CegarLoopResult]: For program point L630(lines 630 654) no Hoare annotation was computed. [2019-11-28 20:27:29,666 INFO L246 CegarLoopResult]: For program point L564(lines 564 568) no Hoare annotation was computed. [2019-11-28 20:27:29,666 INFO L246 CegarLoopResult]: For program point L498(lines 498 502) no Hoare annotation was computed. [2019-11-28 20:27:29,666 INFO L246 CegarLoopResult]: For program point L564-2(lines 564 568) no Hoare annotation was computed. [2019-11-28 20:27:29,666 INFO L246 CegarLoopResult]: For program point L498-2(lines 209 590) no Hoare annotation was computed. [2019-11-28 20:27:29,666 INFO L246 CegarLoopResult]: For program point L201(lines 201 595) no Hoare annotation was computed. [2019-11-28 20:27:29,666 INFO L246 CegarLoopResult]: For program point L168(lines 168 606) no Hoare annotation was computed. [2019-11-28 20:27:29,667 INFO L246 CegarLoopResult]: For program point L135(lines 135 617) no Hoare annotation was computed. [2019-11-28 20:27:29,667 INFO L246 CegarLoopResult]: For program point L102(lines 102 628) no Hoare annotation was computed. [2019-11-28 20:27:29,667 INFO L246 CegarLoopResult]: For program point L664(lines 664 668) no Hoare annotation was computed. [2019-11-28 20:27:29,667 INFO L246 CegarLoopResult]: For program point L631(lines 631 640) no Hoare annotation was computed. [2019-11-28 20:27:29,667 INFO L246 CegarLoopResult]: For program point L664-2(lines 664 668) no Hoare annotation was computed. [2019-11-28 20:27:29,667 INFO L246 CegarLoopResult]: For program point L631-2(lines 630 652) no Hoare annotation was computed. [2019-11-28 20:27:29,668 INFO L246 CegarLoopResult]: For program point L268(lines 268 272) no Hoare annotation was computed. [2019-11-28 20:27:29,669 INFO L242 CegarLoopResult]: At program point L202(lines 198 596) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (.cse3 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse1 .cse2 .cse3 .cse4 .cse5))) [2019-11-28 20:27:29,669 INFO L242 CegarLoopResult]: At program point L103(lines 102 628) the Hoare annotation is: false [2019-11-28 20:27:29,669 INFO L246 CegarLoopResult]: For program point L302(lines 302 306) no Hoare annotation was computed. [2019-11-28 20:27:29,669 INFO L246 CegarLoopResult]: For program point L302-2(lines 209 590) no Hoare annotation was computed. [2019-11-28 20:27:29,670 INFO L246 CegarLoopResult]: For program point L633(lines 633 637) no Hoare annotation was computed. [2019-11-28 20:27:29,670 INFO L246 CegarLoopResult]: For program point L204(lines 204 594) no Hoare annotation was computed. [2019-11-28 20:27:29,670 INFO L246 CegarLoopResult]: For program point L171(lines 171 605) no Hoare annotation was computed. [2019-11-28 20:27:29,670 INFO L246 CegarLoopResult]: For program point L138(lines 138 616) no Hoare annotation was computed. [2019-11-28 20:27:29,670 INFO L246 CegarLoopResult]: For program point L105(lines 105 627) no Hoare annotation was computed. [2019-11-28 20:27:29,670 INFO L246 CegarLoopResult]: For program point L337(lines 337 341) no Hoare annotation was computed. [2019-11-28 20:27:29,671 INFO L246 CegarLoopResult]: For program point L337-2(lines 209 590) no Hoare annotation was computed. [2019-11-28 20:27:29,671 INFO L242 CegarLoopResult]: At program point L205(lines 204 594) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-11-28 20:27:29,671 INFO L242 CegarLoopResult]: At program point L172(lines 168 606) the Hoare annotation is: (and (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) [2019-11-28 20:27:29,671 INFO L242 CegarLoopResult]: At program point L139(lines 135 617) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse10 .cse11 .cse12 .cse13))) [2019-11-28 20:27:29,672 INFO L246 CegarLoopResult]: For program point L73(lines 73 81) no Hoare annotation was computed. [2019-11-28 20:27:29,672 INFO L246 CegarLoopResult]: For program point L437(lines 437 449) no Hoare annotation was computed. [2019-11-28 20:27:29,672 INFO L242 CegarLoopResult]: At program point L404(lines 395 415) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-28 20:27:29,672 INFO L246 CegarLoopResult]: For program point L437-2(lines 437 449) no Hoare annotation was computed. [2019-11-28 20:27:29,672 INFO L246 CegarLoopResult]: For program point L174(lines 174 604) no Hoare annotation was computed. [2019-11-28 20:27:29,673 INFO L246 CegarLoopResult]: For program point L141(lines 141 615) no Hoare annotation was computed. [2019-11-28 20:27:29,673 INFO L246 CegarLoopResult]: For program point L108(lines 108 626) no Hoare annotation was computed. [2019-11-28 20:27:29,673 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 260) no Hoare annotation was computed. [2019-11-28 20:27:29,673 INFO L242 CegarLoopResult]: At program point L208(lines 207 593) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-11-28 20:27:29,673 INFO L246 CegarLoopResult]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-11-28 20:27:29,674 INFO L246 CegarLoopResult]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2019-11-28 20:27:29,674 INFO L246 CegarLoopResult]: For program point L539(lines 539 544) no Hoare annotation was computed. [2019-11-28 20:27:29,674 INFO L246 CegarLoopResult]: For program point L440(lines 440 445) no Hoare annotation was computed. [2019-11-28 20:27:29,674 INFO L246 CegarLoopResult]: For program point L407(lines 407 411) no Hoare annotation was computed. [2019-11-28 20:27:29,674 INFO L246 CegarLoopResult]: For program point L242(lines 242 247) no Hoare annotation was computed. [2019-11-28 20:27:29,674 INFO L246 CegarLoopResult]: For program point L177(lines 177 603) no Hoare annotation was computed. [2019-11-28 20:27:29,675 INFO L246 CegarLoopResult]: For program point L144(lines 144 614) no Hoare annotation was computed. [2019-11-28 20:27:29,675 INFO L246 CegarLoopResult]: For program point L111(lines 111 625) no Hoare annotation was computed. [2019-11-28 20:27:29,675 INFO L246 CegarLoopResult]: For program point L574(lines 574 584) no Hoare annotation was computed. [2019-11-28 20:27:29,675 INFO L246 CegarLoopResult]: For program point L574-1(lines 574 584) no Hoare annotation was computed. [2019-11-28 20:27:29,675 INFO L246 CegarLoopResult]: For program point L508(lines 508 512) no Hoare annotation was computed. [2019-11-28 20:27:29,675 INFO L246 CegarLoopResult]: For program point L508-2(lines 508 512) no Hoare annotation was computed. [2019-11-28 20:27:29,676 INFO L242 CegarLoopResult]: At program point L178(lines 174 604) the Hoare annotation is: (let ((.cse0 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (or (and .cse0 .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse0 .cse1))) [2019-11-28 20:27:29,676 INFO L242 CegarLoopResult]: At program point L145(lines 141 615) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-28 20:27:29,676 INFO L246 CegarLoopResult]: For program point L476(lines 476 480) no Hoare annotation was computed. [2019-11-28 20:27:29,676 INFO L242 CegarLoopResult]: At program point L212(lines 105 627) the Hoare annotation is: false [2019-11-28 20:27:29,676 INFO L249 CegarLoopResult]: At program point L675(lines 65 677) the Hoare annotation is: true [2019-11-28 20:27:29,677 INFO L246 CegarLoopResult]: For program point L642(lines 642 648) no Hoare annotation was computed. [2019-11-28 20:27:29,677 INFO L246 CegarLoopResult]: For program point L345(lines 345 377) no Hoare annotation was computed. [2019-11-28 20:27:29,677 INFO L246 CegarLoopResult]: For program point L312(lines 312 316) no Hoare annotation was computed. [2019-11-28 20:27:29,677 INFO L246 CegarLoopResult]: For program point L312-2(lines 312 316) no Hoare annotation was computed. [2019-11-28 20:27:29,677 INFO L246 CegarLoopResult]: For program point L180(lines 180 602) no Hoare annotation was computed. [2019-11-28 20:27:29,678 INFO L246 CegarLoopResult]: For program point L147(lines 147 613) no Hoare annotation was computed. [2019-11-28 20:27:29,678 INFO L246 CegarLoopResult]: For program point L114(lines 114 624) no Hoare annotation was computed. [2019-11-28 20:27:29,678 INFO L249 CegarLoopResult]: At program point L676(lines 10 678) the Hoare annotation is: true [2019-11-28 20:27:29,678 INFO L246 CegarLoopResult]: For program point L577(lines 577 581) no Hoare annotation was computed. [2019-11-28 20:27:29,678 INFO L246 CegarLoopResult]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-11-28 20:27:29,678 INFO L246 CegarLoopResult]: For program point L83-1(lines 65 677) no Hoare annotation was computed. [2019-11-28 20:27:29,679 INFO L246 CegarLoopResult]: For program point L348(lines 348 376) no Hoare annotation was computed. [2019-11-28 20:27:29,679 INFO L246 CegarLoopResult]: For program point L348-1(lines 348 376) no Hoare annotation was computed. [2019-11-28 20:27:29,679 INFO L246 CegarLoopResult]: For program point L249(lines 249 262) no Hoare annotation was computed. [2019-11-28 20:27:29,679 INFO L246 CegarLoopResult]: For program point L183(lines 183 601) no Hoare annotation was computed. [2019-11-28 20:27:29,679 INFO L246 CegarLoopResult]: For program point L150(lines 150 612) no Hoare annotation was computed. [2019-11-28 20:27:29,680 INFO L246 CegarLoopResult]: For program point L117(lines 117 623) no Hoare annotation was computed. [2019-11-28 20:27:29,680 INFO L246 CegarLoopResult]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-11-28 20:27:29,680 INFO L246 CegarLoopResult]: For program point L349(lines 349 373) no Hoare annotation was computed. [2019-11-28 20:27:29,680 INFO L246 CegarLoopResult]: For program point L217(lines 217 221) no Hoare annotation was computed. [2019-11-28 20:27:29,680 INFO L242 CegarLoopResult]: At program point L184(lines 180 602) the Hoare annotation is: (let ((.cse0 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (or (and .cse0 .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse0 .cse1))) [2019-11-28 20:27:29,681 INFO L242 CegarLoopResult]: At program point L151(lines 147 613) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-28 20:27:29,681 INFO L246 CegarLoopResult]: For program point L217-2(lines 209 590) no Hoare annotation was computed. [2019-11-28 20:27:29,681 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 20:27:29,681 INFO L246 CegarLoopResult]: For program point L251(lines 251 256) no Hoare annotation was computed. [2019-11-28 20:27:29,681 INFO L246 CegarLoopResult]: For program point L549(lines 549 557) no Hoare annotation was computed. [2019-11-28 20:27:29,682 INFO L246 CegarLoopResult]: For program point L285(lines 285 289) no Hoare annotation was computed. [2019-11-28 20:27:29,682 INFO L246 CegarLoopResult]: For program point L285-2(lines 209 590) no Hoare annotation was computed. [2019-11-28 20:27:29,682 INFO L246 CegarLoopResult]: For program point L186(lines 186 600) no Hoare annotation was computed. [2019-11-28 20:27:29,682 INFO L246 CegarLoopResult]: For program point L153(lines 153 611) no Hoare annotation was computed. [2019-11-28 20:27:29,682 INFO L246 CegarLoopResult]: For program point L120(lines 120 622) no Hoare annotation was computed. [2019-11-28 20:27:29,682 INFO L246 CegarLoopResult]: For program point L385(lines 385 416) no Hoare annotation was computed. [2019-11-28 20:27:29,683 INFO L246 CegarLoopResult]: For program point L352(lines 352 372) no Hoare annotation was computed. [2019-11-28 20:27:29,683 INFO L242 CegarLoopResult]: At program point L121(lines 117 623) the Hoare annotation is: false [2019-11-28 20:27:29,683 INFO L246 CegarLoopResult]: For program point L386(lines 386 392) no Hoare annotation was computed. [2019-11-28 20:27:29,683 INFO L246 CegarLoopResult]: For program point L552(lines 552 556) no Hoare annotation was computed. [2019-11-28 20:27:29,683 INFO L246 CegarLoopResult]: For program point L519(lines 519 524) no Hoare annotation was computed. [2019-11-28 20:27:29,683 INFO L246 CegarLoopResult]: For program point L354(lines 354 358) no Hoare annotation was computed. [2019-11-28 20:27:29,684 INFO L246 CegarLoopResult]: For program point L321-1(lines 321 330) no Hoare annotation was computed. [2019-11-28 20:27:29,684 INFO L246 CegarLoopResult]: For program point L354-2(lines 352 370) no Hoare annotation was computed. [2019-11-28 20:27:29,684 INFO L246 CegarLoopResult]: For program point L189(lines 189 599) no Hoare annotation was computed. [2019-11-28 20:27:29,684 INFO L246 CegarLoopResult]: For program point L156(lines 156 610) no Hoare annotation was computed. [2019-11-28 20:27:29,684 INFO L246 CegarLoopResult]: For program point L123(lines 123 621) no Hoare annotation was computed. [2019-11-28 20:27:29,684 INFO L242 CegarLoopResult]: At program point L553(lines 65 677) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-11-28 20:27:29,685 INFO L246 CegarLoopResult]: For program point L487(lines 487 491) no Hoare annotation was computed. [2019-11-28 20:27:29,685 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 20:27:29,685 INFO L242 CegarLoopResult]: At program point L190(lines 186 600) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse5 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)))) (or (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-28 20:27:29,685 INFO L242 CegarLoopResult]: At program point L157(lines 153 611) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-28 20:27:29,686 INFO L242 CegarLoopResult]: At program point L124(lines 123 621) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-28 20:27:29,686 INFO L246 CegarLoopResult]: For program point L455(lines 455 459) no Hoare annotation was computed. [2019-11-28 20:27:29,686 INFO L246 CegarLoopResult]: For program point L258(line 258) no Hoare annotation was computed. [2019-11-28 20:27:29,686 INFO L246 CegarLoopResult]: For program point L258-1(line 258) no Hoare annotation was computed. [2019-11-28 20:27:29,686 INFO L246 CegarLoopResult]: For program point L192(lines 192 598) no Hoare annotation was computed. [2019-11-28 20:27:29,687 INFO L246 CegarLoopResult]: For program point L159(lines 159 609) no Hoare annotation was computed. [2019-11-28 20:27:29,687 INFO L246 CegarLoopResult]: For program point L126(lines 126 620) no Hoare annotation was computed. [2019-11-28 20:27:29,687 INFO L249 CegarLoopResult]: At program point L688(lines 679 690) the Hoare annotation is: true [2019-11-28 20:27:29,687 INFO L246 CegarLoopResult]: For program point L325(lines 325 329) no Hoare annotation was computed. [2019-11-28 20:27:29,687 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 258) no Hoare annotation was computed. [2019-11-28 20:27:29,687 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 20:27:29,688 INFO L246 CegarLoopResult]: For program point L260(line 260) no Hoare annotation was computed. [2019-11-28 20:27:29,688 INFO L246 CegarLoopResult]: For program point L260-1(line 260) no Hoare annotation was computed. [2019-11-28 20:27:29,688 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 258) no Hoare annotation was computed. [2019-11-28 20:27:29,688 INFO L242 CegarLoopResult]: At program point L591(lines 99 659) the Hoare annotation is: (let ((.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse12 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse13 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384)) .cse7 .cse8 .cse9 .cse10) (and .cse2 .cse3 .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse6 .cse7 .cse0 .cse8 .cse11 .cse9 .cse10 .cse1) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse8 .cse11 .cse9 .cse10 .cse12 .cse13) (and .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse4 .cse7 .cse0 .cse8 .cse11 .cse9 .cse10 .cse12 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse0 .cse8 .cse11 .cse9 .cse10 .cse1 .cse13))) [2019-11-28 20:27:29,689 INFO L246 CegarLoopResult]: For program point L558(lines 558 562) no Hoare annotation was computed. [2019-11-28 20:27:29,689 INFO L246 CegarLoopResult]: For program point L426(lines 426 430) no Hoare annotation was computed. [2019-11-28 20:27:29,689 INFO L242 CegarLoopResult]: At program point L360(lines 342 378) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-28 20:27:29,689 INFO L246 CegarLoopResult]: For program point L195(lines 195 597) no Hoare annotation was computed. [2019-11-28 20:27:29,689 INFO L246 CegarLoopResult]: For program point L162(lines 162 608) no Hoare annotation was computed. [2019-11-28 20:27:29,690 INFO L246 CegarLoopResult]: For program point L129(lines 129 619) no Hoare annotation was computed. [2019-11-28 20:27:29,690 INFO L246 CegarLoopResult]: For program point L526(lines 526 530) no Hoare annotation was computed. [2019-11-28 20:27:29,690 INFO L246 CegarLoopResult]: For program point L460(lines 460 471) no Hoare annotation was computed. [2019-11-28 20:27:29,690 INFO L246 CegarLoopResult]: For program point L526-2(lines 209 590) no Hoare annotation was computed. [2019-11-28 20:27:29,690 INFO L242 CegarLoopResult]: At program point L394(lines 385 416) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-28 20:27:29,691 INFO L246 CegarLoopResult]: For program point L229(lines 229 240) no Hoare annotation was computed. [2019-11-28 20:27:29,691 INFO L242 CegarLoopResult]: At program point L196(lines 192 598) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)))) (or (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-28 20:27:29,691 INFO L242 CegarLoopResult]: At program point L163(lines 159 609) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-28 20:27:29,691 INFO L246 CegarLoopResult]: For program point L229-2(lines 229 240) no Hoare annotation was computed. [2019-11-28 20:27:29,691 INFO L246 CegarLoopResult]: For program point L362(lines 362 366) no Hoare annotation was computed. [2019-11-28 20:27:29,692 INFO L249 CegarLoopResult]: At program point L660(lines 98 661) the Hoare annotation is: true [2019-11-28 20:27:29,692 INFO L246 CegarLoopResult]: For program point L396(lines 396 402) no Hoare annotation was computed. [2019-11-28 20:27:29,692 INFO L246 CegarLoopResult]: For program point L231(lines 231 236) no Hoare annotation was computed. [2019-11-28 20:27:29,692 INFO L246 CegarLoopResult]: For program point L198(lines 198 596) no Hoare annotation was computed. [2019-11-28 20:27:29,692 INFO L246 CegarLoopResult]: For program point L165(lines 165 607) no Hoare annotation was computed. [2019-11-28 20:27:29,693 INFO L246 CegarLoopResult]: For program point L132(lines 132 618) no Hoare annotation was computed. [2019-11-28 20:27:29,693 INFO L242 CegarLoopResult]: At program point L99-2(lines 99 659) the Hoare annotation is: (let ((.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse12 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse13 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384)) .cse7 .cse8 .cse9 .cse10) (and .cse2 .cse3 .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse6 .cse7 .cse0 .cse8 .cse11 .cse9 .cse10 .cse1) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse8 .cse11 .cse9 .cse10 .cse12 .cse13) (and .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse4 .cse7 .cse0 .cse8 .cse11 .cse9 .cse10 .cse12 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse0 .cse8 .cse11 .cse9 .cse10 .cse1 .cse13))) [2019-11-28 20:27:29,693 INFO L242 CegarLoopResult]: At program point L166(lines 165 607) the Hoare annotation is: (let ((.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse16 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-28 20:27:29,694 INFO L242 CegarLoopResult]: At program point L133(lines 126 620) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-28 20:27:29,694 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-28 20:27:29,694 INFO L246 CegarLoopResult]: For program point L629(lines 629 657) no Hoare annotation was computed. [2019-11-28 20:27:29,694 INFO L246 CegarLoopResult]: For program point L464(lines 464 468) no Hoare annotation was computed. [2019-11-28 20:27:29,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:27:29 BoogieIcfgContainer [2019-11-28 20:27:29,731 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:27:29,732 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:27:29,732 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:27:29,732 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:27:29,733 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:27:09" (3/4) ... [2019-11-28 20:27:29,737 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 20:27:29,755 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-28 20:27:29,756 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 20:27:29,864 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:27:29,865 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:27:29,866 INFO L168 Benchmark]: Toolchain (without parser) took 22571.93 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 600.3 MB). Free memory was 955.0 MB in the beginning and 1.2 GB in the end (delta: -219.8 MB). Peak memory consumption was 380.5 MB. Max. memory is 11.5 GB. [2019-11-28 20:27:29,867 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:27:29,867 INFO L168 Benchmark]: CACSL2BoogieTranslator took 533.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -151.8 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-28 20:27:29,868 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:27:29,868 INFO L168 Benchmark]: Boogie Preprocessor took 74.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 20:27:29,869 INFO L168 Benchmark]: RCFGBuilder took 1058.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. [2019-11-28 20:27:29,870 INFO L168 Benchmark]: TraceAbstraction took 20678.94 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 482.9 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -144.6 MB). Peak memory consumption was 654.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:27:29,870 INFO L168 Benchmark]: Witness Printer took 133.12 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2019-11-28 20:27:29,873 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 533.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -151.8 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 78.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1058.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20678.94 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 482.9 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -144.6 MB). Peak memory consumption was 654.6 MB. Max. memory is 11.5 GB. * Witness Printer took 133.12 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 260]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 258]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 260]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 258]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) || ((((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: !(s__state == 12292) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) || (((((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && 8576 <= s__s3__tmp__next_state___0)) || (((((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8497)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && 8576 <= s__s3__tmp__next_state___0) && !(0 == s__hit)) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: ((((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) || ((((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: (((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((((((((!(s__state == 8673) && !(s__state == 8656)) && !(s__state == 8657)) && !(s__state == 8576)) && !(s__state == 16384)) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) || ((((((((!(s__state == 8673) && !(s__state == 8656)) && !(s__state == 8657)) && !(s__state == 16384)) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) && !(0 == s__hit)) - InvariantResult [Line: 385]: Loop Invariant Derived loop invariant: (((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: (((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: ((((((!(s__state == 8656) && !(s__state == 8657)) && !(s__state == 16384)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) && !(0 == s__hit)) || ((((((!(s__state == 8656) && !(s__state == 8576)) && !(s__state == 8657)) && !(s__state == 16384)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: (((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: (((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: ((8576 <= s__state && s__state <= 8640) && !(0 == s__hit)) || ((!(s__state == 8576) && 8576 <= s__state) && s__state <= 8640) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (((((((((((((!(s__state == 8528) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: ((8576 <= s__state && s__state <= 8640) && !(0 == s__hit)) || ((!(s__state == 8576) && 8576 <= s__state) && s__state <= 8640) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: !(s__state == 12292) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(s__state == 8657) && !(s__state == 8513)) && !(s__state == 24576)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 16384)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8195)) && !(s__state == 8480)) || (((((((((((!(s__state == 8561) && !(s__state == 8529)) && !(s__state == 8481)) && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8513)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(s__state == 8545))) || ((((((((((((!(s__state == 8513) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8497)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && 8576 <= s__s3__tmp__next_state___0) && !(0 == s__hit))) || (((((((((((!(s__state == 8561) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8497)) && !(s__state == 8513)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && 8576 <= s__s3__tmp__next_state___0) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8513)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(s__state == 8545)) && !(0 == s__hit)) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: 8576 <= s__state && s__state <= 8640 - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(s__state == 12292) - InvariantResult [Line: 679]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(s__state == 8657) && !(s__state == 8513)) && !(s__state == 24576)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 16384)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8195)) && !(s__state == 8480)) || (((((((((((!(s__state == 8561) && !(s__state == 8529)) && !(s__state == 8481)) && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8513)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(s__state == 8545))) || ((((((((((((!(s__state == 8513) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8497)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && 8576 <= s__s3__tmp__next_state___0) && !(0 == s__hit))) || (((((((((((!(s__state == 8561) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8497)) && !(s__state == 8513)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && 8576 <= s__s3__tmp__next_state___0) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8513)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(s__state == 8545)) && !(0 == s__hit)) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((((!(s__state == 8673) && !(s__state == 8576)) && !(s__state == 16384)) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) || ((((((!(s__state == 8673) && !(s__state == 16384)) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) && !(0 == s__hit)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 146 locations, 4 error locations. Result: SAFE, OverallTime: 11.4s, OverallIterations: 32, TraceHistogramMax: 14, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.0s, HoareTripleCheckerStatistics: 5368 SDtfs, 4720 SDslu, 2130 SDs, 0 SdLazy, 3171 SolverSat, 1069 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 964 GetRequests, 924 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1087occurred in iteration=31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 32 MinimizatonAttempts, 1658 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 206 NumberOfFragments, 1796 HoareAnnotationTreeSize, 29 FomulaSimplifications, 249232 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 29 FomulaSimplificationsInter, 93537 FormulaSimplificationTreeSizeReductionInter, 7.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 5109 NumberOfCodeBlocks, 5109 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 5073 ConstructedInterpolants, 0 QuantifiedInterpolants, 1687384 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1558 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 36 InterpolantComputations, 28 PerfectInterpolantSequences, 11171/11219 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...