./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/loop-invgen/apache-get-tag.i.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b57e964dbb610d8a39ef60225ec1dbb75ce4568 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 01:00:04,948 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 01:00:04,951 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 01:00:04,987 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 01:00:04,988 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 01:00:04,990 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 01:00:04,997 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 01:00:04,999 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 01:00:05,005 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 01:00:05,006 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 01:00:05,007 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 01:00:05,009 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 01:00:05,011 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 01:00:05,013 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 01:00:05,016 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 01:00:05,018 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 01:00:05,020 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 01:00:05,023 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 01:00:05,025 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 01:00:05,028 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 01:00:05,032 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 01:00:05,042 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 01:00:05,043 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 01:00:05,044 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 01:00:05,047 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 01:00:05,047 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 01:00:05,047 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 01:00:05,048 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 01:00:05,049 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 01:00:05,050 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 01:00:05,050 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 01:00:05,051 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 01:00:05,052 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 01:00:05,052 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 01:00:05,053 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 01:00:05,054 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 01:00:05,054 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 01:00:05,055 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 01:00:05,055 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 01:00:05,056 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 01:00:05,057 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 01:00:05,058 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 01:00:05,080 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 01:00:05,081 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 01:00:05,082 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 01:00:05,082 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 01:00:05,083 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 01:00:05,083 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 01:00:05,083 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 01:00:05,083 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 01:00:05,084 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 01:00:05,084 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 01:00:05,084 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 01:00:05,084 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 01:00:05,085 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 01:00:05,085 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 01:00:05,085 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 01:00:05,085 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 01:00:05,086 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 01:00:05,086 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 01:00:05,086 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 01:00:05,086 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 01:00:05,087 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 01:00:05,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 01:00:05,087 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 01:00:05,088 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 01:00:05,088 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 01:00:05,088 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 01:00:05,088 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 01:00:05,089 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 01:00:05,089 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 01:00:05,089 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 ! call(reach_error())) ) 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 -> 5b57e964dbb610d8a39ef60225ec1dbb75ce4568 [2020-10-20 01:00:05,278 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 01:00:05,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 01:00:05,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 01:00:05,296 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 01:00:05,297 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 01:00:05,298 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2020-10-20 01:00:05,375 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15c84db75/ed542384c0de4bc2bf1a018600eea88a/FLAG7ccb34d03 [2020-10-20 01:00:05,930 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 01:00:05,931 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2020-10-20 01:00:05,939 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15c84db75/ed542384c0de4bc2bf1a018600eea88a/FLAG7ccb34d03 [2020-10-20 01:00:06,281 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15c84db75/ed542384c0de4bc2bf1a018600eea88a [2020-10-20 01:00:06,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 01:00:06,292 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 01:00:06,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 01:00:06,294 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 01:00:06,297 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 01:00:06,298 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 01:00:06" (1/1) ... [2020-10-20 01:00:06,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d6fcca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:00:06, skipping insertion in model container [2020-10-20 01:00:06,302 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 01:00:06" (1/1) ... [2020-10-20 01:00:06,310 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 01:00:06,341 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 01:00:06,581 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 01:00:06,599 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 01:00:06,638 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 01:00:06,655 INFO L208 MainTranslator]: Completed translation [2020-10-20 01:00:06,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:00:06 WrapperNode [2020-10-20 01:00:06,656 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 01:00:06,657 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 01:00:06,657 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 01:00:06,657 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 01:00:06,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:00:06" (1/1) ... [2020-10-20 01:00:06,676 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:00:06" (1/1) ... [2020-10-20 01:00:06,710 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 01:00:06,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 01:00:06,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 01:00:06,711 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 01:00:06,722 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:00:06" (1/1) ... [2020-10-20 01:00:06,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:00:06" (1/1) ... [2020-10-20 01:00:06,725 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:00:06" (1/1) ... [2020-10-20 01:00:06,725 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:00:06" (1/1) ... [2020-10-20 01:00:06,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:00:06" (1/1) ... [2020-10-20 01:00:06,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:00:06" (1/1) ... [2020-10-20 01:00:06,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:00:06" (1/1) ... [2020-10-20 01:00:06,742 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 01:00:06,743 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 01:00:06,743 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 01:00:06,743 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 01:00:06,744 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:00:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 01:00:06,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 01:00:06,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 01:00:06,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 01:00:06,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 01:00:07,306 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 01:00:07,307 INFO L298 CfgBuilder]: Removed 40 assume(true) statements. [2020-10-20 01:00:07,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:00:07 BoogieIcfgContainer [2020-10-20 01:00:07,309 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 01:00:07,311 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 01:00:07,311 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 01:00:07,315 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 01:00:07,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 01:00:06" (1/3) ... [2020-10-20 01:00:07,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee97b0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 01:00:07, skipping insertion in model container [2020-10-20 01:00:07,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:00:06" (2/3) ... [2020-10-20 01:00:07,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee97b0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 01:00:07, skipping insertion in model container [2020-10-20 01:00:07,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:00:07" (3/3) ... [2020-10-20 01:00:07,319 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2020-10-20 01:00:07,331 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 01:00:07,339 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2020-10-20 01:00:07,351 INFO L253 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2020-10-20 01:00:07,372 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 01:00:07,373 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 01:00:07,373 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 01:00:07,373 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 01:00:07,373 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 01:00:07,374 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 01:00:07,374 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 01:00:07,374 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 01:00:07,394 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states. [2020-10-20 01:00:07,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-20 01:00:07,401 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:07,402 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:00:07,403 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:00:07,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:07,411 INFO L82 PathProgramCache]: Analyzing trace with hash 124587310, now seen corresponding path program 1 times [2020-10-20 01:00:07,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:07,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641361401] [2020-10-20 01:00:07,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:07,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:07,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:07,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641361401] [2020-10-20 01:00:07,696 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:07,697 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:00:07,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037174522] [2020-10-20 01:00:07,703 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:00:07,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:07,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:00:07,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:00:07,718 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 4 states. [2020-10-20 01:00:07,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:07,892 INFO L93 Difference]: Finished difference Result 141 states and 182 transitions. [2020-10-20 01:00:07,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:00:07,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-10-20 01:00:07,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:07,907 INFO L225 Difference]: With dead ends: 141 [2020-10-20 01:00:07,908 INFO L226 Difference]: Without dead ends: 107 [2020-10-20 01:00:07,911 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:00:07,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-20 01:00:07,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 69. [2020-10-20 01:00:07,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-10-20 01:00:07,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2020-10-20 01:00:07,959 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 8 [2020-10-20 01:00:07,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:07,959 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2020-10-20 01:00:07,959 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:00:07,960 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2020-10-20 01:00:07,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-20 01:00:07,960 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:07,960 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:00:07,961 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 01:00:07,961 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:00:07,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:07,962 INFO L82 PathProgramCache]: Analyzing trace with hash 120339118, now seen corresponding path program 1 times [2020-10-20 01:00:07,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:07,962 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521549565] [2020-10-20 01:00:07,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:08,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:08,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521549565] [2020-10-20 01:00:08,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:08,040 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:00:08,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287017108] [2020-10-20 01:00:08,044 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:00:08,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:08,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:00:08,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:00:08,046 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 4 states. [2020-10-20 01:00:08,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:08,168 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2020-10-20 01:00:08,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:00:08,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-10-20 01:00:08,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:08,171 INFO L225 Difference]: With dead ends: 107 [2020-10-20 01:00:08,171 INFO L226 Difference]: Without dead ends: 105 [2020-10-20 01:00:08,172 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:00:08,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-10-20 01:00:08,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 67. [2020-10-20 01:00:08,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-10-20 01:00:08,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2020-10-20 01:00:08,183 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 8 [2020-10-20 01:00:08,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:08,183 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2020-10-20 01:00:08,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:00:08,184 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2020-10-20 01:00:08,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-20 01:00:08,184 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:08,185 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:00:08,185 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 01:00:08,185 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:00:08,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:08,186 INFO L82 PathProgramCache]: Analyzing trace with hash 734727036, now seen corresponding path program 1 times [2020-10-20 01:00:08,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:08,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893511208] [2020-10-20 01:00:08,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:08,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:08,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893511208] [2020-10-20 01:00:08,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:08,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:00:08,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342075952] [2020-10-20 01:00:08,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:00:08,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:08,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:00:08,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:00:08,250 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2020-10-20 01:00:08,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:08,360 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2020-10-20 01:00:08,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:00:08,361 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-20 01:00:08,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:08,362 INFO L225 Difference]: With dead ends: 69 [2020-10-20 01:00:08,362 INFO L226 Difference]: Without dead ends: 67 [2020-10-20 01:00:08,363 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:00:08,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-10-20 01:00:08,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2020-10-20 01:00:08,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-10-20 01:00:08,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2020-10-20 01:00:08,380 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 11 [2020-10-20 01:00:08,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:08,381 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2020-10-20 01:00:08,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:00:08,381 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2020-10-20 01:00:08,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-20 01:00:08,382 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:08,382 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:00:08,382 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 01:00:08,382 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:00:08,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:08,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1269245293, now seen corresponding path program 1 times [2020-10-20 01:00:08,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:08,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623987040] [2020-10-20 01:00:08,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:08,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:08,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623987040] [2020-10-20 01:00:08,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:08,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:00:08,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793478364] [2020-10-20 01:00:08,456 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:00:08,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:08,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:00:08,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:00:08,457 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 5 states. [2020-10-20 01:00:08,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:08,567 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2020-10-20 01:00:08,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:00:08,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-20 01:00:08,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:08,568 INFO L225 Difference]: With dead ends: 67 [2020-10-20 01:00:08,568 INFO L226 Difference]: Without dead ends: 65 [2020-10-20 01:00:08,569 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:00:08,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-10-20 01:00:08,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2020-10-20 01:00:08,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-20 01:00:08,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2020-10-20 01:00:08,576 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 11 [2020-10-20 01:00:08,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:08,576 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2020-10-20 01:00:08,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:00:08,577 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2020-10-20 01:00:08,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-20 01:00:08,577 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:08,578 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:00:08,578 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 01:00:08,578 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:00:08,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:08,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1301707833, now seen corresponding path program 1 times [2020-10-20 01:00:08,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:08,579 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303559619] [2020-10-20 01:00:08,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:08,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:08,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303559619] [2020-10-20 01:00:08,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:08,637 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:00:08,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575717122] [2020-10-20 01:00:08,637 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:00:08,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:08,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:00:08,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:00:08,638 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 4 states. [2020-10-20 01:00:08,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:08,696 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2020-10-20 01:00:08,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:00:08,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-20 01:00:08,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:08,698 INFO L225 Difference]: With dead ends: 65 [2020-10-20 01:00:08,698 INFO L226 Difference]: Without dead ends: 61 [2020-10-20 01:00:08,698 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:00:08,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-10-20 01:00:08,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2020-10-20 01:00:08,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-20 01:00:08,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2020-10-20 01:00:08,705 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 12 [2020-10-20 01:00:08,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:08,705 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2020-10-20 01:00:08,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:00:08,706 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2020-10-20 01:00:08,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-20 01:00:08,706 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:08,706 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:00:08,707 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 01:00:08,707 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:00:08,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:08,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1302317555, now seen corresponding path program 1 times [2020-10-20 01:00:08,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:08,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159791824] [2020-10-20 01:00:08,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:08,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:08,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159791824] [2020-10-20 01:00:08,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:08,754 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:00:08,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992700082] [2020-10-20 01:00:08,755 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:00:08,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:08,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:00:08,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:00:08,756 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 5 states. [2020-10-20 01:00:08,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:08,893 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2020-10-20 01:00:08,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:00:08,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-20 01:00:08,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:08,895 INFO L225 Difference]: With dead ends: 95 [2020-10-20 01:00:08,895 INFO L226 Difference]: Without dead ends: 93 [2020-10-20 01:00:08,896 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:00:08,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-10-20 01:00:08,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 57. [2020-10-20 01:00:08,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-10-20 01:00:08,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2020-10-20 01:00:08,902 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 12 [2020-10-20 01:00:08,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:08,902 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2020-10-20 01:00:08,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:00:08,903 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2020-10-20 01:00:08,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-20 01:00:08,903 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:08,904 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:00:08,904 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 01:00:08,904 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:00:08,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:08,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1302337415, now seen corresponding path program 1 times [2020-10-20 01:00:08,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:08,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508275705] [2020-10-20 01:00:08,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:08,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:08,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508275705] [2020-10-20 01:00:08,951 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:08,951 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:00:08,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935821282] [2020-10-20 01:00:08,951 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:00:08,952 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:08,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:00:08,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:00:08,952 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 5 states. [2020-10-20 01:00:09,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:09,105 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2020-10-20 01:00:09,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:00:09,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-20 01:00:09,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:09,106 INFO L225 Difference]: With dead ends: 100 [2020-10-20 01:00:09,107 INFO L226 Difference]: Without dead ends: 98 [2020-10-20 01:00:09,107 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:00:09,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-10-20 01:00:09,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 55. [2020-10-20 01:00:09,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-10-20 01:00:09,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2020-10-20 01:00:09,113 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 12 [2020-10-20 01:00:09,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:09,113 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2020-10-20 01:00:09,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:00:09,114 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-10-20 01:00:09,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-20 01:00:09,114 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:09,114 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:00:09,115 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 01:00:09,115 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:00:09,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:09,115 INFO L82 PathProgramCache]: Analyzing trace with hash -691892359, now seen corresponding path program 1 times [2020-10-20 01:00:09,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:09,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719554939] [2020-10-20 01:00:09,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:09,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:09,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719554939] [2020-10-20 01:00:09,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:09,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:00:09,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054832650] [2020-10-20 01:00:09,154 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:00:09,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:09,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:00:09,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:00:09,154 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 4 states. [2020-10-20 01:00:09,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:09,207 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2020-10-20 01:00:09,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:00:09,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-20 01:00:09,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:09,209 INFO L225 Difference]: With dead ends: 57 [2020-10-20 01:00:09,209 INFO L226 Difference]: Without dead ends: 53 [2020-10-20 01:00:09,209 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:00:09,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-10-20 01:00:09,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2020-10-20 01:00:09,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-20 01:00:09,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2020-10-20 01:00:09,214 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 12 [2020-10-20 01:00:09,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:09,214 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2020-10-20 01:00:09,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:00:09,215 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2020-10-20 01:00:09,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-20 01:00:09,231 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:09,232 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:00:09,232 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 01:00:09,232 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:00:09,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:09,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1717144761, now seen corresponding path program 1 times [2020-10-20 01:00:09,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:09,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102029735] [2020-10-20 01:00:09,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:09,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:09,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102029735] [2020-10-20 01:00:09,352 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:09,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 01:00:09,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592617900] [2020-10-20 01:00:09,353 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 01:00:09,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:09,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 01:00:09,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:00:09,354 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 6 states. [2020-10-20 01:00:09,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:09,487 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2020-10-20 01:00:09,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 01:00:09,488 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-20 01:00:09,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:09,489 INFO L225 Difference]: With dead ends: 118 [2020-10-20 01:00:09,489 INFO L226 Difference]: Without dead ends: 116 [2020-10-20 01:00:09,490 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-20 01:00:09,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-10-20 01:00:09,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 56. [2020-10-20 01:00:09,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-10-20 01:00:09,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2020-10-20 01:00:09,500 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 13 [2020-10-20 01:00:09,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:09,500 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2020-10-20 01:00:09,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 01:00:09,500 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2020-10-20 01:00:09,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-20 01:00:09,501 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:09,501 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:00:09,501 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 01:00:09,502 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:00:09,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:09,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1717760441, now seen corresponding path program 1 times [2020-10-20 01:00:09,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:09,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502908846] [2020-10-20 01:00:09,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:09,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:09,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502908846] [2020-10-20 01:00:09,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:09,613 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 01:00:09,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887440247] [2020-10-20 01:00:09,614 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 01:00:09,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:09,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 01:00:09,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:00:09,615 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 6 states. [2020-10-20 01:00:09,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:09,788 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2020-10-20 01:00:09,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 01:00:09,788 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-20 01:00:09,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:09,790 INFO L225 Difference]: With dead ends: 116 [2020-10-20 01:00:09,790 INFO L226 Difference]: Without dead ends: 114 [2020-10-20 01:00:09,790 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-20 01:00:09,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-10-20 01:00:09,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 58. [2020-10-20 01:00:09,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-10-20 01:00:09,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2020-10-20 01:00:09,795 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 13 [2020-10-20 01:00:09,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:09,796 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2020-10-20 01:00:09,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 01:00:09,796 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2020-10-20 01:00:09,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-20 01:00:09,797 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:09,797 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:00:09,797 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-20 01:00:09,797 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:00:09,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:09,798 INFO L82 PathProgramCache]: Analyzing trace with hash 46983468, now seen corresponding path program 1 times [2020-10-20 01:00:09,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:09,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877621708] [2020-10-20 01:00:09,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:09,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:09,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:09,833 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877621708] [2020-10-20 01:00:09,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:09,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:00:09,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518145001] [2020-10-20 01:00:09,835 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:00:09,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:09,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:00:09,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:00:09,836 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 5 states. [2020-10-20 01:00:09,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:09,937 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2020-10-20 01:00:09,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:00:09,937 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-20 01:00:09,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:09,938 INFO L225 Difference]: With dead ends: 76 [2020-10-20 01:00:09,938 INFO L226 Difference]: Without dead ends: 74 [2020-10-20 01:00:09,939 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:00:09,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-10-20 01:00:09,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 56. [2020-10-20 01:00:09,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-10-20 01:00:09,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2020-10-20 01:00:09,943 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 13 [2020-10-20 01:00:09,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:09,944 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2020-10-20 01:00:09,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:00:09,944 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2020-10-20 01:00:09,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-20 01:00:09,944 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:09,945 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:00:09,945 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-20 01:00:09,945 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:00:09,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:09,945 INFO L82 PathProgramCache]: Analyzing trace with hash 49076780, now seen corresponding path program 1 times [2020-10-20 01:00:09,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:09,946 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478064446] [2020-10-20 01:00:09,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:10,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:10,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478064446] [2020-10-20 01:00:10,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:10,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:00:10,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89041396] [2020-10-20 01:00:10,009 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:00:10,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:10,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:00:10,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:00:10,010 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 5 states. [2020-10-20 01:00:10,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:10,081 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2020-10-20 01:00:10,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:00:10,082 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-20 01:00:10,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:10,083 INFO L225 Difference]: With dead ends: 57 [2020-10-20 01:00:10,083 INFO L226 Difference]: Without dead ends: 55 [2020-10-20 01:00:10,083 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:00:10,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-10-20 01:00:10,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2020-10-20 01:00:10,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-10-20 01:00:10,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2020-10-20 01:00:10,087 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 13 [2020-10-20 01:00:10,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:10,089 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2020-10-20 01:00:10,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:00:10,090 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2020-10-20 01:00:10,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-20 01:00:10,090 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:10,090 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:00:10,091 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-20 01:00:10,091 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:00:10,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:10,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1458404191, now seen corresponding path program 1 times [2020-10-20 01:00:10,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:10,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241630486] [2020-10-20 01:00:10,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:10,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:10,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:10,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241630486] [2020-10-20 01:00:10,144 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:10,144 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:00:10,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758027139] [2020-10-20 01:00:10,144 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:00:10,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:10,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:00:10,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:00:10,146 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 5 states. [2020-10-20 01:00:10,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:10,254 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2020-10-20 01:00:10,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:00:10,255 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-20 01:00:10,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:10,256 INFO L225 Difference]: With dead ends: 75 [2020-10-20 01:00:10,256 INFO L226 Difference]: Without dead ends: 73 [2020-10-20 01:00:10,256 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:00:10,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-10-20 01:00:10,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 52. [2020-10-20 01:00:10,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-10-20 01:00:10,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2020-10-20 01:00:10,267 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 14 [2020-10-20 01:00:10,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:10,268 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2020-10-20 01:00:10,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:00:10,269 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2020-10-20 01:00:10,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-20 01:00:10,271 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:10,271 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:00:10,272 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-20 01:00:10,273 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:00:10,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:10,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1456493596, now seen corresponding path program 1 times [2020-10-20 01:00:10,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:10,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816663462] [2020-10-20 01:00:10,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:10,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:10,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:10,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816663462] [2020-10-20 01:00:10,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:10,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 01:00:10,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462146564] [2020-10-20 01:00:10,410 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 01:00:10,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:10,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 01:00:10,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:00:10,411 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 6 states. [2020-10-20 01:00:10,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:10,532 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2020-10-20 01:00:10,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 01:00:10,532 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-20 01:00:10,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:10,535 INFO L225 Difference]: With dead ends: 86 [2020-10-20 01:00:10,535 INFO L226 Difference]: Without dead ends: 84 [2020-10-20 01:00:10,536 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-20 01:00:10,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-10-20 01:00:10,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 58. [2020-10-20 01:00:10,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-10-20 01:00:10,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2020-10-20 01:00:10,542 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 14 [2020-10-20 01:00:10,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:10,542 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2020-10-20 01:00:10,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 01:00:10,542 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2020-10-20 01:00:10,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-20 01:00:10,543 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:10,543 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:00:10,543 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-20 01:00:10,543 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:00:10,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:10,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1521386336, now seen corresponding path program 1 times [2020-10-20 01:00:10,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:10,544 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956252847] [2020-10-20 01:00:10,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:10,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:10,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:10,632 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956252847] [2020-10-20 01:00:10,633 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:10,633 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 01:00:10,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739613490] [2020-10-20 01:00:10,633 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 01:00:10,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:10,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 01:00:10,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:00:10,634 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand 6 states. [2020-10-20 01:00:10,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:10,783 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2020-10-20 01:00:10,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:00:10,784 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-20 01:00:10,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:10,784 INFO L225 Difference]: With dead ends: 70 [2020-10-20 01:00:10,784 INFO L226 Difference]: Without dead ends: 66 [2020-10-20 01:00:10,785 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-20 01:00:10,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-10-20 01:00:10,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 59. [2020-10-20 01:00:10,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-20 01:00:10,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2020-10-20 01:00:10,791 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 14 [2020-10-20 01:00:10,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:10,793 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2020-10-20 01:00:10,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 01:00:10,793 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2020-10-20 01:00:10,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-20 01:00:10,794 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:10,794 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:00:10,795 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-20 01:00:10,795 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:00:10,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:10,796 INFO L82 PathProgramCache]: Analyzing trace with hash -2034104204, now seen corresponding path program 1 times [2020-10-20 01:00:10,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:10,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182386655] [2020-10-20 01:00:10,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:10,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:10,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182386655] [2020-10-20 01:00:10,900 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:10,900 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 01:00:10,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423667093] [2020-10-20 01:00:10,901 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 01:00:10,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:10,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 01:00:10,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:00:10,902 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 6 states. [2020-10-20 01:00:11,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:11,026 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2020-10-20 01:00:11,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 01:00:11,026 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-20 01:00:11,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:11,027 INFO L225 Difference]: With dead ends: 87 [2020-10-20 01:00:11,027 INFO L226 Difference]: Without dead ends: 85 [2020-10-20 01:00:11,028 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-20 01:00:11,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-10-20 01:00:11,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 62. [2020-10-20 01:00:11,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-20 01:00:11,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2020-10-20 01:00:11,033 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 15 [2020-10-20 01:00:11,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:11,034 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2020-10-20 01:00:11,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 01:00:11,034 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2020-10-20 01:00:11,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 01:00:11,037 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:11,037 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:00:11,037 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-20 01:00:11,038 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:00:11,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:11,038 INFO L82 PathProgramCache]: Analyzing trace with hash -468803585, now seen corresponding path program 1 times [2020-10-20 01:00:11,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:11,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254215341] [2020-10-20 01:00:11,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:11,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:11,079 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254215341] [2020-10-20 01:00:11,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:11,079 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:00:11,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303342131] [2020-10-20 01:00:11,080 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:00:11,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:11,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:00:11,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:00:11,081 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand 4 states. [2020-10-20 01:00:11,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:11,119 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2020-10-20 01:00:11,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:00:11,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-20 01:00:11,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:11,120 INFO L225 Difference]: With dead ends: 62 [2020-10-20 01:00:11,120 INFO L226 Difference]: Without dead ends: 60 [2020-10-20 01:00:11,120 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:00:11,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-10-20 01:00:11,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-10-20 01:00:11,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-10-20 01:00:11,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2020-10-20 01:00:11,128 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 16 [2020-10-20 01:00:11,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:11,130 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2020-10-20 01:00:11,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:00:11,130 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2020-10-20 01:00:11,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-20 01:00:11,130 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:11,130 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:00:11,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-20 01:00:11,131 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:00:11,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:11,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1648003138, now seen corresponding path program 1 times [2020-10-20 01:00:11,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:11,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340068270] [2020-10-20 01:00:11,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:11,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:11,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:11,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340068270] [2020-10-20 01:00:11,179 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:11,179 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:00:11,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015930344] [2020-10-20 01:00:11,179 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:00:11,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:11,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:00:11,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:00:11,181 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand 4 states. [2020-10-20 01:00:11,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:11,232 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2020-10-20 01:00:11,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:00:11,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-20 01:00:11,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:11,233 INFO L225 Difference]: With dead ends: 60 [2020-10-20 01:00:11,233 INFO L226 Difference]: Without dead ends: 56 [2020-10-20 01:00:11,234 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:00:11,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-10-20 01:00:11,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-10-20 01:00:11,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-10-20 01:00:11,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2020-10-20 01:00:11,238 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 17 [2020-10-20 01:00:11,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:11,239 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2020-10-20 01:00:11,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:00:11,239 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2020-10-20 01:00:11,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-20 01:00:11,239 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:11,240 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:00:11,240 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-20 01:00:11,240 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:00:11,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:11,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1509691888, now seen corresponding path program 1 times [2020-10-20 01:00:11,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:11,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655878376] [2020-10-20 01:00:11,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:11,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:11,290 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:11,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655878376] [2020-10-20 01:00:11,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619202100] [2020-10-20 01:00:11,291 INFO L95 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 [2020-10-20 01:00:11,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:11,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 01:00:11,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:00:11,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 01:00:11,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 01:00:11,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:11,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:00:11,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2020-10-20 01:00:11,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683558461] [2020-10-20 01:00:11,557 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-20 01:00:11,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:11,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-20 01:00:11,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-10-20 01:00:11,557 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 13 states. [2020-10-20 01:00:11,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:11,842 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2020-10-20 01:00:11,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-20 01:00:11,843 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2020-10-20 01:00:11,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:11,844 INFO L225 Difference]: With dead ends: 121 [2020-10-20 01:00:11,844 INFO L226 Difference]: Without dead ends: 119 [2020-10-20 01:00:11,844 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2020-10-20 01:00:11,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-10-20 01:00:11,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 52. [2020-10-20 01:00:11,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-10-20 01:00:11,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2020-10-20 01:00:11,850 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 18 [2020-10-20 01:00:11,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:11,851 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2020-10-20 01:00:11,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-20 01:00:11,851 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2020-10-20 01:00:11,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-20 01:00:11,851 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:11,852 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:00:12,064 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:00:12,065 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:00:12,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:12,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1509076208, now seen corresponding path program 1 times [2020-10-20 01:00:12,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:12,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110213838] [2020-10-20 01:00:12,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:12,120 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:12,121 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110213838] [2020-10-20 01:00:12,121 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125174700] [2020-10-20 01:00:12,121 INFO L95 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 [2020-10-20 01:00:12,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:12,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 01:00:12,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:00:12,291 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 01:00:12,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 01:00:12,318 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:12,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:00:12,319 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2020-10-20 01:00:12,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678358638] [2020-10-20 01:00:12,324 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-20 01:00:12,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:12,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-20 01:00:12,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-10-20 01:00:12,325 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 13 states. [2020-10-20 01:00:12,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:12,605 INFO L93 Difference]: Finished difference Result 100 states and 113 transitions. [2020-10-20 01:00:12,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-20 01:00:12,605 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2020-10-20 01:00:12,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:12,606 INFO L225 Difference]: With dead ends: 100 [2020-10-20 01:00:12,606 INFO L226 Difference]: Without dead ends: 98 [2020-10-20 01:00:12,607 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2020-10-20 01:00:12,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-10-20 01:00:12,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 45. [2020-10-20 01:00:12,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-20 01:00:12,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2020-10-20 01:00:12,613 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 18 [2020-10-20 01:00:12,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:12,613 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2020-10-20 01:00:12,614 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-20 01:00:12,614 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2020-10-20 01:00:12,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-20 01:00:12,614 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:12,615 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:00:12,815 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:00:12,815 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:00:12,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:12,816 INFO L82 PathProgramCache]: Analyzing trace with hash 470387004, now seen corresponding path program 1 times [2020-10-20 01:00:12,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:12,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378348300] [2020-10-20 01:00:12,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:12,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:12,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:12,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378348300] [2020-10-20 01:00:12,902 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:12,902 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 01:00:12,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558588734] [2020-10-20 01:00:12,903 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 01:00:12,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:12,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 01:00:12,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:00:12,903 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 6 states. [2020-10-20 01:00:13,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:13,006 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2020-10-20 01:00:13,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:00:13,006 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-20 01:00:13,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:13,007 INFO L225 Difference]: With dead ends: 60 [2020-10-20 01:00:13,007 INFO L226 Difference]: Without dead ends: 58 [2020-10-20 01:00:13,008 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-20 01:00:13,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-10-20 01:00:13,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 40. [2020-10-20 01:00:13,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-10-20 01:00:13,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2020-10-20 01:00:13,016 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 18 [2020-10-20 01:00:13,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:13,016 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2020-10-20 01:00:13,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 01:00:13,016 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2020-10-20 01:00:13,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-20 01:00:13,017 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:13,017 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:00:13,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-20 01:00:13,017 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:00:13,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:13,018 INFO L82 PathProgramCache]: Analyzing trace with hash -543024337, now seen corresponding path program 1 times [2020-10-20 01:00:13,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:13,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899072911] [2020-10-20 01:00:13,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:13,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:13,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899072911] [2020-10-20 01:00:13,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:13,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-20 01:00:13,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416671606] [2020-10-20 01:00:13,110 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 01:00:13,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:13,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 01:00:13,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-20 01:00:13,110 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 7 states. [2020-10-20 01:00:13,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:13,204 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2020-10-20 01:00:13,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:00:13,206 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-20 01:00:13,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:13,207 INFO L225 Difference]: With dead ends: 52 [2020-10-20 01:00:13,207 INFO L226 Difference]: Without dead ends: 50 [2020-10-20 01:00:13,207 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-20 01:00:13,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-10-20 01:00:13,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2020-10-20 01:00:13,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-20 01:00:13,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2020-10-20 01:00:13,213 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 19 [2020-10-20 01:00:13,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:13,214 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2020-10-20 01:00:13,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 01:00:13,214 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2020-10-20 01:00:13,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-20 01:00:13,215 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:13,215 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:00:13,215 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-20 01:00:13,215 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:00:13,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:13,216 INFO L82 PathProgramCache]: Analyzing trace with hash -478131597, now seen corresponding path program 1 times [2020-10-20 01:00:13,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:13,218 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450660806] [2020-10-20 01:00:13,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:13,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:13,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:13,304 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450660806] [2020-10-20 01:00:13,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:13,305 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-20 01:00:13,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190790493] [2020-10-20 01:00:13,305 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 01:00:13,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:13,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 01:00:13,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-20 01:00:13,306 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 7 states. [2020-10-20 01:00:13,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:13,380 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2020-10-20 01:00:13,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:00:13,380 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-20 01:00:13,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:13,380 INFO L225 Difference]: With dead ends: 35 [2020-10-20 01:00:13,380 INFO L226 Difference]: Without dead ends: 0 [2020-10-20 01:00:13,381 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-20 01:00:13,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-20 01:00:13,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-20 01:00:13,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-20 01:00:13,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-20 01:00:13,382 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2020-10-20 01:00:13,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:13,382 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 01:00:13,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 01:00:13,383 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-20 01:00:13,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-20 01:00:13,385 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-20 01:00:13,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-20 01:00:13,688 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2020-10-20 01:00:13,918 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 24 [2020-10-20 01:00:14,488 WARN L193 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 39 [2020-10-20 01:00:14,492 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,492 INFO L274 CegarLoopResult]: For program point L234(lines 234 242) no Hoare annotation was computed. [2020-10-20 01:00:14,492 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,492 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-10-20 01:00:14,492 INFO L274 CegarLoopResult]: For program point L152(lines 152 160) no Hoare annotation was computed. [2020-10-20 01:00:14,492 INFO L274 CegarLoopResult]: For program point L20(lines 20 401) no Hoare annotation was computed. [2020-10-20 01:00:14,493 INFO L277 CegarLoopResult]: At program point L400(lines 15 402) the Hoare annotation is: true [2020-10-20 01:00:14,493 INFO L274 CegarLoopResult]: For program point L70(lines 70 94) no Hoare annotation was computed. [2020-10-20 01:00:14,493 INFO L274 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,493 INFO L274 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,493 INFO L274 CegarLoopResult]: For program point L4-2(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,493 INFO L274 CegarLoopResult]: For program point L4-3(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,493 INFO L274 CegarLoopResult]: For program point L4-4(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,494 INFO L270 CegarLoopResult]: At program point L384(lines 282 391) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_main_~main__t~0 0))) (let ((.cse0 (let ((.cse2 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~13 0)))) (or (and .cse2 .cse1) (and .cse2 (<= 1 ULTIMATE.start_main_~main__t~0)))))) (or (and .cse0 (< 0 ULTIMATE.start_main_~main__tagbuf_len~0) .cse1) (and (< ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~19) .cse0 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~18 0)))))) [2020-10-20 01:00:14,494 INFO L274 CegarLoopResult]: For program point L4-5(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,494 INFO L270 CegarLoopResult]: At program point L351(lines 32 395) the Hoare annotation is: (let ((.cse4 (<= ULTIMATE.start_main_~main__t~0 1)) (.cse3 (= ULTIMATE.start_main_~main__t~0 0))) (let ((.cse0 (< ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0)) (.cse1 (<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~17)) (.cse2 (let ((.cse5 (let ((.cse6 (let ((.cse7 (or (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~13 0)) (and (<= 0 ULTIMATE.start_main_~main__tagbuf_len~0) .cse3)))) (or (and .cse7 .cse3) (and .cse7 (<= 1 ULTIMATE.start_main_~main__t~0)))))) (or (and .cse6 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~16 0))) (and .cse6 .cse3))))) (or (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~19 0)) .cse5) (and .cse4 .cse5))))) (or (and .cse0 (<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~19) .cse1 .cse2) (and (< 0 ULTIMATE.start_main_~main__tagbuf_len~0) .cse3) (and .cse0 .cse4 .cse1 .cse2)))) [2020-10-20 01:00:14,494 INFO L274 CegarLoopResult]: For program point L4-6(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,494 INFO L274 CegarLoopResult]: For program point L4-7(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,494 INFO L274 CegarLoopResult]: For program point L4-8(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,495 INFO L274 CegarLoopResult]: For program point L4-9(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,495 INFO L274 CegarLoopResult]: For program point L4-10(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,495 INFO L274 CegarLoopResult]: For program point L186(lines 186 196) no Hoare annotation was computed. [2020-10-20 01:00:14,497 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,498 INFO L274 CegarLoopResult]: For program point L4-11(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,498 INFO L274 CegarLoopResult]: For program point L4-12(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,498 INFO L274 CegarLoopResult]: For program point L4-13(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,498 INFO L274 CegarLoopResult]: For program point L4-14(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,498 INFO L274 CegarLoopResult]: For program point L4-15(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,498 INFO L274 CegarLoopResult]: For program point L4-16(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,499 INFO L274 CegarLoopResult]: For program point L4-17(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,499 INFO L274 CegarLoopResult]: For program point L4-18(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,499 INFO L274 CegarLoopResult]: For program point L4-19(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,499 INFO L274 CegarLoopResult]: For program point L4-20(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,499 INFO L274 CegarLoopResult]: For program point L4-21(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,500 INFO L274 CegarLoopResult]: For program point L4-22(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,500 INFO L274 CegarLoopResult]: For program point L4-23(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,500 INFO L274 CegarLoopResult]: For program point L4-24(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,500 INFO L274 CegarLoopResult]: For program point L4-25(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,500 INFO L274 CegarLoopResult]: For program point L4-26(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,500 INFO L274 CegarLoopResult]: For program point L4-27(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,501 INFO L274 CegarLoopResult]: For program point L4-28(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,501 INFO L274 CegarLoopResult]: For program point L4-29(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,501 INFO L274 CegarLoopResult]: For program point L4-30(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,501 INFO L274 CegarLoopResult]: For program point L4-31(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,501 INFO L274 CegarLoopResult]: For program point L4-32(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,501 INFO L274 CegarLoopResult]: For program point L4-33(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,502 INFO L274 CegarLoopResult]: For program point L4-34(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,502 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,502 INFO L274 CegarLoopResult]: For program point L4-35(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,502 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,502 INFO L274 CegarLoopResult]: For program point L105(lines 105 209) no Hoare annotation was computed. [2020-10-20 01:00:14,503 INFO L274 CegarLoopResult]: For program point L39(lines 39 255) no Hoare annotation was computed. [2020-10-20 01:00:14,503 INFO L274 CegarLoopResult]: For program point L288(lines 288 390) no Hoare annotation was computed. [2020-10-20 01:00:14,503 INFO L274 CegarLoopResult]: For program point L222(lines 222 244) no Hoare annotation was computed. [2020-10-20 01:00:14,503 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,503 INFO L274 CegarLoopResult]: For program point L24(lines 24 396) no Hoare annotation was computed. [2020-10-20 01:00:14,503 INFO L274 CegarLoopResult]: For program point L140(lines 140 162) no Hoare annotation was computed. [2020-10-20 01:00:14,504 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-10-20 01:00:14,504 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,504 INFO L274 CegarLoopResult]: For program point L124(lines 124 201) no Hoare annotation was computed. [2020-10-20 01:00:14,504 INFO L274 CegarLoopResult]: For program point L174(lines 174 198) no Hoare annotation was computed. [2020-10-20 01:00:14,504 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,505 INFO L274 CegarLoopResult]: For program point L307(lines 307 315) no Hoare annotation was computed. [2020-10-20 01:00:14,505 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,505 INFO L274 CegarLoopResult]: For program point L324(lines 324 389) no Hoare annotation was computed. [2020-10-20 01:00:14,505 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,505 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,505 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-10-20 01:00:14,506 INFO L274 CegarLoopResult]: For program point L276(lines 276 391) no Hoare annotation was computed. [2020-10-20 01:00:14,506 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,506 INFO L274 CegarLoopResult]: For program point L376(lines 376 385) no Hoare annotation was computed. [2020-10-20 01:00:14,506 INFO L274 CegarLoopResult]: For program point L343(lines 343 352) no Hoare annotation was computed. [2020-10-20 01:00:14,506 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,507 INFO L274 CegarLoopResult]: For program point L112(lines 112 203) no Hoare annotation was computed. [2020-10-20 01:00:14,507 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,507 INFO L270 CegarLoopResult]: At program point L195(lines 56 253) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~main__t~0) (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0)) [2020-10-20 01:00:14,507 INFO L274 CegarLoopResult]: For program point L295(lines 295 317) no Hoare annotation was computed. [2020-10-20 01:00:14,507 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,508 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,508 INFO L274 CegarLoopResult]: For program point L32(lines 32 395) no Hoare annotation was computed. [2020-10-20 01:00:14,508 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-10-20 01:00:14,508 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,508 INFO L274 CegarLoopResult]: For program point L82(lines 82 92) no Hoare annotation was computed. [2020-10-20 01:00:14,509 INFO L277 CegarLoopResult]: At program point L314(lines 32 395) the Hoare annotation is: true [2020-10-20 01:00:14,509 INFO L274 CegarLoopResult]: For program point L215(lines 215 250) no Hoare annotation was computed. [2020-10-20 01:00:14,509 INFO L274 CegarLoopResult]: For program point L50(lines 50 253) no Hoare annotation was computed. [2020-10-20 01:00:14,509 INFO L274 CegarLoopResult]: For program point L364(lines 364 387) no Hoare annotation was computed. [2020-10-20 01:00:14,509 INFO L274 CegarLoopResult]: For program point L331(lines 331 354) no Hoare annotation was computed. [2020-10-20 01:00:14,509 INFO L274 CegarLoopResult]: For program point L265(lines 265 393) no Hoare annotation was computed. [2020-10-20 01:00:14,510 INFO L274 CegarLoopResult]: For program point L133(lines 133 200) no Hoare annotation was computed. [2020-10-20 01:00:14,510 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:14,510 INFO L270 CegarLoopResult]: At program point L249(lines 101 251) the Hoare annotation is: (and (< ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 1 ULTIMATE.start_main_~main__t~0)) [2020-10-20 01:00:14,510 INFO L274 CegarLoopResult]: For program point L101(lines 101 251) no Hoare annotation was computed. [2020-10-20 01:00:14,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 01:00:14 BoogieIcfgContainer [2020-10-20 01:00:14,537 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 01:00:14,538 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 01:00:14,538 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 01:00:14,538 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 01:00:14,539 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:00:07" (3/4) ... [2020-10-20 01:00:14,546 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-20 01:00:14,564 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-10-20 01:00:14,565 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-10-20 01:00:14,565 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-20 01:00:14,566 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-20 01:00:14,662 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 01:00:14,663 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 01:00:14,664 INFO L168 Benchmark]: Toolchain (without parser) took 8378.02 ms. Allocated memory was 42.5 MB in the beginning and 83.4 MB in the end (delta: 40.9 MB). Free memory was 20.8 MB in the beginning and 62.9 MB in the end (delta: -42.1 MB). Peak memory consumption was 53.6 MB. Max. memory is 14.3 GB. [2020-10-20 01:00:14,665 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 31.5 MB. Free memory was 7.7 MB in the beginning and 7.7 MB in the end (delta: 45.7 kB). Peak memory consumption was 45.7 kB. Max. memory is 14.3 GB. [2020-10-20 01:00:14,666 INFO L168 Benchmark]: CACSL2BoogieTranslator took 362.89 ms. Allocated memory was 42.5 MB in the beginning and 43.0 MB in the end (delta: 524.3 kB). Free memory was 20.0 MB in the beginning and 18.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 10.4 MB. Max. memory is 14.3 GB. [2020-10-20 01:00:14,666 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.37 ms. Allocated memory is still 43.0 MB. Free memory was 18.3 MB in the beginning and 15.9 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 14.3 GB. [2020-10-20 01:00:14,666 INFO L168 Benchmark]: Boogie Preprocessor took 31.95 ms. Allocated memory is still 43.0 MB. Free memory was 15.9 MB in the beginning and 14.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.3 GB. [2020-10-20 01:00:14,667 INFO L168 Benchmark]: RCFGBuilder took 566.82 ms. Allocated memory was 43.0 MB in the beginning and 45.1 MB in the end (delta: 2.1 MB). Free memory was 14.1 MB in the beginning and 21.1 MB in the end (delta: -7.0 MB). Peak memory consumption was 5.9 MB. Max. memory is 14.3 GB. [2020-10-20 01:00:14,668 INFO L168 Benchmark]: TraceAbstraction took 7226.62 ms. Allocated memory was 45.1 MB in the beginning and 82.8 MB in the end (delta: 37.7 MB). Free memory was 20.6 MB in the beginning and 15.6 MB in the end (delta: 5.0 MB). Peak memory consumption was 47.1 MB. Max. memory is 14.3 GB. [2020-10-20 01:00:14,668 INFO L168 Benchmark]: Witness Printer took 125.22 ms. Allocated memory was 82.8 MB in the beginning and 83.4 MB in the end (delta: 524.3 kB). Free memory was 15.6 MB in the beginning and 62.9 MB in the end (delta: -47.3 MB). Peak memory consumption was 8.1 MB. Max. memory is 14.3 GB. [2020-10-20 01:00:14,671 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 31.5 MB. Free memory was 7.7 MB in the beginning and 7.7 MB in the end (delta: 45.7 kB). Peak memory consumption was 45.7 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 362.89 ms. Allocated memory was 42.5 MB in the beginning and 43.0 MB in the end (delta: 524.3 kB). Free memory was 20.0 MB in the beginning and 18.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 10.4 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 53.37 ms. Allocated memory is still 43.0 MB. Free memory was 18.3 MB in the beginning and 15.9 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 31.95 ms. Allocated memory is still 43.0 MB. Free memory was 15.9 MB in the beginning and 14.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.3 GB. * RCFGBuilder took 566.82 ms. Allocated memory was 43.0 MB in the beginning and 45.1 MB in the end (delta: 2.1 MB). Free memory was 14.1 MB in the beginning and 21.1 MB in the end (delta: -7.0 MB). Peak memory consumption was 5.9 MB. Max. memory is 14.3 GB. * TraceAbstraction took 7226.62 ms. Allocated memory was 45.1 MB in the beginning and 82.8 MB in the end (delta: 37.7 MB). Free memory was 20.6 MB in the beginning and 15.6 MB in the end (delta: 5.0 MB). Peak memory consumption was 47.1 MB. Max. memory is 14.3 GB. * Witness Printer took 125.22 ms. Allocated memory was 82.8 MB in the beginning and 83.4 MB in the end (delta: 524.3 kB). Free memory was 15.6 MB in the beginning and 62.9 MB in the end (delta: -47.3 MB). Peak memory consumption was 8.1 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 282]: Loop Invariant Derived loop invariant: ((((!(__VERIFIER_assert__cond == 0) && main__t == 0) || (!(__VERIFIER_assert__cond == 0) && 1 <= main__t)) && 0 < main__tagbuf_len) && main__t == 0) || (((main__t < main__tagbuf_len && 1 <= __VERIFIER_assert__cond) && ((!(__VERIFIER_assert__cond == 0) && main__t == 0) || (!(__VERIFIER_assert__cond == 0) && 1 <= main__t))) && !(__VERIFIER_assert__cond == 0)) - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: 1 <= main__t && main__t <= main__tagbuf_len - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: main__t < main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((main__t < main__tagbuf_len && 1 <= __VERIFIER_assert__cond) && 1 <= __VERIFIER_assert__cond) && ((!(__VERIFIER_assert__cond == 0) && (((((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && main__t == 0) || ((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && 1 <= main__t)) && !(__VERIFIER_assert__cond == 0)) || ((((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && main__t == 0) || ((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && 1 <= main__t)) && main__t == 0))) || (main__t <= 1 && (((((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && main__t == 0) || ((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && 1 <= main__t)) && !(__VERIFIER_assert__cond == 0)) || ((((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && main__t == 0) || ((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && 1 <= main__t)) && main__t == 0))))) || (0 < main__tagbuf_len && main__t == 0)) || (((main__t < main__tagbuf_len && main__t <= 1) && 1 <= __VERIFIER_assert__cond) && ((!(__VERIFIER_assert__cond == 0) && (((((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && main__t == 0) || ((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && 1 <= main__t)) && !(__VERIFIER_assert__cond == 0)) || ((((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && main__t == 0) || ((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && 1 <= main__t)) && main__t == 0))) || (main__t <= 1 && (((((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && main__t == 0) || ((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && 1 <= main__t)) && !(__VERIFIER_assert__cond == 0)) || ((((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && main__t == 0) || ((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && 1 <= main__t)) && main__t == 0))))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 93 locations, 18 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 6.0s, OverallIterations: 23, TraceHistogramMax: 2, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1024 SDtfs, 1889 SDslu, 1684 SDs, 0 SdLazy, 1955 SolverSat, 234 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 528 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 12 NumberOfFragments, 421 HoareAnnotationTreeSize, 6 FomulaSimplifications, 19040212 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 6 FomulaSimplificationsInter, 5049989 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 356 NumberOfCodeBlocks, 356 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 331 ConstructedInterpolants, 0 QuantifiedInterpolants, 17743 SizeOfPredicates, 8 NumberOfNonLiveVariables, 233 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 25 InterpolantComputations, 21 PerfectInterpolantSequences, 4/16 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...