./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe011_rmo.opt.i --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/pthread-wmm/safe011_rmo.opt.i -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 115ea8a51a281ddca5da7e6b8ebbaa38c9e9f09c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 03:04:23,266 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 03:04:23,269 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 03:04:23,307 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 03:04:23,308 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 03:04:23,314 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 03:04:23,316 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 03:04:23,321 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 03:04:23,324 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 03:04:23,325 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 03:04:23,326 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 03:04:23,327 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 03:04:23,328 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 03:04:23,328 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 03:04:23,331 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 03:04:23,333 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 03:04:23,335 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 03:04:23,338 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 03:04:23,339 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 03:04:23,342 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 03:04:23,354 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 03:04:23,355 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 03:04:23,357 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 03:04:23,358 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 03:04:23,365 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 03:04:23,365 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 03:04:23,365 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 03:04:23,373 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 03:04:23,374 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 03:04:23,375 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 03:04:23,377 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 03:04:23,378 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 03:04:23,379 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 03:04:23,383 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 03:04:23,384 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 03:04:23,385 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 03:04:23,386 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 03:04:23,386 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 03:04:23,386 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 03:04:23,387 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 03:04:23,388 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 03:04:23,389 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 03:04:23,427 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 03:04:23,428 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 03:04:23,430 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 03:04:23,431 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 03:04:23,431 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 03:04:23,431 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 03:04:23,432 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 03:04:23,432 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 03:04:23,432 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 03:04:23,432 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 03:04:23,434 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 03:04:23,434 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 03:04:23,434 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 03:04:23,435 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 03:04:23,435 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 03:04:23,435 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 03:04:23,435 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 03:04:23,436 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 03:04:23,436 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 03:04:23,436 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 03:04:23,436 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 03:04:23,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 03:04:23,437 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 03:04:23,437 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 03:04:23,437 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 03:04:23,438 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 03:04:23,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 03:04:23,438 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 03:04:23,438 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 03:04:23,439 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 -> 115ea8a51a281ddca5da7e6b8ebbaa38c9e9f09c [2020-10-20 03:04:23,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 03:04:23,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 03:04:23,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 03:04:23,661 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 03:04:23,661 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 03:04:23,662 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe011_rmo.opt.i [2020-10-20 03:04:23,749 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38e50021e/573ceaca3c554b0e91f40c0196943aaa/FLAG0c59d8c1b [2020-10-20 03:04:24,404 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 03:04:24,407 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe011_rmo.opt.i [2020-10-20 03:04:24,432 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38e50021e/573ceaca3c554b0e91f40c0196943aaa/FLAG0c59d8c1b [2020-10-20 03:04:24,660 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38e50021e/573ceaca3c554b0e91f40c0196943aaa [2020-10-20 03:04:24,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 03:04:24,672 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 03:04:24,673 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 03:04:24,673 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 03:04:24,677 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 03:04:24,678 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 03:04:24" (1/1) ... [2020-10-20 03:04:24,681 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@839e46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:04:24, skipping insertion in model container [2020-10-20 03:04:24,682 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 03:04:24" (1/1) ... [2020-10-20 03:04:24,691 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 03:04:24,784 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 03:04:25,197 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 03:04:25,208 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 03:04:25,329 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 03:04:25,418 INFO L208 MainTranslator]: Completed translation [2020-10-20 03:04:25,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:04:25 WrapperNode [2020-10-20 03:04:25,418 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 03:04:25,419 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 03:04:25,419 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 03:04:25,419 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 03:04:25,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:04:25" (1/1) ... [2020-10-20 03:04:25,449 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:04:25" (1/1) ... [2020-10-20 03:04:25,505 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 03:04:25,506 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 03:04:25,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 03:04:25,509 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 03:04:25,519 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:04:25" (1/1) ... [2020-10-20 03:04:25,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:04:25" (1/1) ... [2020-10-20 03:04:25,525 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:04:25" (1/1) ... [2020-10-20 03:04:25,525 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:04:25" (1/1) ... [2020-10-20 03:04:25,536 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:04:25" (1/1) ... [2020-10-20 03:04:25,541 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:04:25" (1/1) ... [2020-10-20 03:04:25,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:04:25" (1/1) ... [2020-10-20 03:04:25,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 03:04:25,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 03:04:25,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 03:04:25,552 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 03:04:25,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:04:25" (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 03:04:25,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 03:04:25,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-20 03:04:25,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 03:04:25,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 03:04:25,623 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-20 03:04:25,623 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-20 03:04:25,623 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-20 03:04:25,624 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-20 03:04:25,624 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-20 03:04:25,624 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-20 03:04:25,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 03:04:25,624 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-20 03:04:25,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 03:04:25,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 03:04:25,627 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-20 03:04:27,889 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 03:04:27,890 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-20 03:04:27,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 03:04:27 BoogieIcfgContainer [2020-10-20 03:04:27,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 03:04:27,894 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 03:04:27,894 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 03:04:27,898 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 03:04:27,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 03:04:24" (1/3) ... [2020-10-20 03:04:27,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e3b8509 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 03:04:27, skipping insertion in model container [2020-10-20 03:04:27,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:04:25" (2/3) ... [2020-10-20 03:04:27,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e3b8509 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 03:04:27, skipping insertion in model container [2020-10-20 03:04:27,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 03:04:27" (3/3) ... [2020-10-20 03:04:27,902 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_rmo.opt.i [2020-10-20 03:04:27,915 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-20 03:04:27,915 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 03:04:27,923 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-20 03:04:27,924 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-20 03:04:27,957 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,957 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,958 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,958 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,958 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,959 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,960 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,960 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,960 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,960 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,961 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,961 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,961 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,961 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,962 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,962 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,962 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,962 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,963 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,963 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,964 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,964 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,965 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,965 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,965 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,965 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,967 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,967 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,968 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,968 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,971 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,971 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,976 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,976 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,976 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,976 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,977 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,977 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,977 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,977 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,978 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,978 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,978 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,978 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,979 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,981 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,981 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,981 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,982 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,982 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,982 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,982 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,982 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,983 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,983 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,985 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,985 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:04:27,988 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-20 03:04:28,001 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-20 03:04:28,023 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 03:04:28,023 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 03:04:28,023 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 03:04:28,023 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 03:04:28,023 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 03:04:28,023 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 03:04:28,024 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 03:04:28,024 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 03:04:28,038 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-20 03:04:28,042 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 101 transitions, 217 flow [2020-10-20 03:04:28,045 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 101 transitions, 217 flow [2020-10-20 03:04:28,047 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 108 places, 101 transitions, 217 flow [2020-10-20 03:04:28,097 INFO L129 PetriNetUnfolder]: 3/98 cut-off events. [2020-10-20 03:04:28,098 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-20 03:04:28,103 INFO L80 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 3/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2020-10-20 03:04:28,107 INFO L117 LiptonReduction]: Number of co-enabled transitions 1870 [2020-10-20 03:04:28,270 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-20 03:04:28,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:28,273 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:04:28,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:28,279 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-20 03:04:28,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-20 03:04:28,286 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 03:04:28,286 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:28,361 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:28,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:28,369 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:04:28,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:28,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:04:28,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:28,375 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:04:28,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:04:28,380 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:04:28,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:04:28,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:04:28,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:04:28,387 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 03:04:28,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:28,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:04:28,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:28,394 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:04:28,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:28,741 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:28,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:28,754 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:04:28,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:28,756 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:04:28,756 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:28,760 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:04:28,761 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:04:28,764 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:04:28,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:04:28,766 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:04:28,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:04:28,769 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 03:04:28,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:28,773 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:04:28,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:28,775 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:04:28,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:28,841 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-20 03:04:28,842 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:28,843 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:04:28,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:28,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-20 03:04:28,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-20 03:04:28,850 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 03:04:28,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:28,989 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:28,989 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:28,990 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:28,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:28,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:28,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:04:28,996 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:28,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:04:29,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:29,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:29,017 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:29,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:29,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:29,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:04:29,024 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:29,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:04:29,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:29,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:29,394 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:29,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:29,397 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:29,397 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:04:29,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:29,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:04:29,414 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:29,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:29,415 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:29,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:29,418 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:29,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:04:29,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:29,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:04:29,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:04:29,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:29,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:04:29,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:29,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:04:29,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:29,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:04:29,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:29,565 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:29,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:29,580 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:04:29,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:29,582 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:04:29,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:29,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:04:29,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:04:29,588 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:04:29,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:04:29,589 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:04:29,590 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:04:29,591 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 03:04:29,592 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:29,593 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:04:29,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:29,596 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:04:29,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:29,648 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-20 03:04:29,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:29,649 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:04:29,649 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:29,654 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-20 03:04:29,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-20 03:04:29,657 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 03:04:29,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:30,954 WARN L193 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-10-20 03:04:30,963 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-20 03:04:30,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:30,964 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:04:30,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:31,827 WARN L193 SmtUtils]: Spent 840.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 122 [2020-10-20 03:04:31,937 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:31,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:31,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:31,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:31,942 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:31,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:04:31,945 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:31,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:04:31,975 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:31,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:31,977 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:31,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:31,980 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:31,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:04:31,982 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:31,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:04:32,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:32,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:32,052 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:32,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:32,054 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:32,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:04:32,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:32,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:04:32,073 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:32,074 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:32,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:32,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:32,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:32,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:04:32,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:32,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:04:32,135 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:32,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:32,136 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:32,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:32,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:32,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:04:32,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:32,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:04:32,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:32,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:32,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:32,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:32,161 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:32,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:04:32,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:32,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:04:32,345 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:32,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:32,347 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:32,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:32,349 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:32,349 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:04:32,351 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:32,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:04:32,366 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:32,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:32,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:32,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:32,369 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:32,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:04:32,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:32,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:04:32,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-20 03:04:32,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:04:32,404 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-20 03:04:32,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:32,432 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-20 03:04:32,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:32,433 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term [2020-10-20 03:04:32,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:32,434 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:32,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:32,435 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:32,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:32,437 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:04:32,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:32,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:04:32,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:32,441 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-20 03:04:32,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:32,443 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:04:32,444 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:32,445 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:04:32,446 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:32,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:32,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:32,539 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:32,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:32,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:32,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:04:32,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:32,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:04:32,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:32,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:32,559 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:32,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:32,561 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:32,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:04:32,563 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:32,563 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:04:32,612 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-20 03:04:32,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:32,933 WARN L193 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-20 03:04:33,064 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-20 03:04:33,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:33,252 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:33,253 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:33,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:33,254 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:33,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:04:33,256 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:33,257 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:04:33,272 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:33,272 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:33,273 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:33,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:33,275 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:33,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:33,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:33,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:33,324 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:33,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:33,325 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:33,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:33,330 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:33,331 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:04:33,346 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:33,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:04:33,359 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:33,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:33,361 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:33,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:33,362 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:33,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:33,366 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:33,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:33,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:33,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:33,451 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:33,452 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:33,454 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:33,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:04:33,457 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:33,457 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:04:33,476 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:33,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:33,478 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:33,478 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:33,480 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:33,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:33,482 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:33,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:33,534 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:33,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:33,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:33,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:33,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:33,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:33,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:33,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:33,557 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:33,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:33,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:33,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:33,561 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:33,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:04:33,564 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:33,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:04:33,667 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:33,668 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:33,668 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:33,669 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:33,670 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:33,670 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:33,672 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:33,672 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:33,689 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:33,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:33,691 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:33,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:33,694 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:33,694 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:04:33,697 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:33,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:04:33,856 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:33,857 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:33,858 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:33,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:33,860 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:33,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:33,862 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:33,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:04:33,883 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:33,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:33,885 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:33,885 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:04:33,887 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:04:33,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:04:33,890 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:04:33,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:04:34,843 WARN L193 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2020-10-20 03:04:35,036 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-10-20 03:04:35,048 INFO L132 LiptonReduction]: Checked pairs total: 4899 [2020-10-20 03:04:35,048 INFO L134 LiptonReduction]: Total number of compositions: 89 [2020-10-20 03:04:35,054 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2020-10-20 03:04:35,120 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 974 states. [2020-10-20 03:04:35,123 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states. [2020-10-20 03:04:35,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-20 03:04:35,129 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:04:35,130 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-20 03:04:35,130 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:04:35,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:04:35,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1090369, now seen corresponding path program 1 times [2020-10-20 03:04:35,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:04:35,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097537343] [2020-10-20 03:04:35,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:04:35,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:04:35,367 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 03:04:35,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097537343] [2020-10-20 03:04:35,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:04:35,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-20 03:04:35,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074242623] [2020-10-20 03:04:35,375 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 03:04:35,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:04:35,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 03:04:35,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 03:04:35,395 INFO L87 Difference]: Start difference. First operand 974 states. Second operand 3 states. [2020-10-20 03:04:35,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:04:35,505 INFO L93 Difference]: Finished difference Result 812 states and 2575 transitions. [2020-10-20 03:04:35,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 03:04:35,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-20 03:04:35,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:04:35,545 INFO L225 Difference]: With dead ends: 812 [2020-10-20 03:04:35,545 INFO L226 Difference]: Without dead ends: 687 [2020-10-20 03:04:35,550 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 03:04:35,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2020-10-20 03:04:35,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2020-10-20 03:04:35,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2020-10-20 03:04:35,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 2150 transitions. [2020-10-20 03:04:35,661 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 2150 transitions. Word has length 3 [2020-10-20 03:04:35,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:04:35,661 INFO L481 AbstractCegarLoop]: Abstraction has 687 states and 2150 transitions. [2020-10-20 03:04:35,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 03:04:35,662 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 2150 transitions. [2020-10-20 03:04:35,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-20 03:04:35,665 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:04:35,665 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:04:35,665 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 03:04:35,665 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:04:35,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:04:35,666 INFO L82 PathProgramCache]: Analyzing trace with hash -369742601, now seen corresponding path program 1 times [2020-10-20 03:04:35,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:04:35,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612759880] [2020-10-20 03:04:35,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:04:35,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:04:35,838 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 03:04:35,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612759880] [2020-10-20 03:04:35,838 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:04:35,838 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 03:04:35,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738592987] [2020-10-20 03:04:35,840 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 03:04:35,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:04:35,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 03:04:35,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 03:04:35,841 INFO L87 Difference]: Start difference. First operand 687 states and 2150 transitions. Second operand 4 states. [2020-10-20 03:04:35,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:04:35,948 INFO L93 Difference]: Finished difference Result 802 states and 2417 transitions. [2020-10-20 03:04:35,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 03:04:35,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-20 03:04:35,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:04:35,955 INFO L225 Difference]: With dead ends: 802 [2020-10-20 03:04:35,955 INFO L226 Difference]: Without dead ends: 677 [2020-10-20 03:04:35,956 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 03:04:35,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2020-10-20 03:04:35,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 677. [2020-10-20 03:04:35,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2020-10-20 03:04:35,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 2112 transitions. [2020-10-20 03:04:35,983 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 2112 transitions. Word has length 10 [2020-10-20 03:04:35,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:04:35,984 INFO L481 AbstractCegarLoop]: Abstraction has 677 states and 2112 transitions. [2020-10-20 03:04:35,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 03:04:35,985 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 2112 transitions. [2020-10-20 03:04:35,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-20 03:04:35,987 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:04:35,987 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:04:35,987 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 03:04:35,987 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:04:35,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:04:35,988 INFO L82 PathProgramCache]: Analyzing trace with hash -403301390, now seen corresponding path program 1 times [2020-10-20 03:04:35,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:04:35,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959832194] [2020-10-20 03:04:35,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:04:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:04:36,081 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 03:04:36,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959832194] [2020-10-20 03:04:36,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:04:36,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 03:04:36,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895411754] [2020-10-20 03:04:36,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 03:04:36,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:04:36,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 03:04:36,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 03:04:36,099 INFO L87 Difference]: Start difference. First operand 677 states and 2112 transitions. Second operand 4 states. [2020-10-20 03:04:36,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:04:36,141 INFO L93 Difference]: Finished difference Result 749 states and 2250 transitions. [2020-10-20 03:04:36,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 03:04:36,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-20 03:04:36,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:04:36,147 INFO L225 Difference]: With dead ends: 749 [2020-10-20 03:04:36,148 INFO L226 Difference]: Without dead ends: 629 [2020-10-20 03:04:36,148 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 03:04:36,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-10-20 03:04:36,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2020-10-20 03:04:36,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2020-10-20 03:04:36,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 1940 transitions. [2020-10-20 03:04:36,171 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 1940 transitions. Word has length 11 [2020-10-20 03:04:36,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:04:36,171 INFO L481 AbstractCegarLoop]: Abstraction has 629 states and 1940 transitions. [2020-10-20 03:04:36,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 03:04:36,172 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 1940 transitions. [2020-10-20 03:04:36,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-20 03:04:36,174 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:04:36,174 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:04:36,175 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 03:04:36,175 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:04:36,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:04:36,175 INFO L82 PathProgramCache]: Analyzing trace with hash 382555853, now seen corresponding path program 1 times [2020-10-20 03:04:36,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:04:36,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475872197] [2020-10-20 03:04:36,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:04:36,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:04:36,311 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 03:04:36,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475872197] [2020-10-20 03:04:36,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:04:36,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:04:36,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90913373] [2020-10-20 03:04:36,312 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 03:04:36,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:04:36,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 03:04:36,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 03:04:36,314 INFO L87 Difference]: Start difference. First operand 629 states and 1940 transitions. Second operand 5 states. [2020-10-20 03:04:36,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:04:36,384 INFO L93 Difference]: Finished difference Result 833 states and 2525 transitions. [2020-10-20 03:04:36,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 03:04:36,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-20 03:04:36,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:04:36,389 INFO L225 Difference]: With dead ends: 833 [2020-10-20 03:04:36,389 INFO L226 Difference]: Without dead ends: 437 [2020-10-20 03:04:36,390 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 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 03:04:36,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2020-10-20 03:04:36,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2020-10-20 03:04:36,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2020-10-20 03:04:36,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 1270 transitions. [2020-10-20 03:04:36,406 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 1270 transitions. Word has length 12 [2020-10-20 03:04:36,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:04:36,406 INFO L481 AbstractCegarLoop]: Abstraction has 437 states and 1270 transitions. [2020-10-20 03:04:36,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 03:04:36,406 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 1270 transitions. [2020-10-20 03:04:36,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-20 03:04:36,408 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:04:36,408 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:04:36,409 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 03:04:36,409 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:04:36,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:04:36,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1591368352, now seen corresponding path program 1 times [2020-10-20 03:04:36,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:04:36,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625922573] [2020-10-20 03:04:36,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:04:36,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:04:36,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 03:04:36,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625922573] [2020-10-20 03:04:36,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:04:36,565 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:04:36,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818425515] [2020-10-20 03:04:36,565 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 03:04:36,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:04:36,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 03:04:36,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 03:04:36,570 INFO L87 Difference]: Start difference. First operand 437 states and 1270 transitions. Second operand 5 states. [2020-10-20 03:04:36,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:04:36,704 INFO L93 Difference]: Finished difference Result 523 states and 1480 transitions. [2020-10-20 03:04:36,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 03:04:36,705 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-20 03:04:36,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:04:36,709 INFO L225 Difference]: With dead ends: 523 [2020-10-20 03:04:36,709 INFO L226 Difference]: Without dead ends: 459 [2020-10-20 03:04:36,709 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-20 03:04:36,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2020-10-20 03:04:36,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 459. [2020-10-20 03:04:36,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2020-10-20 03:04:36,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 1328 transitions. [2020-10-20 03:04:36,733 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 1328 transitions. Word has length 13 [2020-10-20 03:04:36,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:04:36,733 INFO L481 AbstractCegarLoop]: Abstraction has 459 states and 1328 transitions. [2020-10-20 03:04:36,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 03:04:36,734 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 1328 transitions. [2020-10-20 03:04:36,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-20 03:04:36,735 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:04:36,735 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:04:36,735 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 03:04:36,736 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:04:36,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:04:36,736 INFO L82 PathProgramCache]: Analyzing trace with hash 2087735349, now seen corresponding path program 1 times [2020-10-20 03:04:36,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:04:36,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280667408] [2020-10-20 03:04:36,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:04:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:04:36,860 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 03:04:36,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280667408] [2020-10-20 03:04:36,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:04:36,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:04:36,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147067530] [2020-10-20 03:04:36,862 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 03:04:36,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:04:36,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 03:04:36,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 03:04:36,863 INFO L87 Difference]: Start difference. First operand 459 states and 1328 transitions. Second operand 5 states. [2020-10-20 03:04:36,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:04:36,973 INFO L93 Difference]: Finished difference Result 511 states and 1449 transitions. [2020-10-20 03:04:36,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 03:04:36,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-20 03:04:36,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:04:36,977 INFO L225 Difference]: With dead ends: 511 [2020-10-20 03:04:36,978 INFO L226 Difference]: Without dead ends: 466 [2020-10-20 03:04:36,978 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-20 03:04:36,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2020-10-20 03:04:36,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 462. [2020-10-20 03:04:36,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2020-10-20 03:04:36,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 1336 transitions. [2020-10-20 03:04:36,992 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 1336 transitions. Word has length 14 [2020-10-20 03:04:36,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:04:36,993 INFO L481 AbstractCegarLoop]: Abstraction has 462 states and 1336 transitions. [2020-10-20 03:04:36,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 03:04:36,993 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 1336 transitions. [2020-10-20 03:04:36,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-20 03:04:36,994 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:04:36,994 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:04:36,994 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 03:04:36,995 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:04:36,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:04:36,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1733371513, now seen corresponding path program 2 times [2020-10-20 03:04:36,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:04:36,995 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916810897] [2020-10-20 03:04:36,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:04:37,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:04:37,088 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 03:04:37,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916810897] [2020-10-20 03:04:37,089 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:04:37,089 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 03:04:37,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382821216] [2020-10-20 03:04:37,090 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 03:04:37,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:04:37,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 03:04:37,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 03:04:37,091 INFO L87 Difference]: Start difference. First operand 462 states and 1336 transitions. Second operand 6 states. [2020-10-20 03:04:37,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:04:37,259 INFO L93 Difference]: Finished difference Result 497 states and 1407 transitions. [2020-10-20 03:04:37,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 03:04:37,260 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-20 03:04:37,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:04:37,263 INFO L225 Difference]: With dead ends: 497 [2020-10-20 03:04:37,263 INFO L226 Difference]: Without dead ends: 450 [2020-10-20 03:04:37,264 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-20 03:04:37,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-10-20 03:04:37,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 441. [2020-10-20 03:04:37,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2020-10-20 03:04:37,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 1268 transitions. [2020-10-20 03:04:37,277 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 1268 transitions. Word has length 14 [2020-10-20 03:04:37,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:04:37,277 INFO L481 AbstractCegarLoop]: Abstraction has 441 states and 1268 transitions. [2020-10-20 03:04:37,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 03:04:37,277 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 1268 transitions. [2020-10-20 03:04:37,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-20 03:04:37,279 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:04:37,279 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:04:37,279 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 03:04:37,279 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:04:37,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:04:37,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1970989686, now seen corresponding path program 1 times [2020-10-20 03:04:37,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:04:37,280 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309091837] [2020-10-20 03:04:37,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:04:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:04:37,426 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 03:04:37,426 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309091837] [2020-10-20 03:04:37,426 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:04:37,427 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 03:04:37,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313280943] [2020-10-20 03:04:37,427 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 03:04:37,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:04:37,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 03:04:37,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-20 03:04:37,428 INFO L87 Difference]: Start difference. First operand 441 states and 1268 transitions. Second operand 7 states. [2020-10-20 03:04:37,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:04:37,583 INFO L93 Difference]: Finished difference Result 465 states and 1308 transitions. [2020-10-20 03:04:37,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 03:04:37,584 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-20 03:04:37,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:04:37,587 INFO L225 Difference]: With dead ends: 465 [2020-10-20 03:04:37,587 INFO L226 Difference]: Without dead ends: 433 [2020-10-20 03:04:37,587 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-10-20 03:04:37,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2020-10-20 03:04:37,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 401. [2020-10-20 03:04:37,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-10-20 03:04:37,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1144 transitions. [2020-10-20 03:04:37,601 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1144 transitions. Word has length 15 [2020-10-20 03:04:37,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:04:37,602 INFO L481 AbstractCegarLoop]: Abstraction has 401 states and 1144 transitions. [2020-10-20 03:04:37,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 03:04:37,602 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1144 transitions. [2020-10-20 03:04:37,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-20 03:04:37,603 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:04:37,603 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:04:37,604 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 03:04:37,604 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:04:37,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:04:37,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1969600080, now seen corresponding path program 1 times [2020-10-20 03:04:37,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:04:37,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252128944] [2020-10-20 03:04:37,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:04:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:04:37,682 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 03:04:37,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252128944] [2020-10-20 03:04:37,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:04:37,683 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 03:04:37,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556212775] [2020-10-20 03:04:37,684 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 03:04:37,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:04:37,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 03:04:37,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-20 03:04:37,685 INFO L87 Difference]: Start difference. First operand 401 states and 1144 transitions. Second operand 6 states. [2020-10-20 03:04:37,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:04:37,820 INFO L93 Difference]: Finished difference Result 488 states and 1380 transitions. [2020-10-20 03:04:37,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 03:04:37,821 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-20 03:04:37,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:04:37,824 INFO L225 Difference]: With dead ends: 488 [2020-10-20 03:04:37,824 INFO L226 Difference]: Without dead ends: 452 [2020-10-20 03:04:37,825 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-20 03:04:37,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2020-10-20 03:04:37,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 416. [2020-10-20 03:04:37,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2020-10-20 03:04:37,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1181 transitions. [2020-10-20 03:04:37,838 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1181 transitions. Word has length 15 [2020-10-20 03:04:37,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:04:37,838 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 1181 transitions. [2020-10-20 03:04:37,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 03:04:37,839 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1181 transitions. [2020-10-20 03:04:37,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-20 03:04:37,840 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:04:37,840 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:04:37,840 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 03:04:37,840 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:04:37,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:04:37,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1971003380, now seen corresponding path program 2 times [2020-10-20 03:04:37,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:04:37,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380933190] [2020-10-20 03:04:37,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:04:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:04:37,956 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 03:04:37,956 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380933190] [2020-10-20 03:04:37,956 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:04:37,956 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 03:04:37,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559577095] [2020-10-20 03:04:37,958 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 03:04:37,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:04:37,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 03:04:37,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-20 03:04:37,959 INFO L87 Difference]: Start difference. First operand 416 states and 1181 transitions. Second operand 7 states. [2020-10-20 03:04:38,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:04:38,133 INFO L93 Difference]: Finished difference Result 506 states and 1415 transitions. [2020-10-20 03:04:38,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 03:04:38,134 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-20 03:04:38,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:04:38,137 INFO L225 Difference]: With dead ends: 506 [2020-10-20 03:04:38,138 INFO L226 Difference]: Without dead ends: 460 [2020-10-20 03:04:38,138 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-10-20 03:04:38,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2020-10-20 03:04:38,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 433. [2020-10-20 03:04:38,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2020-10-20 03:04:38,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 1236 transitions. [2020-10-20 03:04:38,151 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 1236 transitions. Word has length 15 [2020-10-20 03:04:38,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:04:38,151 INFO L481 AbstractCegarLoop]: Abstraction has 433 states and 1236 transitions. [2020-10-20 03:04:38,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 03:04:38,152 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 1236 transitions. [2020-10-20 03:04:38,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:04:38,153 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:04:38,153 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:04:38,153 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-20 03:04:38,153 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:04:38,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:04:38,154 INFO L82 PathProgramCache]: Analyzing trace with hash -928109409, now seen corresponding path program 1 times [2020-10-20 03:04:38,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:04:38,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57270982] [2020-10-20 03:04:38,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:04:38,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:04:38,267 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 03:04:38,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57270982] [2020-10-20 03:04:38,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:04:38,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 03:04:38,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668482511] [2020-10-20 03:04:38,269 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 03:04:38,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:04:38,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 03:04:38,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-20 03:04:38,270 INFO L87 Difference]: Start difference. First operand 433 states and 1236 transitions. Second operand 7 states. [2020-10-20 03:04:38,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:04:38,425 INFO L93 Difference]: Finished difference Result 502 states and 1406 transitions. [2020-10-20 03:04:38,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 03:04:38,425 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-20 03:04:38,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:04:38,429 INFO L225 Difference]: With dead ends: 502 [2020-10-20 03:04:38,429 INFO L226 Difference]: Without dead ends: 478 [2020-10-20 03:04:38,429 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-20 03:04:38,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2020-10-20 03:04:38,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 438. [2020-10-20 03:04:38,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2020-10-20 03:04:38,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1250 transitions. [2020-10-20 03:04:38,441 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1250 transitions. Word has length 16 [2020-10-20 03:04:38,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:04:38,442 INFO L481 AbstractCegarLoop]: Abstraction has 438 states and 1250 transitions. [2020-10-20 03:04:38,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 03:04:38,442 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1250 transitions. [2020-10-20 03:04:38,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:04:38,443 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:04:38,443 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:04:38,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-20 03:04:38,444 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:04:38,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:04:38,444 INFO L82 PathProgramCache]: Analyzing trace with hash -928102682, now seen corresponding path program 1 times [2020-10-20 03:04:38,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:04:38,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513381842] [2020-10-20 03:04:38,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:04:38,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:04:38,572 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 03:04:38,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513381842] [2020-10-20 03:04:38,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:04:38,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 03:04:38,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559162226] [2020-10-20 03:04:38,573 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 03:04:38,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:04:38,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 03:04:38,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-20 03:04:38,574 INFO L87 Difference]: Start difference. First operand 438 states and 1250 transitions. Second operand 7 states. [2020-10-20 03:04:38,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:04:38,758 INFO L93 Difference]: Finished difference Result 586 states and 1622 transitions. [2020-10-20 03:04:38,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 03:04:38,759 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-20 03:04:38,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:04:38,763 INFO L225 Difference]: With dead ends: 586 [2020-10-20 03:04:38,764 INFO L226 Difference]: Without dead ends: 550 [2020-10-20 03:04:38,764 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-20 03:04:38,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-10-20 03:04:38,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 466. [2020-10-20 03:04:38,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2020-10-20 03:04:38,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 1308 transitions. [2020-10-20 03:04:38,784 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 1308 transitions. Word has length 16 [2020-10-20 03:04:38,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:04:38,786 INFO L481 AbstractCegarLoop]: Abstraction has 466 states and 1308 transitions. [2020-10-20 03:04:38,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 03:04:38,786 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 1308 transitions. [2020-10-20 03:04:38,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:04:38,787 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:04:38,788 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:04:38,788 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-20 03:04:38,788 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:04:38,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:04:38,789 INFO L82 PathProgramCache]: Analyzing trace with hash -928533210, now seen corresponding path program 1 times [2020-10-20 03:04:38,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:04:38,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764665347] [2020-10-20 03:04:38,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:04:38,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:04:38,857 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 03:04:38,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764665347] [2020-10-20 03:04:38,858 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:04:38,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 03:04:38,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789148449] [2020-10-20 03:04:38,858 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 03:04:38,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:04:38,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 03:04:38,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-20 03:04:38,859 INFO L87 Difference]: Start difference. First operand 466 states and 1308 transitions. Second operand 6 states. [2020-10-20 03:04:38,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:04:38,972 INFO L93 Difference]: Finished difference Result 753 states and 2077 transitions. [2020-10-20 03:04:38,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 03:04:38,973 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-20 03:04:38,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:04:38,978 INFO L225 Difference]: With dead ends: 753 [2020-10-20 03:04:38,981 INFO L226 Difference]: Without dead ends: 494 [2020-10-20 03:04:38,982 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-20 03:04:38,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2020-10-20 03:04:38,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 446. [2020-10-20 03:04:39,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2020-10-20 03:04:39,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1189 transitions. [2020-10-20 03:04:39,002 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 1189 transitions. Word has length 16 [2020-10-20 03:04:39,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:04:39,002 INFO L481 AbstractCegarLoop]: Abstraction has 446 states and 1189 transitions. [2020-10-20 03:04:39,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 03:04:39,002 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 1189 transitions. [2020-10-20 03:04:39,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:04:39,004 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:04:39,004 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:04:39,004 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-20 03:04:39,004 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:04:39,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:04:39,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1171739132, now seen corresponding path program 2 times [2020-10-20 03:04:39,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:04:39,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823406522] [2020-10-20 03:04:39,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:04:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:04:39,090 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 03:04:39,090 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823406522] [2020-10-20 03:04:39,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:04:39,091 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:04:39,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348198218] [2020-10-20 03:04:39,091 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 03:04:39,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:04:39,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 03:04:39,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 03:04:39,092 INFO L87 Difference]: Start difference. First operand 446 states and 1189 transitions. Second operand 4 states. [2020-10-20 03:04:39,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:04:39,124 INFO L93 Difference]: Finished difference Result 418 states and 994 transitions. [2020-10-20 03:04:39,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 03:04:39,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-20 03:04:39,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:04:39,127 INFO L225 Difference]: With dead ends: 418 [2020-10-20 03:04:39,127 INFO L226 Difference]: Without dead ends: 321 [2020-10-20 03:04:39,128 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 03:04:39,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2020-10-20 03:04:39,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2020-10-20 03:04:39,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2020-10-20 03:04:39,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 751 transitions. [2020-10-20 03:04:39,138 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 751 transitions. Word has length 16 [2020-10-20 03:04:39,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:04:39,138 INFO L481 AbstractCegarLoop]: Abstraction has 321 states and 751 transitions. [2020-10-20 03:04:39,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 03:04:39,139 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 751 transitions. [2020-10-20 03:04:39,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-20 03:04:39,140 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:04:39,140 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 03:04:39,140 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-20 03:04:39,140 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:04:39,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:04:39,141 INFO L82 PathProgramCache]: Analyzing trace with hash 270289429, now seen corresponding path program 1 times [2020-10-20 03:04:39,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:04:39,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053955200] [2020-10-20 03:04:39,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:04:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:04:39,298 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 03:04:39,298 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053955200] [2020-10-20 03:04:39,299 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:04:39,299 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 03:04:39,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547947772] [2020-10-20 03:04:39,300 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 03:04:39,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:04:39,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 03:04:39,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-20 03:04:39,300 INFO L87 Difference]: Start difference. First operand 321 states and 751 transitions. Second operand 7 states. [2020-10-20 03:04:39,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:04:39,455 INFO L93 Difference]: Finished difference Result 352 states and 811 transitions. [2020-10-20 03:04:39,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 03:04:39,456 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-20 03:04:39,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:04:39,458 INFO L225 Difference]: With dead ends: 352 [2020-10-20 03:04:39,458 INFO L226 Difference]: Without dead ends: 335 [2020-10-20 03:04:39,459 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-10-20 03:04:39,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2020-10-20 03:04:39,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 305. [2020-10-20 03:04:39,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2020-10-20 03:04:39,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 710 transitions. [2020-10-20 03:04:39,468 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 710 transitions. Word has length 17 [2020-10-20 03:04:39,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:04:39,468 INFO L481 AbstractCegarLoop]: Abstraction has 305 states and 710 transitions. [2020-10-20 03:04:39,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 03:04:39,468 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 710 transitions. [2020-10-20 03:04:39,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-20 03:04:39,469 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:04:39,470 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 03:04:39,470 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-20 03:04:39,470 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:04:39,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:04:39,470 INFO L82 PathProgramCache]: Analyzing trace with hash 460534755, now seen corresponding path program 1 times [2020-10-20 03:04:39,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:04:39,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107243585] [2020-10-20 03:04:39,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:04:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:04:39,601 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 03:04:39,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107243585] [2020-10-20 03:04:39,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:04:39,602 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 03:04:39,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286483088] [2020-10-20 03:04:39,602 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 03:04:39,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:04:39,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 03:04:39,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-20 03:04:39,603 INFO L87 Difference]: Start difference. First operand 305 states and 710 transitions. Second operand 8 states. [2020-10-20 03:04:39,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:04:39,857 INFO L93 Difference]: Finished difference Result 440 states and 991 transitions. [2020-10-20 03:04:39,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 03:04:39,859 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2020-10-20 03:04:39,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:04:39,861 INFO L225 Difference]: With dead ends: 440 [2020-10-20 03:04:39,861 INFO L226 Difference]: Without dead ends: 329 [2020-10-20 03:04:39,862 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-10-20 03:04:39,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2020-10-20 03:04:39,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 299. [2020-10-20 03:04:39,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2020-10-20 03:04:39,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 690 transitions. [2020-10-20 03:04:39,870 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 690 transitions. Word has length 17 [2020-10-20 03:04:39,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:04:39,871 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 690 transitions. [2020-10-20 03:04:39,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 03:04:39,871 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 690 transitions. [2020-10-20 03:04:39,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-20 03:04:39,872 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:04:39,872 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 03:04:39,872 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-20 03:04:39,872 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:04:39,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:04:39,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1009884994, now seen corresponding path program 1 times [2020-10-20 03:04:39,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:04:39,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760060441] [2020-10-20 03:04:39,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:04:39,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:04:39,939 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 03:04:39,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760060441] [2020-10-20 03:04:39,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:04:39,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 03:04:39,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026279392] [2020-10-20 03:04:39,940 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 03:04:39,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:04:39,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 03:04:39,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 03:04:39,941 INFO L87 Difference]: Start difference. First operand 299 states and 690 transitions. Second operand 5 states. [2020-10-20 03:04:39,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:04:39,988 INFO L93 Difference]: Finished difference Result 245 states and 505 transitions. [2020-10-20 03:04:39,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 03:04:39,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-20 03:04:39,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:04:39,990 INFO L225 Difference]: With dead ends: 245 [2020-10-20 03:04:39,990 INFO L226 Difference]: Without dead ends: 193 [2020-10-20 03:04:39,990 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-20 03:04:39,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2020-10-20 03:04:39,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2020-10-20 03:04:39,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-10-20 03:04:39,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 388 transitions. [2020-10-20 03:04:39,995 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 388 transitions. Word has length 17 [2020-10-20 03:04:39,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:04:39,996 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 388 transitions. [2020-10-20 03:04:39,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 03:04:39,996 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 388 transitions. [2020-10-20 03:04:39,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-20 03:04:39,997 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:04:39,997 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 03:04:39,997 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-20 03:04:39,997 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:04:39,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:04:39,998 INFO L82 PathProgramCache]: Analyzing trace with hash 461994248, now seen corresponding path program 1 times [2020-10-20 03:04:39,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:04:39,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545284433] [2020-10-20 03:04:39,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:04:40,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:04:40,141 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 03:04:40,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545284433] [2020-10-20 03:04:40,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:04:40,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 03:04:40,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727639240] [2020-10-20 03:04:40,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 03:04:40,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:04:40,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 03:04:40,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-20 03:04:40,143 INFO L87 Difference]: Start difference. First operand 193 states and 388 transitions. Second operand 8 states. [2020-10-20 03:04:40,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:04:40,360 INFO L93 Difference]: Finished difference Result 219 states and 425 transitions. [2020-10-20 03:04:40,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 03:04:40,361 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-10-20 03:04:40,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:04:40,363 INFO L225 Difference]: With dead ends: 219 [2020-10-20 03:04:40,363 INFO L226 Difference]: Without dead ends: 145 [2020-10-20 03:04:40,363 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-10-20 03:04:40,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-10-20 03:04:40,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 131. [2020-10-20 03:04:40,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-10-20 03:04:40,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 262 transitions. [2020-10-20 03:04:40,369 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 262 transitions. Word has length 19 [2020-10-20 03:04:40,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:04:40,369 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 262 transitions. [2020-10-20 03:04:40,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 03:04:40,370 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 262 transitions. [2020-10-20 03:04:40,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-20 03:04:40,370 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:04:40,371 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 03:04:40,371 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-20 03:04:40,371 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:04:40,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:04:40,371 INFO L82 PathProgramCache]: Analyzing trace with hash -660289219, now seen corresponding path program 1 times [2020-10-20 03:04:40,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:04:40,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176165117] [2020-10-20 03:04:40,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:04:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:04:40,455 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 03:04:40,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176165117] [2020-10-20 03:04:40,456 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:04:40,456 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 03:04:40,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986338219] [2020-10-20 03:04:40,457 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 03:04:40,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:04:40,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 03:04:40,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-20 03:04:40,457 INFO L87 Difference]: Start difference. First operand 131 states and 262 transitions. Second operand 6 states. [2020-10-20 03:04:40,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:04:40,518 INFO L93 Difference]: Finished difference Result 112 states and 223 transitions. [2020-10-20 03:04:40,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 03:04:40,519 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-20 03:04:40,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:04:40,520 INFO L225 Difference]: With dead ends: 112 [2020-10-20 03:04:40,520 INFO L226 Difference]: Without dead ends: 63 [2020-10-20 03:04:40,521 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-20 03:04:40,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-20 03:04:40,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-10-20 03:04:40,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-20 03:04:40,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 110 transitions. [2020-10-20 03:04:40,524 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 110 transitions. Word has length 19 [2020-10-20 03:04:40,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:04:40,524 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 110 transitions. [2020-10-20 03:04:40,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 03:04:40,525 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 110 transitions. [2020-10-20 03:04:40,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:04:40,525 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:04:40,526 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:04:40,526 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-20 03:04:40,526 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:04:40,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:04:40,527 INFO L82 PathProgramCache]: Analyzing trace with hash -2015795615, now seen corresponding path program 1 times [2020-10-20 03:04:40,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:04:40,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425632406] [2020-10-20 03:04:40,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:04:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 03:04:40,586 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 03:04:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 03:04:40,637 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 03:04:40,682 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 03:04:40,682 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 03:04:40,682 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-20 03:04:40,709 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,710 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [740] [2020-10-20 03:04:40,712 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,713 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,713 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,713 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,713 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,713 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,714 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,714 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,714 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,714 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,714 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,714 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,715 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,716 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,716 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,716 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,716 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,716 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,717 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,717 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,717 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,717 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,718 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,718 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,718 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,718 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,719 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,719 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,719 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,719 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,719 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,719 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,720 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,720 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,720 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,721 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,721 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,721 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,721 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,721 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,721 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,721 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,722 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,722 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,722 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,722 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,722 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,723 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,723 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,723 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,723 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,723 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,723 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,724 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,724 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,724 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,724 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,724 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,724 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,725 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,725 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,725 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,725 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,725 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 03:04:40 BasicIcfg [2020-10-20 03:04:40,810 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 03:04:40,811 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 03:04:40,811 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 03:04:40,811 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 03:04:40,812 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 03:04:27" (3/4) ... [2020-10-20 03:04:40,815 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-20 03:04:40,826 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,827 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [740] [2020-10-20 03:04:40,827 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,828 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,828 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,828 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,828 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,828 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,828 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,828 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,828 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,828 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,829 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,829 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,829 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,829 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,830 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,830 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,830 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,830 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,830 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,830 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,830 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,830 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,831 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,831 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,831 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,831 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,831 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,831 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,831 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,832 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,832 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,832 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,832 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,832 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,832 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,832 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,832 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,833 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,833 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,833 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,833 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,833 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,833 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,833 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,833 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,834 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,834 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,834 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,834 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,834 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,834 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,834 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,834 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,835 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,835 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,835 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,835 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,835 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,835 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,835 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,836 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,836 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,836 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:04:40,836 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:04:40,927 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 03:04:40,928 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 03:04:40,929 INFO L168 Benchmark]: Toolchain (without parser) took 16263.60 ms. Allocated memory was 39.3 MB in the beginning and 135.3 MB in the end (delta: 95.9 MB). Free memory was 15.8 MB in the beginning and 47.5 MB in the end (delta: -31.7 MB). Peak memory consumption was 64.2 MB. Max. memory is 14.3 GB. [2020-10-20 03:04:40,930 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 30.9 MB. Free memory was 6.7 MB in the beginning and 6.7 MB in the end (delta: 43.7 kB). Peak memory consumption was 43.7 kB. Max. memory is 14.3 GB. [2020-10-20 03:04:40,930 INFO L168 Benchmark]: CACSL2BoogieTranslator took 745.37 ms. Allocated memory was 39.3 MB in the beginning and 42.5 MB in the end (delta: 3.1 MB). Free memory was 15.0 MB in the beginning and 21.7 MB in the end (delta: -6.7 MB). Peak memory consumption was 9.1 MB. Max. memory is 14.3 GB. [2020-10-20 03:04:40,930 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.45 ms. Allocated memory is still 42.5 MB. Free memory was 21.4 MB in the beginning and 18.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 14.3 GB. [2020-10-20 03:04:40,931 INFO L168 Benchmark]: Boogie Preprocessor took 45.25 ms. Allocated memory is still 42.5 MB. Free memory was 18.5 MB in the beginning and 15.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 14.3 GB. [2020-10-20 03:04:40,931 INFO L168 Benchmark]: RCFGBuilder took 2341.32 ms. Allocated memory was 42.5 MB in the beginning and 64.5 MB in the end (delta: 22.0 MB). Free memory was 15.9 MB in the beginning and 41.4 MB in the end (delta: -25.5 MB). Peak memory consumption was 26.1 MB. Max. memory is 14.3 GB. [2020-10-20 03:04:40,932 INFO L168 Benchmark]: TraceAbstraction took 12916.67 ms. Allocated memory was 64.5 MB in the beginning and 135.3 MB in the end (delta: 70.8 MB). Free memory was 40.8 MB in the beginning and 66.9 MB in the end (delta: -26.1 MB). Peak memory consumption was 44.7 MB. Max. memory is 14.3 GB. [2020-10-20 03:04:40,932 INFO L168 Benchmark]: Witness Printer took 116.81 ms. Allocated memory is still 135.3 MB. Free memory was 66.9 MB in the beginning and 47.5 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 14.3 GB. [2020-10-20 03:04:40,935 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.21 ms. Allocated memory is still 30.9 MB. Free memory was 6.7 MB in the beginning and 6.7 MB in the end (delta: 43.7 kB). Peak memory consumption was 43.7 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 745.37 ms. Allocated memory was 39.3 MB in the beginning and 42.5 MB in the end (delta: 3.1 MB). Free memory was 15.0 MB in the beginning and 21.7 MB in the end (delta: -6.7 MB). Peak memory consumption was 9.1 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 86.45 ms. Allocated memory is still 42.5 MB. Free memory was 21.4 MB in the beginning and 18.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 45.25 ms. Allocated memory is still 42.5 MB. Free memory was 18.5 MB in the beginning and 15.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 14.3 GB. * RCFGBuilder took 2341.32 ms. Allocated memory was 42.5 MB in the beginning and 64.5 MB in the end (delta: 22.0 MB). Free memory was 15.9 MB in the beginning and 41.4 MB in the end (delta: -25.5 MB). Peak memory consumption was 26.1 MB. Max. memory is 14.3 GB. * TraceAbstraction took 12916.67 ms. Allocated memory was 64.5 MB in the beginning and 135.3 MB in the end (delta: 70.8 MB). Free memory was 40.8 MB in the beginning and 66.9 MB in the end (delta: -26.1 MB). Peak memory consumption was 44.7 MB. Max. memory is 14.3 GB. * Witness Printer took 116.81 ms. Allocated memory is still 135.3 MB. Free memory was 66.9 MB in the beginning and 47.5 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1325 VarBasedMoverChecksPositive, 70 VarBasedMoverChecksNegative, 23 SemBasedMoverChecksPositive, 47 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 170 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.0s, 108 PlacesBefore, 37 PlacesAfterwards, 101 TransitionsBefore, 28 TransitionsAfterwards, 1870 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 89 TotalNumberOfCompositions, 4899 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2040; [L819] FCALL, FORK 0 pthread_create(&t2040, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2041; [L821] FCALL, FORK 0 pthread_create(&t2041, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 0 pthread_t t2042; [L823] FCALL, FORK 0 pthread_create(&t2042, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L793] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L831] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L842] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L842] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe011_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 99 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.6s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.0s, HoareTripleCheckerStatistics: 489 SDtfs, 657 SDslu, 1100 SDs, 0 SdLazy, 732 SolverSat, 216 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=974occurred 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.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 354 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 297 NumberOfCodeBlocks, 297 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 256 ConstructedInterpolants, 0 QuantifiedInterpolants, 34569 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 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 incorrect! Received shutdown request...