./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-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+nlh-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 ef15c4790969d8e640b2241771e44174daa41407 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:06,188 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 01:00:06,191 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 01:00:06,231 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 01:00:06,231 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 01:00:06,241 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 01:00:06,244 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 01:00:06,247 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 01:00:06,249 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 01:00:06,253 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 01:00:06,255 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 01:00:06,256 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 01:00:06,256 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 01:00:06,259 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 01:00:06,260 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 01:00:06,262 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 01:00:06,263 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 01:00:06,264 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 01:00:06,266 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 01:00:06,273 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 01:00:06,280 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 01:00:06,281 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 01:00:06,283 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 01:00:06,283 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 01:00:06,295 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 01:00:06,295 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 01:00:06,295 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 01:00:06,296 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 01:00:06,297 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 01:00:06,297 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 01:00:06,298 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 01:00:06,303 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 01:00:06,304 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 01:00:06,305 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 01:00:06,306 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 01:00:06,306 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 01:00:06,306 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 01:00:06,306 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 01:00:06,307 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 01:00:06,307 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 01:00:06,313 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 01:00:06,315 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:06,350 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 01:00:06,351 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 01:00:06,352 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 01:00:06,352 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 01:00:06,352 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 01:00:06,352 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 01:00:06,353 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 01:00:06,353 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 01:00:06,353 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 01:00:06,353 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 01:00:06,354 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 01:00:06,354 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 01:00:06,355 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 01:00:06,355 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 01:00:06,355 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 01:00:06,355 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 01:00:06,356 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 01:00:06,356 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 01:00:06,356 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 01:00:06,356 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 01:00:06,357 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 01:00:06,357 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 01:00:06,357 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 01:00:06,357 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 01:00:06,357 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 01:00:06,357 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 01:00:06,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 01:00:06,358 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 01:00:06,358 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 01:00:06,358 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 -> ef15c4790969d8e640b2241771e44174daa41407 [2020-10-20 01:00:06,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 01:00:06,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 01:00:06,609 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 01:00:06,613 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 01:00:06,619 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 01:00:06,620 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+nlh-reducer.c [2020-10-20 01:00:06,701 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1483fdcf4/aaaf69bea2354576ace5e1378bf69266/FLAG664dc0bfd [2020-10-20 01:00:07,260 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 01:00:07,261 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2020-10-20 01:00:07,270 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1483fdcf4/aaaf69bea2354576ace5e1378bf69266/FLAG664dc0bfd [2020-10-20 01:00:07,683 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1483fdcf4/aaaf69bea2354576ace5e1378bf69266 [2020-10-20 01:00:07,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 01:00:07,692 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 01:00:07,693 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 01:00:07,693 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 01:00:07,697 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 01:00:07,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 01:00:07" (1/1) ... [2020-10-20 01:00:07,701 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@784d15e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:00:07, skipping insertion in model container [2020-10-20 01:00:07,701 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 01:00:07" (1/1) ... [2020-10-20 01:00:07,709 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 01:00:07,738 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 01:00:08,044 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 01:00:08,073 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 01:00:08,135 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 01:00:08,153 INFO L208 MainTranslator]: Completed translation [2020-10-20 01:00:08,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:00:08 WrapperNode [2020-10-20 01:00:08,154 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 01:00:08,155 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 01:00:08,155 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 01:00:08,155 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 01:00:08,164 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:08" (1/1) ... [2020-10-20 01:00:08,174 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:08" (1/1) ... [2020-10-20 01:00:08,204 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 01:00:08,205 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 01:00:08,205 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 01:00:08,205 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 01:00:08,214 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:08" (1/1) ... [2020-10-20 01:00:08,214 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:08" (1/1) ... [2020-10-20 01:00:08,217 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:08" (1/1) ... [2020-10-20 01:00:08,217 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:08" (1/1) ... [2020-10-20 01:00:08,223 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:08" (1/1) ... [2020-10-20 01:00:08,227 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:08" (1/1) ... [2020-10-20 01:00:08,229 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:08" (1/1) ... [2020-10-20 01:00:08,233 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 01:00:08,233 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 01:00:08,234 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 01:00:08,234 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 01:00:08,235 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:00:08" (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:08,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 01:00:08,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 01:00:08,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 01:00:08,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 01:00:08,752 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 01:00:08,752 INFO L298 CfgBuilder]: Removed 38 assume(true) statements. [2020-10-20 01:00:08,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:00:08 BoogieIcfgContainer [2020-10-20 01:00:08,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 01:00:08,757 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 01:00:08,757 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 01:00:08,761 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 01:00:08,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 01:00:07" (1/3) ... [2020-10-20 01:00:08,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a0ef1bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 01:00:08, skipping insertion in model container [2020-10-20 01:00:08,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:00:08" (2/3) ... [2020-10-20 01:00:08,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a0ef1bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 01:00:08, skipping insertion in model container [2020-10-20 01:00:08,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:00:08" (3/3) ... [2020-10-20 01:00:08,766 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2020-10-20 01:00:08,780 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 01:00:08,788 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2020-10-20 01:00:08,803 INFO L253 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2020-10-20 01:00:08,831 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 01:00:08,832 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 01:00:08,832 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 01:00:08,832 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 01:00:08,833 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 01:00:08,833 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 01:00:08,833 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 01:00:08,834 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 01:00:08,878 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2020-10-20 01:00:08,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-20 01:00:08,884 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:08,885 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:00:08,893 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.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,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:08,898 INFO L82 PathProgramCache]: Analyzing trace with hash 124710446, now seen corresponding path program 1 times [2020-10-20 01:00:08,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:08,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406192524] [2020-10-20 01:00:08,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:09,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:09,123 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,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406192524] [2020-10-20 01:00:09,125 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:09,125 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:00:09,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017604923] [2020-10-20 01:00:09,136 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:00:09,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:09,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:00:09,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:00:09,159 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 4 states. [2020-10-20 01:00:09,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:09,330 INFO L93 Difference]: Finished difference Result 142 states and 183 transitions. [2020-10-20 01:00:09,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:00:09,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-10-20 01:00:09,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:09,346 INFO L225 Difference]: With dead ends: 142 [2020-10-20 01:00:09,346 INFO L226 Difference]: Without dead ends: 109 [2020-10-20 01:00:09,350 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,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-10-20 01:00:09,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 65. [2020-10-20 01:00:09,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-10-20 01:00:09,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2020-10-20 01:00:09,396 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 8 [2020-10-20 01:00:09,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:09,396 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2020-10-20 01:00:09,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:00:09,397 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2020-10-20 01:00:09,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-20 01:00:09,398 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:09,398 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:00:09,398 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 01:00:09,399 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.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,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:09,400 INFO L82 PathProgramCache]: Analyzing trace with hash 120336139, now seen corresponding path program 1 times [2020-10-20 01:00:09,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:09,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128731143] [2020-10-20 01:00:09,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:09,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:09,479 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,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128731143] [2020-10-20 01:00:09,480 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:09,480 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:00:09,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710934595] [2020-10-20 01:00:09,483 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:00:09,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:09,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:00:09,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:00:09,484 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 4 states. [2020-10-20 01:00:09,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:09,553 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2020-10-20 01:00:09,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:00:09,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-10-20 01:00:09,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:09,555 INFO L225 Difference]: With dead ends: 65 [2020-10-20 01:00:09,555 INFO L226 Difference]: Without dead ends: 63 [2020-10-20 01:00:09,557 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,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-20 01:00:09,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-10-20 01:00:09,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-20 01:00:09,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2020-10-20 01:00:09,565 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 8 [2020-10-20 01:00:09,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:09,566 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2020-10-20 01:00:09,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:00:09,566 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2020-10-20 01:00:09,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-20 01:00:09,567 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:09,567 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:00:09,568 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 01:00:09,568 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.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,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:09,569 INFO L82 PathProgramCache]: Analyzing trace with hash -564540945, now seen corresponding path program 1 times [2020-10-20 01:00:09,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:09,569 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366155018] [2020-10-20 01:00:09,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:09,642 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,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366155018] [2020-10-20 01:00:09,643 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:09,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:00:09,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654981431] [2020-10-20 01:00:09,644 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:00:09,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:09,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:00:09,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:00:09,645 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 4 states. [2020-10-20 01:00:09,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:09,721 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2020-10-20 01:00:09,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:00:09,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-10-20 01:00:09,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:09,723 INFO L225 Difference]: With dead ends: 69 [2020-10-20 01:00:09,723 INFO L226 Difference]: Without dead ends: 67 [2020-10-20 01:00:09,724 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,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-10-20 01:00:09,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2020-10-20 01:00:09,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-10-20 01:00:09,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2020-10-20 01:00:09,733 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 9 [2020-10-20 01:00:09,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:09,733 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2020-10-20 01:00:09,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:00:09,734 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2020-10-20 01:00:09,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-20 01:00:09,734 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:09,735 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:00:09,735 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 01:00:09,735 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.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,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:09,736 INFO L82 PathProgramCache]: Analyzing trace with hash 108108288, now seen corresponding path program 1 times [2020-10-20 01:00:09,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:09,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950789713] [2020-10-20 01:00:09,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:09,790 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,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950789713] [2020-10-20 01:00:09,790 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:09,791 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:00:09,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382036098] [2020-10-20 01:00:09,791 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:00:09,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:09,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:00:09,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:00:09,793 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 5 states. [2020-10-20 01:00:09,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:09,928 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2020-10-20 01:00:09,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:00:09,929 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-20 01:00:09,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:09,930 INFO L225 Difference]: With dead ends: 67 [2020-10-20 01:00:09,930 INFO L226 Difference]: Without dead ends: 65 [2020-10-20 01:00:09,931 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,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-10-20 01:00:09,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2020-10-20 01:00:09,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-10-20 01:00:09,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2020-10-20 01:00:09,949 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 11 [2020-10-20 01:00:09,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:09,950 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2020-10-20 01:00:09,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:00:09,950 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2020-10-20 01:00:09,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-20 01:00:09,951 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:09,951 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:00:09,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 01:00:09,952 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.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,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:09,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1357780173, now seen corresponding path program 1 times [2020-10-20 01:00:09,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:09,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748480864] [2020-10-20 01:00:09,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:10,052 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,054 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748480864] [2020-10-20 01:00:10,054 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:10,054 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:00:10,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830877294] [2020-10-20 01:00:10,055 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:00:10,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:10,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:00:10,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:00:10,056 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 5 states. [2020-10-20 01:00:10,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:10,171 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2020-10-20 01:00:10,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:00:10,171 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-20 01:00:10,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:10,172 INFO L225 Difference]: With dead ends: 65 [2020-10-20 01:00:10,172 INFO L226 Difference]: Without dead ends: 63 [2020-10-20 01:00:10,173 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,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-20 01:00:10,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2020-10-20 01:00:10,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-20 01:00:10,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2020-10-20 01:00:10,179 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 11 [2020-10-20 01:00:10,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:10,179 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2020-10-20 01:00:10,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:00:10,180 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2020-10-20 01:00:10,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-20 01:00:10,180 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:10,180 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:00:10,181 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 01:00:10,181 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.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,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:10,181 INFO L82 PathProgramCache]: Analyzing trace with hash -942992459, now seen corresponding path program 1 times [2020-10-20 01:00:10,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:10,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255541008] [2020-10-20 01:00:10,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:10,278 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,278 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255541008] [2020-10-20 01:00:10,279 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:10,279 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:00:10,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590601979] [2020-10-20 01:00:10,280 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:00:10,282 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:10,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:00:10,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:00:10,283 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 5 states. [2020-10-20 01:00:10,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:10,461 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2020-10-20 01:00:10,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:00:10,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-20 01:00:10,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:10,463 INFO L225 Difference]: With dead ends: 108 [2020-10-20 01:00:10,463 INFO L226 Difference]: Without dead ends: 106 [2020-10-20 01:00:10,464 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,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-10-20 01:00:10,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 60. [2020-10-20 01:00:10,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-10-20 01:00:10,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2020-10-20 01:00:10,483 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 12 [2020-10-20 01:00:10,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:10,484 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2020-10-20 01:00:10,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:00:10,486 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2020-10-20 01:00:10,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-20 01:00:10,487 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:10,487 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:00:10,487 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 01:00:10,488 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.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,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:10,489 INFO L82 PathProgramCache]: Analyzing trace with hash -943604167, now seen corresponding path program 1 times [2020-10-20 01:00:10,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:10,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574009851] [2020-10-20 01:00:10,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:10,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:10,564 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,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574009851] [2020-10-20 01:00:10,565 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:10,565 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:00:10,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87812779] [2020-10-20 01:00:10,566 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:00:10,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:10,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:00:10,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:00:10,567 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 4 states. [2020-10-20 01:00:10,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:10,644 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2020-10-20 01:00:10,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:00:10,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-20 01:00:10,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:10,645 INFO L225 Difference]: With dead ends: 61 [2020-10-20 01:00:10,645 INFO L226 Difference]: Without dead ends: 57 [2020-10-20 01:00:10,646 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:10,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-10-20 01:00:10,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2020-10-20 01:00:10,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-10-20 01:00:10,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2020-10-20 01:00:10,660 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 12 [2020-10-20 01:00:10,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:10,660 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2020-10-20 01:00:10,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:00:10,661 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2020-10-20 01:00:10,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-20 01:00:10,661 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:10,661 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:00:10,662 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 01:00:10,664 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.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,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:10,664 INFO L82 PathProgramCache]: Analyzing trace with hash 858493661, now seen corresponding path program 1 times [2020-10-20 01:00:10,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:10,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108532003] [2020-10-20 01:00:10,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:10,722 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,722 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108532003] [2020-10-20 01:00:10,722 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:10,723 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:00:10,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703613400] [2020-10-20 01:00:10,723 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:00:10,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:10,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:00:10,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:00:10,724 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 4 states. [2020-10-20 01:00:10,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:10,803 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2020-10-20 01:00:10,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:00:10,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-20 01:00:10,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:10,805 INFO L225 Difference]: With dead ends: 57 [2020-10-20 01:00:10,805 INFO L226 Difference]: Without dead ends: 53 [2020-10-20 01:00:10,806 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:10,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-10-20 01:00:10,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2020-10-20 01:00:10,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-10-20 01:00:10,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2020-10-20 01:00:10,820 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 12 [2020-10-20 01:00:10,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:10,821 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2020-10-20 01:00:10,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:00:10,821 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2020-10-20 01:00:10,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-20 01:00:10,823 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:10,823 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:00:10,824 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 01:00:10,824 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.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,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:10,825 INFO L82 PathProgramCache]: Analyzing trace with hash 832011069, now seen corresponding path program 1 times [2020-10-20 01:00:10,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:10,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27271368] [2020-10-20 01:00:10,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:10,966 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,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27271368] [2020-10-20 01:00:10,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:10,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 01:00:10,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780582080] [2020-10-20 01:00:10,968 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 01:00:10,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:10,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 01:00:10,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:00:10,969 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states. [2020-10-20 01:00:11,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:11,122 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2020-10-20 01:00:11,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 01:00:11,123 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-20 01:00:11,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:11,124 INFO L225 Difference]: With dead ends: 118 [2020-10-20 01:00:11,124 INFO L226 Difference]: Without dead ends: 116 [2020-10-20 01:00:11,125 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,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-10-20 01:00:11,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 57. [2020-10-20 01:00:11,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-10-20 01:00:11,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2020-10-20 01:00:11,132 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 13 [2020-10-20 01:00:11,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:11,132 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2020-10-20 01:00:11,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 01:00:11,133 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2020-10-20 01:00:11,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-20 01:00:11,133 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:11,134 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:00:11,134 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 01:00:11,134 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.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,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:11,135 INFO L82 PathProgramCache]: Analyzing trace with hash 866403148, now seen corresponding path program 1 times [2020-10-20 01:00:11,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:11,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879159950] [2020-10-20 01:00:11,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:11,170 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,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879159950] [2020-10-20 01:00:11,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:11,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:00:11,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171057693] [2020-10-20 01:00:11,172 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:00:11,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:11,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:00:11,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:00:11,173 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 5 states. [2020-10-20 01:00:11,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:11,254 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2020-10-20 01:00:11,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:00:11,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-20 01:00:11,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:11,257 INFO L225 Difference]: With dead ends: 57 [2020-10-20 01:00:11,257 INFO L226 Difference]: Without dead ends: 55 [2020-10-20 01:00:11,259 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:11,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-10-20 01:00:11,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-10-20 01:00:11,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-10-20 01:00:11,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2020-10-20 01:00:11,264 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 13 [2020-10-20 01:00:11,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:11,264 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2020-10-20 01:00:11,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:00:11,264 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2020-10-20 01:00:11,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-20 01:00:11,266 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:11,266 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:00:11,266 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-20 01:00:11,267 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.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,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:11,267 INFO L82 PathProgramCache]: Analyzing trace with hash 864309836, now seen corresponding path program 1 times [2020-10-20 01:00:11,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:11,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077859119] [2020-10-20 01:00:11,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:11,341 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,342 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077859119] [2020-10-20 01:00:11,342 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:11,342 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:00:11,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960784450] [2020-10-20 01:00:11,343 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:00:11,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:11,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:00:11,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:00:11,346 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 5 states. [2020-10-20 01:00:11,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:11,433 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2020-10-20 01:00:11,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:00:11,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-20 01:00:11,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:11,434 INFO L225 Difference]: With dead ends: 70 [2020-10-20 01:00:11,435 INFO L226 Difference]: Without dead ends: 68 [2020-10-20 01:00:11,435 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:11,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-10-20 01:00:11,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 53. [2020-10-20 01:00:11,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-10-20 01:00:11,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2020-10-20 01:00:11,445 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 13 [2020-10-20 01:00:11,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:11,446 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2020-10-20 01:00:11,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:00:11,446 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2020-10-20 01:00:11,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-20 01:00:11,447 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:11,447 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:00:11,447 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-20 01:00:11,447 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.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,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:11,448 INFO L82 PathProgramCache]: Analyzing trace with hash 14757244, now seen corresponding path program 1 times [2020-10-20 01:00:11,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:11,452 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975530859] [2020-10-20 01:00:11,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:11,550 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,550 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975530859] [2020-10-20 01:00:11,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:11,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 01:00:11,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789146595] [2020-10-20 01:00:11,551 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 01:00:11,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:11,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 01:00:11,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:00:11,552 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 6 states. [2020-10-20 01:00:11,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:11,645 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2020-10-20 01:00:11,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 01:00:11,645 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-20 01:00:11,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:11,648 INFO L225 Difference]: With dead ends: 78 [2020-10-20 01:00:11,648 INFO L226 Difference]: Without dead ends: 76 [2020-10-20 01:00:11,649 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:11,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-10-20 01:00:11,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 53. [2020-10-20 01:00:11,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-10-20 01:00:11,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2020-10-20 01:00:11,655 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 14 [2020-10-20 01:00:11,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:11,655 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2020-10-20 01:00:11,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 01:00:11,655 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2020-10-20 01:00:11,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-20 01:00:11,656 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:11,656 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:00:11,656 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-20 01:00:11,656 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.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,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:11,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1088699972, now seen corresponding path program 1 times [2020-10-20 01:00:11,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:11,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155739235] [2020-10-20 01:00:11,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:11,766 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,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155739235] [2020-10-20 01:00:11,767 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:11,767 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 01:00:11,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860107536] [2020-10-20 01:00:11,768 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 01:00:11,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:11,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 01:00:11,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:00:11,769 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 6 states. [2020-10-20 01:00:11,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:11,867 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2020-10-20 01:00:11,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:00:11,867 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-20 01:00:11,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:11,868 INFO L225 Difference]: With dead ends: 76 [2020-10-20 01:00:11,868 INFO L226 Difference]: Without dead ends: 72 [2020-10-20 01:00:11,869 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,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-10-20 01:00:11,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 59. [2020-10-20 01:00:11,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-20 01:00:11,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2020-10-20 01:00:11,877 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 14 [2020-10-20 01:00:11,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:11,877 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2020-10-20 01:00:11,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 01:00:11,878 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2020-10-20 01:00:11,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-20 01:00:11,878 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:11,878 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:00:11,879 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-20 01:00:11,879 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.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,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:11,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1089262030, now seen corresponding path program 1 times [2020-10-20 01:00:11,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:11,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503764170] [2020-10-20 01:00:11,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:11,920 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,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503764170] [2020-10-20 01:00:11,920 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:11,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:00:11,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545881041] [2020-10-20 01:00:11,921 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:00:11,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:11,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:00:11,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:00:11,922 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 5 states. [2020-10-20 01:00:12,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:12,025 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2020-10-20 01:00:12,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:00:12,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-20 01:00:12,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:12,026 INFO L225 Difference]: With dead ends: 79 [2020-10-20 01:00:12,027 INFO L226 Difference]: Without dead ends: 77 [2020-10-20 01:00:12,028 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:12,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-20 01:00:12,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 57. [2020-10-20 01:00:12,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-10-20 01:00:12,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2020-10-20 01:00:12,034 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 14 [2020-10-20 01:00:12,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:12,034 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2020-10-20 01:00:12,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:00:12,034 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2020-10-20 01:00:12,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-20 01:00:12,035 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:12,035 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:00:12,035 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-20 01:00:12,036 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.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,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:12,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1023807232, now seen corresponding path program 1 times [2020-10-20 01:00:12,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:12,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592601799] [2020-10-20 01:00:12,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:12,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:12,125 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,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592601799] [2020-10-20 01:00:12,125 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:12,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 01:00:12,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355032024] [2020-10-20 01:00:12,126 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 01:00:12,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:12,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 01:00:12,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:00:12,127 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 6 states. [2020-10-20 01:00:12,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:12,250 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2020-10-20 01:00:12,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 01:00:12,251 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-20 01:00:12,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:12,252 INFO L225 Difference]: With dead ends: 82 [2020-10-20 01:00:12,252 INFO L226 Difference]: Without dead ends: 80 [2020-10-20 01:00:12,253 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:12,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-10-20 01:00:12,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 60. [2020-10-20 01:00:12,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-10-20 01:00:12,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2020-10-20 01:00:12,258 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 14 [2020-10-20 01:00:12,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:12,258 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2020-10-20 01:00:12,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 01:00:12,259 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2020-10-20 01:00:12,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-20 01:00:12,259 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:12,260 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:12,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-20 01:00:12,260 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.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,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:12,261 INFO L82 PathProgramCache]: Analyzing trace with hash -592609303, now seen corresponding path program 1 times [2020-10-20 01:00:12,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:12,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342629529] [2020-10-20 01:00:12,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:12,357 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,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342629529] [2020-10-20 01:00:12,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:12,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 01:00:12,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360617748] [2020-10-20 01:00:12,359 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 01:00:12,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:12,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 01:00:12,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:00:12,364 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand 6 states. [2020-10-20 01:00:12,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:12,492 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2020-10-20 01:00:12,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 01:00:12,493 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-20 01:00:12,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:12,494 INFO L225 Difference]: With dead ends: 87 [2020-10-20 01:00:12,494 INFO L226 Difference]: Without dead ends: 85 [2020-10-20 01:00:12,494 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:12,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-10-20 01:00:12,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 63. [2020-10-20 01:00:12,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-20 01:00:12,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2020-10-20 01:00:12,500 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 15 [2020-10-20 01:00:12,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:12,501 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2020-10-20 01:00:12,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 01:00:12,501 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2020-10-20 01:00:12,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 01:00:12,505 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:12,505 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:12,505 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-20 01:00:12,506 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.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,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:12,506 INFO L82 PathProgramCache]: Analyzing trace with hash 331428451, now seen corresponding path program 1 times [2020-10-20 01:00:12,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:12,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359212467] [2020-10-20 01:00:12,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:12,536 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,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359212467] [2020-10-20 01:00:12,537 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:12,537 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:00:12,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646586128] [2020-10-20 01:00:12,538 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:00:12,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:12,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:00:12,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:00:12,539 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 4 states. [2020-10-20 01:00:12,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:12,570 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2020-10-20 01:00:12,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:00:12,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-20 01:00:12,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:12,571 INFO L225 Difference]: With dead ends: 63 [2020-10-20 01:00:12,572 INFO L226 Difference]: Without dead ends: 61 [2020-10-20 01:00:12,572 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:12,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-10-20 01:00:12,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-10-20 01:00:12,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-10-20 01:00:12,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2020-10-20 01:00:12,577 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 16 [2020-10-20 01:00:12,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:12,579 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2020-10-20 01:00:12,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:00:12,579 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2020-10-20 01:00:12,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-20 01:00:12,579 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:12,580 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:12,580 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-20 01:00:12,580 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.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,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:12,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1684353502, now seen corresponding path program 1 times [2020-10-20 01:00:12,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:12,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007945069] [2020-10-20 01:00:12,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:12,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:12,623 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,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007945069] [2020-10-20 01:00:12,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:12,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:00:12,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981601526] [2020-10-20 01:00:12,624 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:00:12,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:12,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:00:12,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:00:12,625 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand 4 states. [2020-10-20 01:00:12,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:12,680 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2020-10-20 01:00:12,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:00:12,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-20 01:00:12,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:12,682 INFO L225 Difference]: With dead ends: 61 [2020-10-20 01:00:12,682 INFO L226 Difference]: Without dead ends: 57 [2020-10-20 01:00:12,683 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:12,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-10-20 01:00:12,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-10-20 01:00:12,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-10-20 01:00:12,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2020-10-20 01:00:12,687 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 17 [2020-10-20 01:00:12,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:12,688 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2020-10-20 01:00:12,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:00:12,688 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2020-10-20 01:00:12,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-20 01:00:12,689 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:12,689 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,689 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-20 01:00:12,689 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.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,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:12,690 INFO L82 PathProgramCache]: Analyzing trace with hash -2089868866, now seen corresponding path program 1 times [2020-10-20 01:00:12,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:12,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299481363] [2020-10-20 01:00:12,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:12,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:12,777 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,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299481363] [2020-10-20 01:00:12,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656926383] [2020-10-20 01:00:12,778 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:12,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:12,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 01:00:12,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:00:13,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 01:00:13,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 01:00:13,065 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:13,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:00:13,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2020-10-20 01:00:13,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336422990] [2020-10-20 01:00:13,066 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-20 01:00:13,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:13,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-20 01:00:13,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-10-20 01:00:13,067 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 13 states. [2020-10-20 01:00:13,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:13,355 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2020-10-20 01:00:13,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-20 01:00:13,356 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2020-10-20 01:00:13,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:13,357 INFO L225 Difference]: With dead ends: 104 [2020-10-20 01:00:13,357 INFO L226 Difference]: Without dead ends: 102 [2020-10-20 01:00:13,358 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2020-10-20 01:00:13,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-10-20 01:00:13,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 53. [2020-10-20 01:00:13,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-10-20 01:00:13,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2020-10-20 01:00:13,364 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 18 [2020-10-20 01:00:13,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:13,364 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2020-10-20 01:00:13,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-20 01:00:13,365 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2020-10-20 01:00:13,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-20 01:00:13,365 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:13,365 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:13,577 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:00:13,578 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.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,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:13,579 INFO L82 PathProgramCache]: Analyzing trace with hash 694227744, now seen corresponding path program 1 times [2020-10-20 01:00:13,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:13,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668791911] [2020-10-20 01:00:13,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:13,637 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,637 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668791911] [2020-10-20 01:00:13,638 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:13,638 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 01:00:13,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78674132] [2020-10-20 01:00:13,638 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 01:00:13,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:13,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 01:00:13,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:00:13,639 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 6 states. [2020-10-20 01:00:13,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:13,735 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2020-10-20 01:00:13,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:00:13,735 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-20 01:00:13,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:13,736 INFO L225 Difference]: With dead ends: 68 [2020-10-20 01:00:13,736 INFO L226 Difference]: Without dead ends: 66 [2020-10-20 01:00:13,737 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,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-10-20 01:00:13,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 48. [2020-10-20 01:00:13,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-10-20 01:00:13,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2020-10-20 01:00:13,741 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 18 [2020-10-20 01:00:13,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:13,741 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2020-10-20 01:00:13,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 01:00:13,742 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2020-10-20 01:00:13,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-20 01:00:13,742 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:13,742 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,742 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-20 01:00:13,743 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.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,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:13,743 INFO L82 PathProgramCache]: Analyzing trace with hash 2065566423, now seen corresponding path program 1 times [2020-10-20 01:00:13,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:13,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424762555] [2020-10-20 01:00:13,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:13,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:13,789 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,789 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424762555] [2020-10-20 01:00:13,789 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:13,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 01:00:13,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131666599] [2020-10-20 01:00:13,790 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 01:00:13,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:13,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 01:00:13,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:00:13,791 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 6 states. [2020-10-20 01:00:13,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:13,874 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2020-10-20 01:00:13,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:00:13,874 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-20 01:00:13,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:13,874 INFO L225 Difference]: With dead ends: 48 [2020-10-20 01:00:13,875 INFO L226 Difference]: Without dead ends: 44 [2020-10-20 01:00:13,875 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-20 01:00:13,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-10-20 01:00:13,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2020-10-20 01:00:13,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-10-20 01:00:13,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2020-10-20 01:00:13,879 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 19 [2020-10-20 01:00:13,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:13,880 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2020-10-20 01:00:13,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 01:00:13,880 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2020-10-20 01:00:13,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-20 01:00:13,880 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:13,880 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,881 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-20 01:00:13,881 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.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,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:13,881 INFO L82 PathProgramCache]: Analyzing trace with hash 2000673683, now seen corresponding path program 1 times [2020-10-20 01:00:13,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:13,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66267692] [2020-10-20 01:00:13,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:13,934 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,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66267692] [2020-10-20 01:00:13,935 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:13,935 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 01:00:13,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325239143] [2020-10-20 01:00:13,936 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 01:00:13,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:13,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 01:00:13,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:00:13,936 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand 6 states. [2020-10-20 01:00:14,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:14,022 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2020-10-20 01:00:14,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:00:14,024 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-20 01:00:14,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:14,024 INFO L225 Difference]: With dead ends: 51 [2020-10-20 01:00:14,024 INFO L226 Difference]: Without dead ends: 20 [2020-10-20 01:00:14,025 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:14,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-10-20 01:00:14,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-10-20 01:00:14,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-20 01:00:14,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2020-10-20 01:00:14,027 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 19 [2020-10-20 01:00:14,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:14,027 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2020-10-20 01:00:14,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 01:00:14,028 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2020-10-20 01:00:14,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-20 01:00:14,028 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:14,028 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:00:14,028 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-20 01:00:14,029 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.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:14,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:14,029 INFO L82 PathProgramCache]: Analyzing trace with hash -369207525, now seen corresponding path program 1 times [2020-10-20 01:00:14,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:14,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163979907] [2020-10-20 01:00:14,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:14,074 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:14,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163979907] [2020-10-20 01:00:14,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020166128] [2020-10-20 01:00:14,075 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:14,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:14,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 01:00:14,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:00:14,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 01:00:14,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 01:00:14,268 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:14,269 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:00:14,269 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2020-10-20 01:00:14,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806349984] [2020-10-20 01:00:14,269 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-20 01:00:14,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:14,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-20 01:00:14,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-10-20 01:00:14,270 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 13 states. [2020-10-20 01:00:14,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:14,362 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-10-20 01:00:14,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 01:00:14,362 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2020-10-20 01:00:14,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:14,362 INFO L225 Difference]: With dead ends: 31 [2020-10-20 01:00:14,363 INFO L226 Difference]: Without dead ends: 0 [2020-10-20 01:00:14,363 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2020-10-20 01:00:14,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-20 01:00:14,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-20 01:00:14,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-20 01:00:14,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-20 01:00:14,364 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2020-10-20 01:00:14,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:14,365 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 01:00:14,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-20 01:00:14,365 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-20 01:00:14,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-20 01:00:14,572 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2020-10-20 01:00:14,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-20 01:00:14,989 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 15 [2020-10-20 01:00:15,118 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2020-10-20 01:00:15,344 WARN L193 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 26 [2020-10-20 01:00:15,446 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 15 [2020-10-20 01:00:15,449 INFO L274 CegarLoopResult]: For program point L349(lines 349 358) no Hoare annotation was computed. [2020-10-20 01:00:15,450 INFO L270 CegarLoopResult]: At program point L250(lines 102 252) the Hoare annotation is: (and (< ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 0)) (<= 1 ULTIMATE.start_main_~main__t~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0))) [2020-10-20 01:00:15,450 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,450 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,450 INFO L274 CegarLoopResult]: For program point L102(lines 102 252) no Hoare annotation was computed. [2020-10-20 01:00:15,450 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-10-20 01:00:15,450 INFO L274 CegarLoopResult]: For program point L20(lines 20 374) no Hoare annotation was computed. [2020-10-20 01:00:15,450 INFO L274 CegarLoopResult]: For program point L235(lines 235 243) no Hoare annotation was computed. [2020-10-20 01:00:15,451 INFO L274 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,451 INFO L274 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,451 INFO L274 CegarLoopResult]: For program point L4-2(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,451 INFO L274 CegarLoopResult]: For program point L4-3(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,452 INFO L274 CegarLoopResult]: For program point L4-4(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,452 INFO L274 CegarLoopResult]: For program point L4-5(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,453 INFO L274 CegarLoopResult]: For program point L4-6(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,453 INFO L274 CegarLoopResult]: For program point L4-7(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,453 INFO L274 CegarLoopResult]: For program point L4-8(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,453 INFO L274 CegarLoopResult]: For program point L4-9(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,454 INFO L274 CegarLoopResult]: For program point L4-10(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,454 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,454 INFO L274 CegarLoopResult]: For program point L4-11(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,454 INFO L274 CegarLoopResult]: For program point L153(lines 153 161) no Hoare annotation was computed. [2020-10-20 01:00:15,454 INFO L274 CegarLoopResult]: For program point L4-12(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,455 INFO L274 CegarLoopResult]: For program point L4-13(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,455 INFO L274 CegarLoopResult]: For program point L54(lines 54 254) no Hoare annotation was computed. [2020-10-20 01:00:15,455 INFO L274 CegarLoopResult]: For program point L4-14(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,455 INFO L274 CegarLoopResult]: For program point L4-15(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,455 INFO L274 CegarLoopResult]: For program point L4-16(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,455 INFO L274 CegarLoopResult]: For program point L4-17(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,456 INFO L274 CegarLoopResult]: For program point L4-18(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,456 INFO L274 CegarLoopResult]: For program point L4-19(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,456 INFO L274 CegarLoopResult]: For program point L4-20(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,456 INFO L274 CegarLoopResult]: For program point L4-21(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,456 INFO L274 CegarLoopResult]: For program point L4-22(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,456 INFO L274 CegarLoopResult]: For program point L4-23(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,457 INFO L274 CegarLoopResult]: For program point L4-24(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,457 INFO L274 CegarLoopResult]: For program point L4-25(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,457 INFO L274 CegarLoopResult]: For program point L4-26(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,457 INFO L274 CegarLoopResult]: For program point L4-27(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,457 INFO L274 CegarLoopResult]: For program point L4-28(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,458 INFO L274 CegarLoopResult]: For program point L71(lines 71 95) no Hoare annotation was computed. [2020-10-20 01:00:15,458 INFO L274 CegarLoopResult]: For program point L4-29(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,458 INFO L274 CegarLoopResult]: For program point L4-30(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,458 INFO L274 CegarLoopResult]: For program point L4-31(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,459 INFO L274 CegarLoopResult]: For program point L4-32(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,459 INFO L274 CegarLoopResult]: For program point L4-33(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,459 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,459 INFO L274 CegarLoopResult]: For program point L187(lines 187 197) no Hoare annotation was computed. [2020-10-20 01:00:15,459 INFO L274 CegarLoopResult]: For program point L337(lines 337 360) no Hoare annotation was computed. [2020-10-20 01:00:15,460 INFO L274 CegarLoopResult]: For program point L106(lines 106 210) no Hoare annotation was computed. [2020-10-20 01:00:15,460 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,460 INFO L274 CegarLoopResult]: For program point L24(lines 24 369) no Hoare annotation was computed. [2020-10-20 01:00:15,460 INFO L274 CegarLoopResult]: For program point L289(lines 289 363) no Hoare annotation was computed. [2020-10-20 01:00:15,460 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-10-20 01:00:15,460 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,461 INFO L274 CegarLoopResult]: For program point L223(lines 223 245) no Hoare annotation was computed. [2020-10-20 01:00:15,461 INFO L274 CegarLoopResult]: For program point L141(lines 141 163) no Hoare annotation was computed. [2020-10-20 01:00:15,461 INFO L274 CegarLoopResult]: For program point L42(lines 42 256) no Hoare annotation was computed. [2020-10-20 01:00:15,461 INFO L274 CegarLoopResult]: For program point L125(lines 125 202) no Hoare annotation was computed. [2020-10-20 01:00:15,461 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,461 INFO L277 CegarLoopResult]: At program point L373(lines 15 375) the Hoare annotation is: true [2020-10-20 01:00:15,462 INFO L274 CegarLoopResult]: For program point L175(lines 175 199) no Hoare annotation was computed. [2020-10-20 01:00:15,462 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,462 INFO L270 CegarLoopResult]: At program point L357(lines 283 364) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_main_~main__t~0 0))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~13 0)))) (or (and .cse3 .cse1) (and .cse3 (<= 1 ULTIMATE.start_main_~main__t~0)))))) (or (and .cse2 .cse1) (and .cse2 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~16 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) .cse0 (<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~17))))) [2020-10-20 01:00:15,462 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,463 INFO L274 CegarLoopResult]: For program point L308(lines 308 316) no Hoare annotation was computed. [2020-10-20 01:00:15,463 INFO L274 CegarLoopResult]: For program point L325(lines 325 362) no Hoare annotation was computed. [2020-10-20 01:00:15,463 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,464 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-10-20 01:00:15,464 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,464 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,464 INFO L274 CegarLoopResult]: For program point L277(lines 277 364) no Hoare annotation was computed. [2020-10-20 01:00:15,464 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,464 INFO L274 CegarLoopResult]: For program point L113(lines 113 204) no Hoare annotation was computed. [2020-10-20 01:00:15,465 INFO L270 CegarLoopResult]: At program point L328(lines 32 368) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_main_~main__t~0 1))) (let ((.cse0 (let ((.cse2 (or (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~13 0)) (and (<= 0 ULTIMATE.start_main_~main__tagbuf_len~0) (= ULTIMATE.start_main_~main__t~0 0)))) (.cse3 (<= 0 ULTIMATE.start_main_~main__t~0))) (or (and .cse2 .cse3 (< 0 ULTIMATE.start_main_~main__tagbuf_len~0) .cse1) (and .cse2 .cse3 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~17 0))))))) (or (and (< ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) .cse0 (<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~17)) (and (not (= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0)) .cse0 .cse1 (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0))))) [2020-10-20 01:00:15,466 INFO L270 CegarLoopResult]: At program point L196(lines 60 254) the Hoare annotation is: (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 0)) (<= 1 ULTIMATE.start_main_~main__t~0) (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0))) [2020-10-20 01:00:15,466 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,466 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,467 INFO L274 CegarLoopResult]: For program point L296(lines 296 318) no Hoare annotation was computed. [2020-10-20 01:00:15,467 INFO L274 CegarLoopResult]: For program point L32(lines 32 368) no Hoare annotation was computed. [2020-10-20 01:00:15,467 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-10-20 01:00:15,467 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,467 INFO L274 CegarLoopResult]: For program point L83(lines 83 93) no Hoare annotation was computed. [2020-10-20 01:00:15,467 INFO L277 CegarLoopResult]: At program point L315(lines 32 368) the Hoare annotation is: true [2020-10-20 01:00:15,469 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:15,469 INFO L274 CegarLoopResult]: For program point L216(lines 216 251) no Hoare annotation was computed. [2020-10-20 01:00:15,470 INFO L274 CegarLoopResult]: For program point L266(lines 266 366) no Hoare annotation was computed. [2020-10-20 01:00:15,470 INFO L274 CegarLoopResult]: For program point L134(lines 134 201) no Hoare annotation was computed. [2020-10-20 01:00:15,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 01:00:15 BoogieIcfgContainer [2020-10-20 01:00:15,514 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 01:00:15,514 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 01:00:15,514 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 01:00:15,515 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 01:00:15,515 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:08" (3/4) ... [2020-10-20 01:00:15,519 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-20 01:00:15,537 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-10-20 01:00:15,538 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-10-20 01:00:15,538 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-20 01:00:15,539 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-20 01:00:15,623 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 01:00:15,623 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 01:00:15,625 INFO L168 Benchmark]: Toolchain (without parser) took 7937.81 ms. Allocated memory was 39.3 MB in the beginning and 77.6 MB in the end (delta: 38.3 MB). Free memory was 17.0 MB in the beginning and 17.1 MB in the end (delta: -81.8 kB). Peak memory consumption was 38.2 MB. Max. memory is 14.3 GB. [2020-10-20 01:00:15,626 INFO L168 Benchmark]: CDTParser took 0.83 ms. Allocated memory is still 30.4 MB. Free memory was 6.6 MB in the beginning and 6.6 MB in the end (delta: 43.6 kB). Peak memory consumption was 43.6 kB. Max. memory is 14.3 GB. [2020-10-20 01:00:15,626 INFO L168 Benchmark]: CACSL2BoogieTranslator took 461.54 ms. Allocated memory was 39.3 MB in the beginning and 40.4 MB in the end (delta: 1.0 MB). Free memory was 16.1 MB in the beginning and 13.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 8.0 MB. Max. memory is 14.3 GB. [2020-10-20 01:00:15,627 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.52 ms. Allocated memory is still 40.4 MB. Free memory was 13.7 MB in the beginning and 11.4 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 14.3 GB. [2020-10-20 01:00:15,627 INFO L168 Benchmark]: Boogie Preprocessor took 28.24 ms. Allocated memory is still 40.4 MB. Free memory was 11.4 MB in the beginning and 9.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 14.3 GB. [2020-10-20 01:00:15,628 INFO L168 Benchmark]: RCFGBuilder took 522.27 ms. Allocated memory was 40.4 MB in the beginning and 41.9 MB in the end (delta: 1.6 MB). Free memory was 9.7 MB in the beginning and 13.8 MB in the end (delta: -4.1 MB). Peak memory consumption was 2.3 MB. Max. memory is 14.3 GB. [2020-10-20 01:00:15,628 INFO L168 Benchmark]: TraceAbstraction took 6757.12 ms. Allocated memory was 41.9 MB in the beginning and 77.6 MB in the end (delta: 35.7 MB). Free memory was 13.3 MB in the beginning and 25.5 MB in the end (delta: -12.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 14.3 GB. [2020-10-20 01:00:15,629 INFO L168 Benchmark]: Witness Printer took 109.33 ms. Allocated memory is still 77.6 MB. Free memory was 25.5 MB in the beginning and 17.1 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 14.3 GB. [2020-10-20 01:00:15,632 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.83 ms. Allocated memory is still 30.4 MB. Free memory was 6.6 MB in the beginning and 6.6 MB in the end (delta: 43.6 kB). Peak memory consumption was 43.6 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 461.54 ms. Allocated memory was 39.3 MB in the beginning and 40.4 MB in the end (delta: 1.0 MB). Free memory was 16.1 MB in the beginning and 13.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 8.0 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 49.52 ms. Allocated memory is still 40.4 MB. Free memory was 13.7 MB in the beginning and 11.4 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 28.24 ms. Allocated memory is still 40.4 MB. Free memory was 11.4 MB in the beginning and 9.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 14.3 GB. * RCFGBuilder took 522.27 ms. Allocated memory was 40.4 MB in the beginning and 41.9 MB in the end (delta: 1.6 MB). Free memory was 9.7 MB in the beginning and 13.8 MB in the end (delta: -4.1 MB). Peak memory consumption was 2.3 MB. Max. memory is 14.3 GB. * TraceAbstraction took 6757.12 ms. Allocated memory was 41.9 MB in the beginning and 77.6 MB in the end (delta: 35.7 MB). Free memory was 13.3 MB in the beginning and 25.5 MB in the end (delta: -12.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 14.3 GB. * Witness Printer took 109.33 ms. Allocated memory is still 77.6 MB. Free memory was 25.5 MB in the beginning and 17.1 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 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 - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((main__t < main__tagbuf_len && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t) && !(__VERIFIER_assert__cond == 0) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((main__t < main__tagbuf_len && (((((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && 0 <= main__t) && 0 < main__tagbuf_len) && main__t <= 1) || (((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && 0 <= main__t) && !(__VERIFIER_assert__cond == 0)))) && 1 <= __VERIFIER_assert__cond) || (((!(main__t == main__tagbuf_len) && (((((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && 0 <= main__t) && 0 < main__tagbuf_len) && main__t <= 1) || (((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && 0 <= main__t) && !(__VERIFIER_assert__cond == 0)))) && main__t <= 1) && main__t <= main__tagbuf_len) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: ((((((!(__VERIFIER_assert__cond == 0) && main__t == 0) || (!(__VERIFIER_assert__cond == 0) && 1 <= main__t)) && main__t == 0) || (((!(__VERIFIER_assert__cond == 0) && main__t == 0) || (!(__VERIFIER_assert__cond == 0) && 1 <= main__t)) && !(__VERIFIER_assert__cond == 0))) && 0 < main__tagbuf_len) && main__t == 0) || ((main__t < main__tagbuf_len && ((((!(__VERIFIER_assert__cond == 0) && main__t == 0) || (!(__VERIFIER_assert__cond == 0) && 1 <= main__t)) && main__t == 0) || (((!(__VERIFIER_assert__cond == 0) && main__t == 0) || (!(__VERIFIER_assert__cond == 0) && 1 <= main__t)) && !(__VERIFIER_assert__cond == 0)))) && 1 <= __VERIFIER_assert__cond) - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: ((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) && main__t <= main__tagbuf_len) && !(__VERIFIER_assert__cond == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 88 locations, 17 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.7s, OverallIterations: 23, TraceHistogramMax: 2, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 952 SDtfs, 1552 SDslu, 1428 SDs, 0 SdLazy, 1700 SolverSat, 174 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred 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, 335 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 19 NumberOfFragments, 240 HoareAnnotationTreeSize, 6 FomulaSimplifications, 618518 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 6 FomulaSimplificationsInter, 114543 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 356 NumberOfCodeBlocks, 356 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 331 ConstructedInterpolants, 0 QuantifiedInterpolants, 18326 SizeOfPredicates, 8 NumberOfNonLiveVariables, 237 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...