./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe030_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 54858612 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.5.800.v20200727-1323.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/safe030_pso.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 67f75038da5597fb60fd0aa63a920af562c2c67b ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.2.0-5485861 [2020-10-26 00:33:16,526 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 00:33:16,530 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 00:33:16,568 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 00:33:16,568 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 00:33:16,570 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 00:33:16,572 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 00:33:16,575 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 00:33:16,577 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 00:33:16,578 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 00:33:16,580 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 00:33:16,582 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 00:33:16,582 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 00:33:16,584 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 00:33:16,585 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 00:33:16,587 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 00:33:16,588 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 00:33:16,589 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 00:33:16,591 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 00:33:16,593 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 00:33:16,595 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 00:33:16,599 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 00:33:16,600 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 00:33:16,601 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 00:33:16,605 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 00:33:16,605 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 00:33:16,606 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 00:33:16,607 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 00:33:16,608 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 00:33:16,609 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 00:33:16,609 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 00:33:16,610 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 00:33:16,611 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 00:33:16,612 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 00:33:16,614 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 00:33:16,614 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 00:33:16,615 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 00:33:16,616 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 00:33:16,616 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 00:33:16,618 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 00:33:16,619 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 00:33:16,620 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-26 00:33:16,657 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 00:33:16,658 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 00:33:16,659 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 00:33:16,660 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 00:33:16,660 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 00:33:16,660 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 00:33:16,661 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 00:33:16,661 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 00:33:16,661 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 00:33:16,662 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 00:33:16,662 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-26 00:33:16,662 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-26 00:33:16,663 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-26 00:33:16,663 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 00:33:16,663 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 00:33:16,663 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 00:33:16,664 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-26 00:33:16,664 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 00:33:16,664 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 00:33:16,665 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-26 00:33:16,665 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-26 00:33:16,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-26 00:33:16,665 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 00:33:16,666 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-26 00:33:16,666 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-26 00:33:16,666 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 00:33:16,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-26 00:33:16,667 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-26 00:33:16,667 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 00:33:16,667 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 67f75038da5597fb60fd0aa63a920af562c2c67b [2020-10-26 00:33:17,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 00:33:17,089 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 00:33:17,093 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 00:33:17,095 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 00:33:17,097 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 00:33:17,099 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe030_pso.opt.i [2020-10-26 00:33:17,198 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/924dc6f41/1eb3bfbce09344269d6502221e1d34e1/FLAG1789ccb53 [2020-10-26 00:33:17,933 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 00:33:17,933 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe030_pso.opt.i [2020-10-26 00:33:17,977 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/924dc6f41/1eb3bfbce09344269d6502221e1d34e1/FLAG1789ccb53 [2020-10-26 00:33:18,140 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/924dc6f41/1eb3bfbce09344269d6502221e1d34e1 [2020-10-26 00:33:18,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 00:33:18,158 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 00:33:18,161 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 00:33:18,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 00:33:18,166 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 00:33:18,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 12:33:18" (1/1) ... [2020-10-26 00:33:18,173 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3477ff05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:33:18, skipping insertion in model container [2020-10-26 00:33:18,173 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 12:33:18" (1/1) ... [2020-10-26 00:33:18,183 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 00:33:18,265 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 00:33:18,806 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 00:33:18,817 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 00:33:18,892 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 00:33:19,009 INFO L208 MainTranslator]: Completed translation [2020-10-26 00:33:19,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:33:19 WrapperNode [2020-10-26 00:33:19,010 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 00:33:19,012 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 00:33:19,012 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 00:33:19,012 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 00:33:19,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:33:19" (1/1) ... [2020-10-26 00:33:19,055 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:33:19" (1/1) ... [2020-10-26 00:33:19,117 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 00:33:19,121 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 00:33:19,123 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 00:33:19,123 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 00:33:19,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:33:19" (1/1) ... [2020-10-26 00:33:19,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:33:19" (1/1) ... [2020-10-26 00:33:19,151 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:33:19" (1/1) ... [2020-10-26 00:33:19,157 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:33:19" (1/1) ... [2020-10-26 00:33:19,180 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:33:19" (1/1) ... [2020-10-26 00:33:19,188 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:33:19" (1/1) ... [2020-10-26 00:33:19,200 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:33:19" (1/1) ... [2020-10-26 00:33:19,212 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 00:33:19,213 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 00:33:19,213 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 00:33:19,214 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 00:33:19,215 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:33:19" (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-26 00:33:19,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-26 00:33:19,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-26 00:33:19,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 00:33:19,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-26 00:33:19,285 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-26 00:33:19,285 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-26 00:33:19,285 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-26 00:33:19,285 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-26 00:33:19,286 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-26 00:33:19,286 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-26 00:33:19,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 00:33:19,286 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-26 00:33:19,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 00:33:19,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 00:33:19,289 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-26 00:33:21,582 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 00:33:21,582 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-26 00:33:21,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 12:33:21 BoogieIcfgContainer [2020-10-26 00:33:21,585 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 00:33:21,587 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-26 00:33:21,588 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-26 00:33:21,591 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-26 00:33:21,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 12:33:18" (1/3) ... [2020-10-26 00:33:21,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b0aae0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 12:33:21, skipping insertion in model container [2020-10-26 00:33:21,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:33:19" (2/3) ... [2020-10-26 00:33:21,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b0aae0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 12:33:21, skipping insertion in model container [2020-10-26 00:33:21,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 12:33:21" (3/3) ... [2020-10-26 00:33:21,596 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_pso.opt.i [2020-10-26 00:33:21,609 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-26 00:33:21,610 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-26 00:33:21,616 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-26 00:33:21,617 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-26 00:33:21,653 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,653 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,653 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,654 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,654 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,656 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,656 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,656 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,656 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,660 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,661 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,662 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,663 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,664 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,664 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,664 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,665 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,665 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,665 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,665 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,669 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,670 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,670 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,670 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,671 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,671 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,671 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,672 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,672 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,672 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,672 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,673 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,673 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,673 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,679 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,679 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,679 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,679 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,682 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,682 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,683 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,683 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,683 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,683 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,683 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:21,686 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-26 00:33:21,700 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-26 00:33:21,726 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-26 00:33:21,727 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-26 00:33:21,727 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-26 00:33:21,727 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 00:33:21,727 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 00:33:21,728 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-26 00:33:21,728 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 00:33:21,728 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-26 00:33:21,744 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-26 00:33:21,747 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 99 transitions, 213 flow [2020-10-26 00:33:21,752 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 99 transitions, 213 flow [2020-10-26 00:33:21,754 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 106 places, 99 transitions, 213 flow [2020-10-26 00:33:21,809 INFO L129 PetriNetUnfolder]: 3/96 cut-off events. [2020-10-26 00:33:21,809 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-26 00:33:21,814 INFO L80 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 3/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2020-10-26 00:33:21,821 INFO L116 LiptonReduction]: Number of co-enabled transitions 1746 [2020-10-26 00:33:21,984 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:33:21,984 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:21,988 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-26 00:33:21,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:22,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:33:22,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:22,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-10-26 00:33:22,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:22,187 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:33:22,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:22,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:22,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:22,194 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:22,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:22,200 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:22,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:33:22,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:22,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:33:22,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:22,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:33:22,213 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:33:22,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:22,215 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-26 00:33:22,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:22,218 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-26 00:33:22,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:22,285 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:33:22,286 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:22,287 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-26 00:33:22,287 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:22,291 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-26 00:33:22,291 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-26 00:33:22,295 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:33:22,295 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:22,397 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:33:22,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:22,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-26 00:33:22,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:22,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-26 00:33:22,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-26 00:33:22,406 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:33:22,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:22,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:33:22,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:22,464 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:22,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:22,466 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:22,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:22,469 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:22,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:33:22,473 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:22,473 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:33:22,475 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:22,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:33:22,477 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:33:22,478 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:22,480 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-26 00:33:22,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:22,483 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-26 00:33:22,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:22,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:33:22,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:22,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-26 00:33:22,605 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:22,629 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:33:22,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:22,631 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-26 00:33:22,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:24,109 WARN L193 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-10-26 00:33:24,126 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-26 00:33:24,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:24,127 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-26 00:33:24,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:25,520 WARN L193 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 142 DAG size of output: 122 [2020-10-26 00:33:25,815 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-10-26 00:33:26,299 WARN L193 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-26 00:33:26,416 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-26 00:33:26,448 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:33:26,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:26,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-26 00:33:26,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:26,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:33:26,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:26,485 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-26 00:33:26,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:26,556 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:33:26,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:26,566 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:26,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:26,569 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:26,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:26,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:26,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:33:26,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:26,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:33:26,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:26,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:33:26,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:33:26,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:26,590 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-26 00:33:26,590 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:26,593 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-26 00:33:26,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:26,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:33:26,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:26,649 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-26 00:33:26,649 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:26,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-26 00:33:26,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-26 00:33:26,656 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:33:26,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:26,866 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-26 00:33:26,867 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:26,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term [2020-10-26 00:33:26,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:26,869 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:26,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:26,872 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:26,873 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:26,876 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:26,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:26,878 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:26,879 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:26,881 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-26 00:33:26,882 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:26,883 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-26 00:33:26,883 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:26,885 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-26 00:33:26,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:26,909 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-26 00:33:26,909 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:33:26,912 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-26 00:33:26,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:27,161 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-26 00:33:27,299 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-26 00:33:27,375 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-26 00:33:27,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:33:27,378 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-26 00:33:27,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:27,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-26 00:33:27,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:27,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term [2020-10-26 00:33:27,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:27,400 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:27,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:27,406 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:27,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:27,410 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:27,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:27,412 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:27,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:27,414 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-26 00:33:27,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:27,417 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-26 00:33:27,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:27,419 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-26 00:33:27,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:27,569 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-26 00:33:27,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:27,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-26 00:33:27,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:27,644 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term [2020-10-26 00:33:27,645 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:27,646 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:27,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:27,649 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:27,649 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:27,666 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:27,666 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:27,669 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:27,669 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:27,673 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-26 00:33:27,674 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:27,676 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-26 00:33:27,677 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:27,678 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-26 00:33:27,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:27,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-26 00:33:27,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:33:27,705 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-26 00:33:27,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:28,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-26 00:33:28,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:33:28,406 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-26 00:33:28,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:28,429 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-26 00:33:28,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:28,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term [2020-10-26 00:33:28,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:28,432 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:28,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:28,434 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:28,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:28,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-26 00:33:28,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:28,443 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:28,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:28,445 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-26 00:33:28,446 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:28,448 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-26 00:33:28,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:28,451 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-26 00:33:28,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:29,498 WARN L193 SmtUtils]: Spent 799.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 124 [2020-10-26 00:33:29,833 WARN L193 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-26 00:33:30,910 WARN L193 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 125 DAG size of output: 108 [2020-10-26 00:33:31,258 WARN L193 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-10-26 00:33:32,058 WARN L193 SmtUtils]: Spent 798.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 108 [2020-10-26 00:33:32,457 WARN L193 SmtUtils]: Spent 396.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-10-26 00:33:32,746 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-10-26 00:33:32,857 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-10-26 00:33:33,211 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-26 00:33:33,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:33,409 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-10-26 00:33:33,602 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-26 00:33:33,640 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-26 00:33:33,640 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:34,207 WARN L193 SmtUtils]: Spent 522.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-10-26 00:33:34,650 WARN L193 SmtUtils]: Spent 439.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-10-26 00:33:34,675 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:33:34,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:34,676 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:34,677 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:34,679 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:34,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:34,684 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:33:34,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:34,711 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:34,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:34,715 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:34,715 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:34,717 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:34,718 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:33:34,719 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:33:34,720 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:33:34,745 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:33:34,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:34,747 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:34,747 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:34,749 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:34,749 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:33:34,751 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:33:34,752 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:33:34,766 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:33:34,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:34,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:34,768 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:34,769 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:34,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:34,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:33:34,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:35,334 WARN L193 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 110 [2020-10-26 00:33:35,548 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-10-26 00:33:35,601 INFO L131 LiptonReduction]: Checked pairs total: 4967 [2020-10-26 00:33:35,601 INFO L133 LiptonReduction]: Total number of compositions: 93 [2020-10-26 00:33:35,607 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 26 transitions, 67 flow [2020-10-26 00:33:35,659 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 650 states. [2020-10-26 00:33:35,661 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states. [2020-10-26 00:33:35,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-26 00:33:35,668 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:35,668 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:33:35,669 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:35,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:35,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1674161771, now seen corresponding path program 1 times [2020-10-26 00:33:35,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:35,686 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10051069] [2020-10-26 00:33:35,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:35,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33:35,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-26 00:33:35,957 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10051069] [2020-10-26 00:33:35,957 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:35,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-26 00:33:35,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154357205] [2020-10-26 00:33:35,964 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-26 00:33:35,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:35,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 00:33:35,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 00:33:35,983 INFO L87 Difference]: Start difference. First operand 650 states. Second operand 3 states. [2020-10-26 00:33:36,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:36,110 INFO L93 Difference]: Finished difference Result 550 states and 1693 transitions. [2020-10-26 00:33:36,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 00:33:36,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-26 00:33:36,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:36,146 INFO L225 Difference]: With dead ends: 550 [2020-10-26 00:33:36,147 INFO L226 Difference]: Without dead ends: 450 [2020-10-26 00:33:36,148 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-26 00:33:36,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-10-26 00:33:36,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2020-10-26 00:33:36,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-10-26 00:33:36,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions. [2020-10-26 00:33:36,288 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 7 [2020-10-26 00:33:36,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:36,289 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions. [2020-10-26 00:33:36,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-26 00:33:36,290 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions. [2020-10-26 00:33:36,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-26 00:33:36,292 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:36,292 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:33:36,293 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-26 00:33:36,293 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:36,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:36,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1743214513, now seen corresponding path program 1 times [2020-10-26 00:33:36,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:36,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962237816] [2020-10-26 00:33:36,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:36,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33:36,436 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-26 00:33:36,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962237816] [2020-10-26 00:33:36,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:36,437 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-26 00:33:36,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725751909] [2020-10-26 00:33:36,439 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-26 00:33:36,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:36,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 00:33:36,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 00:33:36,440 INFO L87 Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand 3 states. [2020-10-26 00:33:36,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:36,524 INFO L93 Difference]: Finished difference Result 445 states and 1339 transitions. [2020-10-26 00:33:36,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 00:33:36,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-26 00:33:36,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:36,531 INFO L225 Difference]: With dead ends: 445 [2020-10-26 00:33:36,531 INFO L226 Difference]: Without dead ends: 445 [2020-10-26 00:33:36,532 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-26 00:33:36,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2020-10-26 00:33:36,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2020-10-26 00:33:36,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2020-10-26 00:33:36,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1339 transitions. [2020-10-26 00:33:36,555 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1339 transitions. Word has length 9 [2020-10-26 00:33:36,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:36,555 INFO L481 AbstractCegarLoop]: Abstraction has 445 states and 1339 transitions. [2020-10-26 00:33:36,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-26 00:33:36,555 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1339 transitions. [2020-10-26 00:33:36,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-26 00:33:36,559 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:36,559 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:33:36,559 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-26 00:33:36,559 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:36,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:36,560 INFO L82 PathProgramCache]: Analyzing trace with hash 79771207, now seen corresponding path program 1 times [2020-10-26 00:33:36,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:36,560 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065875900] [2020-10-26 00:33:36,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:36,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33:36,729 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-26 00:33:36,730 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065875900] [2020-10-26 00:33:36,730 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:36,731 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-26 00:33:36,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984035159] [2020-10-26 00:33:36,732 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-26 00:33:36,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:36,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 00:33:36,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 00:33:36,733 INFO L87 Difference]: Start difference. First operand 445 states and 1339 transitions. Second operand 3 states. [2020-10-26 00:33:36,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:36,773 INFO L93 Difference]: Finished difference Result 444 states and 1335 transitions. [2020-10-26 00:33:36,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 00:33:36,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-26 00:33:36,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:36,779 INFO L225 Difference]: With dead ends: 444 [2020-10-26 00:33:36,780 INFO L226 Difference]: Without dead ends: 444 [2020-10-26 00:33:36,780 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-26 00:33:36,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2020-10-26 00:33:36,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2020-10-26 00:33:36,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2020-10-26 00:33:36,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1335 transitions. [2020-10-26 00:33:36,798 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1335 transitions. Word has length 10 [2020-10-26 00:33:36,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:36,798 INFO L481 AbstractCegarLoop]: Abstraction has 444 states and 1335 transitions. [2020-10-26 00:33:36,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-26 00:33:36,799 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1335 transitions. [2020-10-26 00:33:36,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-26 00:33:36,800 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:36,800 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:33:36,800 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-26 00:33:36,801 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:36,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:36,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1794923896, now seen corresponding path program 1 times [2020-10-26 00:33:36,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:36,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221445296] [2020-10-26 00:33:36,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:36,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33:36,919 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-26 00:33:36,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221445296] [2020-10-26 00:33:36,920 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:36,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-26 00:33:36,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695625066] [2020-10-26 00:33:36,920 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-26 00:33:36,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:36,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 00:33:36,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 00:33:36,921 INFO L87 Difference]: Start difference. First operand 444 states and 1335 transitions. Second operand 3 states. [2020-10-26 00:33:36,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:36,937 INFO L93 Difference]: Finished difference Result 439 states and 1316 transitions. [2020-10-26 00:33:36,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 00:33:36,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-26 00:33:36,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:36,942 INFO L225 Difference]: With dead ends: 439 [2020-10-26 00:33:36,943 INFO L226 Difference]: Without dead ends: 439 [2020-10-26 00:33:36,943 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-26 00:33:36,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2020-10-26 00:33:36,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2020-10-26 00:33:36,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2020-10-26 00:33:36,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 1316 transitions. [2020-10-26 00:33:36,960 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 1316 transitions. Word has length 10 [2020-10-26 00:33:36,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:36,960 INFO L481 AbstractCegarLoop]: Abstraction has 439 states and 1316 transitions. [2020-10-26 00:33:36,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-26 00:33:36,961 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 1316 transitions. [2020-10-26 00:33:36,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-26 00:33:36,962 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:36,962 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:33:36,963 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-26 00:33:36,963 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:36,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:36,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1822060928, now seen corresponding path program 1 times [2020-10-26 00:33:36,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:36,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696700209] [2020-10-26 00:33:36,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33:37,014 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-26 00:33:37,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696700209] [2020-10-26 00:33:37,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:37,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-26 00:33:37,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393467262] [2020-10-26 00:33:37,016 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-26 00:33:37,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:37,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 00:33:37,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 00:33:37,017 INFO L87 Difference]: Start difference. First operand 439 states and 1316 transitions. Second operand 3 states. [2020-10-26 00:33:37,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:37,032 INFO L93 Difference]: Finished difference Result 432 states and 1290 transitions. [2020-10-26 00:33:37,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 00:33:37,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-26 00:33:37,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:37,038 INFO L225 Difference]: With dead ends: 432 [2020-10-26 00:33:37,038 INFO L226 Difference]: Without dead ends: 432 [2020-10-26 00:33:37,039 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-26 00:33:37,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2020-10-26 00:33:37,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2020-10-26 00:33:37,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2020-10-26 00:33:37,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 1290 transitions. [2020-10-26 00:33:37,056 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 1290 transitions. Word has length 11 [2020-10-26 00:33:37,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:37,056 INFO L481 AbstractCegarLoop]: Abstraction has 432 states and 1290 transitions. [2020-10-26 00:33:37,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-26 00:33:37,057 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 1290 transitions. [2020-10-26 00:33:37,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-26 00:33:37,058 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:37,058 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:33:37,059 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-26 00:33:37,059 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:37,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:37,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1822060866, now seen corresponding path program 1 times [2020-10-26 00:33:37,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:37,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374521518] [2020-10-26 00:33:37,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33:37,148 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-26 00:33:37,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374521518] [2020-10-26 00:33:37,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:37,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-26 00:33:37,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142676344] [2020-10-26 00:33:37,149 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 00:33:37,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:37,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 00:33:37,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-26 00:33:37,151 INFO L87 Difference]: Start difference. First operand 432 states and 1290 transitions. Second operand 4 states. [2020-10-26 00:33:37,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:37,231 INFO L93 Difference]: Finished difference Result 427 states and 1272 transitions. [2020-10-26 00:33:37,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 00:33:37,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-26 00:33:37,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:37,236 INFO L225 Difference]: With dead ends: 427 [2020-10-26 00:33:37,237 INFO L226 Difference]: Without dead ends: 427 [2020-10-26 00:33:37,238 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-26 00:33:37,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2020-10-26 00:33:37,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2020-10-26 00:33:37,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2020-10-26 00:33:37,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1272 transitions. [2020-10-26 00:33:37,253 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1272 transitions. Word has length 11 [2020-10-26 00:33:37,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:37,253 INFO L481 AbstractCegarLoop]: Abstraction has 427 states and 1272 transitions. [2020-10-26 00:33:37,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 00:33:37,253 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1272 transitions. [2020-10-26 00:33:37,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-26 00:33:37,256 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:37,256 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:33:37,256 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-26 00:33:37,256 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:37,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:37,257 INFO L82 PathProgramCache]: Analyzing trace with hash -649314907, now seen corresponding path program 1 times [2020-10-26 00:33:37,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:37,258 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017619410] [2020-10-26 00:33:37,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:37,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33:37,567 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-26 00:33:37,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017619410] [2020-10-26 00:33:37,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:37,567 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 00:33:37,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738962180] [2020-10-26 00:33:37,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-26 00:33:37,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:37,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 00:33:37,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-26 00:33:37,569 INFO L87 Difference]: Start difference. First operand 427 states and 1272 transitions. Second operand 5 states. [2020-10-26 00:33:37,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:37,658 INFO L93 Difference]: Finished difference Result 416 states and 1232 transitions. [2020-10-26 00:33:37,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 00:33:37,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-26 00:33:37,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:37,664 INFO L225 Difference]: With dead ends: 416 [2020-10-26 00:33:37,665 INFO L226 Difference]: Without dead ends: 416 [2020-10-26 00:33:37,666 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-26 00:33:37,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2020-10-26 00:33:37,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2020-10-26 00:33:37,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2020-10-26 00:33:37,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1232 transitions. [2020-10-26 00:33:37,684 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1232 transitions. Word has length 12 [2020-10-26 00:33:37,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:37,684 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 1232 transitions. [2020-10-26 00:33:37,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-26 00:33:37,684 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1232 transitions. [2020-10-26 00:33:37,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-26 00:33:37,686 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:37,686 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:33:37,687 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-26 00:33:37,687 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:37,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:37,688 INFO L82 PathProgramCache]: Analyzing trace with hash -649314070, now seen corresponding path program 1 times [2020-10-26 00:33:37,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:37,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11331956] [2020-10-26 00:33:37,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:37,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33:37,784 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-26 00:33:37,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11331956] [2020-10-26 00:33:37,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:37,785 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-26 00:33:37,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284089600] [2020-10-26 00:33:37,785 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 00:33:37,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:37,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 00:33:37,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-26 00:33:37,786 INFO L87 Difference]: Start difference. First operand 416 states and 1232 transitions. Second operand 4 states. [2020-10-26 00:33:37,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:37,867 INFO L93 Difference]: Finished difference Result 420 states and 1243 transitions. [2020-10-26 00:33:37,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 00:33:37,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-26 00:33:37,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:37,873 INFO L225 Difference]: With dead ends: 420 [2020-10-26 00:33:37,873 INFO L226 Difference]: Without dead ends: 420 [2020-10-26 00:33:37,875 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-26 00:33:37,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2020-10-26 00:33:37,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2020-10-26 00:33:37,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2020-10-26 00:33:37,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1243 transitions. [2020-10-26 00:33:37,892 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 1243 transitions. Word has length 12 [2020-10-26 00:33:37,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:37,893 INFO L481 AbstractCegarLoop]: Abstraction has 420 states and 1243 transitions. [2020-10-26 00:33:37,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 00:33:37,893 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 1243 transitions. [2020-10-26 00:33:37,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-26 00:33:37,894 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:37,894 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:33:37,895 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-26 00:33:37,895 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:37,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:37,895 INFO L82 PathProgramCache]: Analyzing trace with hash -651042940, now seen corresponding path program 2 times [2020-10-26 00:33:37,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:37,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486822453] [2020-10-26 00:33:37,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:37,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33:38,036 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-26 00:33:38,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486822453] [2020-10-26 00:33:38,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:38,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 00:33:38,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789535690] [2020-10-26 00:33:38,038 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-26 00:33:38,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:38,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 00:33:38,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-26 00:33:38,039 INFO L87 Difference]: Start difference. First operand 420 states and 1243 transitions. Second operand 5 states. [2020-10-26 00:33:38,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:38,116 INFO L93 Difference]: Finished difference Result 411 states and 1213 transitions. [2020-10-26 00:33:38,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 00:33:38,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-26 00:33:38,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:38,121 INFO L225 Difference]: With dead ends: 411 [2020-10-26 00:33:38,121 INFO L226 Difference]: Without dead ends: 411 [2020-10-26 00:33:38,121 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-26 00:33:38,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2020-10-26 00:33:38,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 407. [2020-10-26 00:33:38,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-10-26 00:33:38,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1202 transitions. [2020-10-26 00:33:38,135 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1202 transitions. Word has length 12 [2020-10-26 00:33:38,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:38,136 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 1202 transitions. [2020-10-26 00:33:38,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-26 00:33:38,136 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1202 transitions. [2020-10-26 00:33:38,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-26 00:33:38,137 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:38,138 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:33:38,138 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-26 00:33:38,138 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:38,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:38,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1346072291, now seen corresponding path program 1 times [2020-10-26 00:33:38,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:38,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404165517] [2020-10-26 00:33:38,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:38,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33:38,387 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-26 00:33:38,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404165517] [2020-10-26 00:33:38,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:38,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 00:33:38,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724300162] [2020-10-26 00:33:38,388 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-26 00:33:38,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:38,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 00:33:38,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-26 00:33:38,389 INFO L87 Difference]: Start difference. First operand 407 states and 1202 transitions. Second operand 6 states. [2020-10-26 00:33:38,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:38,537 INFO L93 Difference]: Finished difference Result 432 states and 1264 transitions. [2020-10-26 00:33:38,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 00:33:38,539 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-26 00:33:38,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:38,542 INFO L225 Difference]: With dead ends: 432 [2020-10-26 00:33:38,542 INFO L226 Difference]: Without dead ends: 432 [2020-10-26 00:33:38,543 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-10-26 00:33:38,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2020-10-26 00:33:38,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 424. [2020-10-26 00:33:38,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2020-10-26 00:33:38,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 1246 transitions. [2020-10-26 00:33:38,558 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 1246 transitions. Word has length 13 [2020-10-26 00:33:38,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:38,558 INFO L481 AbstractCegarLoop]: Abstraction has 424 states and 1246 transitions. [2020-10-26 00:33:38,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-26 00:33:38,559 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 1246 transitions. [2020-10-26 00:33:38,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-26 00:33:38,560 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:38,560 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:33:38,561 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-26 00:33:38,561 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:38,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:38,561 INFO L82 PathProgramCache]: Analyzing trace with hash 233943692, now seen corresponding path program 1 times [2020-10-26 00:33:38,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:38,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954664611] [2020-10-26 00:33:38,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33:38,655 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-26 00:33:38,655 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954664611] [2020-10-26 00:33:38,655 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:38,656 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 00:33:38,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571553327] [2020-10-26 00:33:38,656 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-26 00:33:38,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:38,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 00:33:38,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-26 00:33:38,657 INFO L87 Difference]: Start difference. First operand 424 states and 1246 transitions. Second operand 5 states. [2020-10-26 00:33:38,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:38,782 INFO L93 Difference]: Finished difference Result 669 states and 1945 transitions. [2020-10-26 00:33:38,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 00:33:38,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-26 00:33:38,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:38,788 INFO L225 Difference]: With dead ends: 669 [2020-10-26 00:33:38,788 INFO L226 Difference]: Without dead ends: 555 [2020-10-26 00:33:38,789 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-26 00:33:38,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-10-26 00:33:38,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 528. [2020-10-26 00:33:38,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2020-10-26 00:33:38,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 1518 transitions. [2020-10-26 00:33:38,811 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 1518 transitions. Word has length 13 [2020-10-26 00:33:38,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:38,811 INFO L481 AbstractCegarLoop]: Abstraction has 528 states and 1518 transitions. [2020-10-26 00:33:38,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-26 00:33:38,812 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 1518 transitions. [2020-10-26 00:33:38,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-26 00:33:38,813 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:38,814 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:33:38,814 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-26 00:33:38,814 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:38,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:38,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1400688478, now seen corresponding path program 2 times [2020-10-26 00:33:38,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:38,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088661528] [2020-10-26 00:33:38,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:38,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33:38,890 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-26 00:33:38,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088661528] [2020-10-26 00:33:38,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:38,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 00:33:38,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146331276] [2020-10-26 00:33:38,892 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-26 00:33:38,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:38,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 00:33:38,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-26 00:33:38,893 INFO L87 Difference]: Start difference. First operand 528 states and 1518 transitions. Second operand 5 states. [2020-10-26 00:33:38,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:38,974 INFO L93 Difference]: Finished difference Result 623 states and 1729 transitions. [2020-10-26 00:33:38,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 00:33:38,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-26 00:33:38,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:38,980 INFO L225 Difference]: With dead ends: 623 [2020-10-26 00:33:38,980 INFO L226 Difference]: Without dead ends: 497 [2020-10-26 00:33:38,981 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-26 00:33:38,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2020-10-26 00:33:38,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 414. [2020-10-26 00:33:38,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2020-10-26 00:33:39,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 1168 transitions. [2020-10-26 00:33:39,000 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 1168 transitions. Word has length 13 [2020-10-26 00:33:39,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:39,001 INFO L481 AbstractCegarLoop]: Abstraction has 414 states and 1168 transitions. [2020-10-26 00:33:39,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-26 00:33:39,001 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 1168 transitions. [2020-10-26 00:33:39,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-26 00:33:39,003 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:39,003 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:33:39,003 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-26 00:33:39,004 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:39,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:39,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1221433980, now seen corresponding path program 1 times [2020-10-26 00:33:39,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:39,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740440620] [2020-10-26 00:33:39,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:39,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33:39,430 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-26 00:33:39,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740440620] [2020-10-26 00:33:39,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:39,431 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 00:33:39,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908044742] [2020-10-26 00:33:39,431 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 00:33:39,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:39,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 00:33:39,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-26 00:33:39,432 INFO L87 Difference]: Start difference. First operand 414 states and 1168 transitions. Second operand 7 states. [2020-10-26 00:33:39,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:39,589 INFO L93 Difference]: Finished difference Result 552 states and 1512 transitions. [2020-10-26 00:33:39,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 00:33:39,591 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-10-26 00:33:39,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:39,595 INFO L225 Difference]: With dead ends: 552 [2020-10-26 00:33:39,595 INFO L226 Difference]: Without dead ends: 435 [2020-10-26 00:33:39,596 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-26 00:33:39,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2020-10-26 00:33:39,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 417. [2020-10-26 00:33:39,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2020-10-26 00:33:39,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 1140 transitions. [2020-10-26 00:33:39,626 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 1140 transitions. Word has length 14 [2020-10-26 00:33:39,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:39,627 INFO L481 AbstractCegarLoop]: Abstraction has 417 states and 1140 transitions. [2020-10-26 00:33:39,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 00:33:39,627 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 1140 transitions. [2020-10-26 00:33:39,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-26 00:33:39,629 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:39,629 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:33:39,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-26 00:33:39,629 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:39,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:39,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1220597910, now seen corresponding path program 2 times [2020-10-26 00:33:39,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:39,631 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416979966] [2020-10-26 00:33:39,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33:40,065 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-26 00:33:40,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416979966] [2020-10-26 00:33:40,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:40,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 00:33:40,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84822062] [2020-10-26 00:33:40,067 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 00:33:40,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:40,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 00:33:40,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-26 00:33:40,068 INFO L87 Difference]: Start difference. First operand 417 states and 1140 transitions. Second operand 7 states. [2020-10-26 00:33:40,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:40,263 INFO L93 Difference]: Finished difference Result 477 states and 1292 transitions. [2020-10-26 00:33:40,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 00:33:40,266 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-10-26 00:33:40,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:40,274 INFO L225 Difference]: With dead ends: 477 [2020-10-26 00:33:40,275 INFO L226 Difference]: Without dead ends: 450 [2020-10-26 00:33:40,275 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-26 00:33:40,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-10-26 00:33:40,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 405. [2020-10-26 00:33:40,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2020-10-26 00:33:40,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 1088 transitions. [2020-10-26 00:33:40,293 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 1088 transitions. Word has length 14 [2020-10-26 00:33:40,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:40,294 INFO L481 AbstractCegarLoop]: Abstraction has 405 states and 1088 transitions. [2020-10-26 00:33:40,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 00:33:40,294 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 1088 transitions. [2020-10-26 00:33:40,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-26 00:33:40,296 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:40,296 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:33:40,296 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-26 00:33:40,296 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:40,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:40,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1220627670, now seen corresponding path program 3 times [2020-10-26 00:33:40,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:40,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916327600] [2020-10-26 00:33:40,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33:40,666 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-26 00:33:40,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916327600] [2020-10-26 00:33:40,666 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:40,666 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 00:33:40,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147652594] [2020-10-26 00:33:40,667 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 00:33:40,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:40,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 00:33:40,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-26 00:33:40,668 INFO L87 Difference]: Start difference. First operand 405 states and 1088 transitions. Second operand 7 states. [2020-10-26 00:33:40,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:40,819 INFO L93 Difference]: Finished difference Result 436 states and 1167 transitions. [2020-10-26 00:33:40,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 00:33:40,821 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-10-26 00:33:40,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:40,824 INFO L225 Difference]: With dead ends: 436 [2020-10-26 00:33:40,824 INFO L226 Difference]: Without dead ends: 379 [2020-10-26 00:33:40,827 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-26 00:33:40,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2020-10-26 00:33:40,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 334. [2020-10-26 00:33:40,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2020-10-26 00:33:40,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 870 transitions. [2020-10-26 00:33:40,841 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 870 transitions. Word has length 14 [2020-10-26 00:33:40,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:40,841 INFO L481 AbstractCegarLoop]: Abstraction has 334 states and 870 transitions. [2020-10-26 00:33:40,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 00:33:40,842 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 870 transitions. [2020-10-26 00:33:40,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-26 00:33:40,843 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:40,843 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:33:40,843 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-26 00:33:40,844 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:40,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:40,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1412925316, now seen corresponding path program 4 times [2020-10-26 00:33:40,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:40,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635308993] [2020-10-26 00:33:40,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33:41,291 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-26 00:33:41,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635308993] [2020-10-26 00:33:41,291 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:41,291 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 00:33:41,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525426438] [2020-10-26 00:33:41,292 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 00:33:41,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:41,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 00:33:41,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-26 00:33:41,293 INFO L87 Difference]: Start difference. First operand 334 states and 870 transitions. Second operand 7 states. [2020-10-26 00:33:41,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:41,413 INFO L93 Difference]: Finished difference Result 367 states and 964 transitions. [2020-10-26 00:33:41,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 00:33:41,414 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-10-26 00:33:41,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:41,417 INFO L225 Difference]: With dead ends: 367 [2020-10-26 00:33:41,417 INFO L226 Difference]: Without dead ends: 313 [2020-10-26 00:33:41,417 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-26 00:33:41,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2020-10-26 00:33:41,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 252. [2020-10-26 00:33:41,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2020-10-26 00:33:41,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 673 transitions. [2020-10-26 00:33:41,428 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 673 transitions. Word has length 14 [2020-10-26 00:33:41,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:41,428 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 673 transitions. [2020-10-26 00:33:41,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 00:33:41,429 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 673 transitions. [2020-10-26 00:33:41,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-26 00:33:41,430 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:41,430 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:33:41,430 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-26 00:33:41,430 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:41,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:41,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1337648298, now seen corresponding path program 1 times [2020-10-26 00:33:41,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:41,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750432213] [2020-10-26 00:33:41,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:41,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33:41,518 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-26 00:33:41,519 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750432213] [2020-10-26 00:33:41,519 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:41,519 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 00:33:41,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056340955] [2020-10-26 00:33:41,521 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 00:33:41,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:41,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 00:33:41,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 00:33:41,522 INFO L87 Difference]: Start difference. First operand 252 states and 673 transitions. Second operand 4 states. [2020-10-26 00:33:41,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:41,578 INFO L93 Difference]: Finished difference Result 251 states and 586 transitions. [2020-10-26 00:33:41,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 00:33:41,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-26 00:33:41,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:41,581 INFO L225 Difference]: With dead ends: 251 [2020-10-26 00:33:41,581 INFO L226 Difference]: Without dead ends: 181 [2020-10-26 00:33:41,581 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-26 00:33:41,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-10-26 00:33:41,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2020-10-26 00:33:41,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-10-26 00:33:41,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 411 transitions. [2020-10-26 00:33:41,588 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 411 transitions. Word has length 14 [2020-10-26 00:33:41,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:41,588 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 411 transitions. [2020-10-26 00:33:41,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 00:33:41,588 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 411 transitions. [2020-10-26 00:33:41,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-26 00:33:41,589 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:41,589 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:33:41,590 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-26 00:33:41,590 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:41,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:41,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1350041670, now seen corresponding path program 1 times [2020-10-26 00:33:41,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:41,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589594122] [2020-10-26 00:33:41,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33:41,680 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-26 00:33:41,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589594122] [2020-10-26 00:33:41,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:41,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 00:33:41,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695315909] [2020-10-26 00:33:41,682 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-26 00:33:41,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:41,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 00:33:41,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-26 00:33:41,683 INFO L87 Difference]: Start difference. First operand 181 states and 411 transitions. Second operand 5 states. [2020-10-26 00:33:41,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:41,741 INFO L93 Difference]: Finished difference Result 150 states and 302 transitions. [2020-10-26 00:33:41,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 00:33:41,743 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-26 00:33:41,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:41,744 INFO L225 Difference]: With dead ends: 150 [2020-10-26 00:33:41,744 INFO L226 Difference]: Without dead ends: 112 [2020-10-26 00:33:41,745 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-26 00:33:41,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-26 00:33:41,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-10-26 00:33:41,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-26 00:33:41,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 216 transitions. [2020-10-26 00:33:41,750 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 216 transitions. Word has length 15 [2020-10-26 00:33:41,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:41,750 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 216 transitions. [2020-10-26 00:33:41,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-26 00:33:41,750 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 216 transitions. [2020-10-26 00:33:41,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-26 00:33:41,751 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:41,751 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:33:41,752 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-26 00:33:41,752 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:41,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:41,752 INFO L82 PathProgramCache]: Analyzing trace with hash -380102878, now seen corresponding path program 1 times [2020-10-26 00:33:41,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:41,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483099260] [2020-10-26 00:33:41,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33:41,810 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-26 00:33:41,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483099260] [2020-10-26 00:33:41,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:41,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-26 00:33:41,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016890308] [2020-10-26 00:33:41,811 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-26 00:33:41,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:41,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 00:33:41,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 00:33:41,812 INFO L87 Difference]: Start difference. First operand 112 states and 216 transitions. Second operand 3 states. [2020-10-26 00:33:41,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:41,828 INFO L93 Difference]: Finished difference Result 151 states and 281 transitions. [2020-10-26 00:33:41,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 00:33:41,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-10-26 00:33:41,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:41,830 INFO L225 Difference]: With dead ends: 151 [2020-10-26 00:33:41,830 INFO L226 Difference]: Without dead ends: 109 [2020-10-26 00:33:41,831 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 00:33:41,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-10-26 00:33:41,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2020-10-26 00:33:41,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-26 00:33:41,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 190 transitions. [2020-10-26 00:33:41,835 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 190 transitions. Word has length 16 [2020-10-26 00:33:41,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:41,835 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 190 transitions. [2020-10-26 00:33:41,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-26 00:33:41,835 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 190 transitions. [2020-10-26 00:33:41,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-26 00:33:41,836 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:41,836 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:33:41,837 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-26 00:33:41,837 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:41,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:41,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1101711683, now seen corresponding path program 1 times [2020-10-26 00:33:41,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:41,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862959615] [2020-10-26 00:33:41,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:41,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33:41,972 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-26 00:33:41,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862959615] [2020-10-26 00:33:41,972 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:41,972 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 00:33:41,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950023723] [2020-10-26 00:33:41,973 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-26 00:33:41,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:41,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 00:33:41,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-26 00:33:41,973 INFO L87 Difference]: Start difference. First operand 107 states and 190 transitions. Second operand 6 states. [2020-10-26 00:33:42,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:42,042 INFO L93 Difference]: Finished difference Result 93 states and 162 transitions. [2020-10-26 00:33:42,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 00:33:42,043 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-26 00:33:42,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:42,044 INFO L225 Difference]: With dead ends: 93 [2020-10-26 00:33:42,044 INFO L226 Difference]: Without dead ends: 35 [2020-10-26 00:33:42,044 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-26 00:33:42,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-10-26 00:33:42,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-10-26 00:33:42,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-26 00:33:42,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2020-10-26 00:33:42,047 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 17 [2020-10-26 00:33:42,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:42,048 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2020-10-26 00:33:42,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-26 00:33:42,048 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2020-10-26 00:33:42,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-26 00:33:42,048 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:42,048 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] [2020-10-26 00:33:42,048 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-26 00:33:42,049 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:42,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:42,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1131077601, now seen corresponding path program 1 times [2020-10-26 00:33:42,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:42,049 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157850892] [2020-10-26 00:33:42,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:42,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 00:33:42,105 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 00:33:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 00:33:42,154 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 00:33:42,214 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 00:33:42,214 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-26 00:33:42,215 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-26 00:33:42,217 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-26 00:33:42,234 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L820-->L827: Formula: (let ((.cse6 (= (mod ~y$w_buff1_used~0_In-1621604646 256) 0)) (.cse7 (= 0 (mod ~y$r_buff1_thd0~0_In-1621604646 256))) (.cse8 (= (mod ~y$r_buff0_thd0~0_In-1621604646 256) 0)) (.cse9 (= (mod ~y$w_buff0_used~0_In-1621604646 256) 0))) (let ((.cse3 (not .cse9)) (.cse4 (not .cse8)) (.cse5 (or .cse8 .cse9)) (.cse0 (not .cse7)) (.cse1 (not .cse6)) (.cse2 (or .cse6 .cse7))) (and (or (and .cse0 .cse1 (= ~y$w_buff1_used~0_Out-1621604646 0)) (and (= ~y$w_buff1_used~0_Out-1621604646 ~y$w_buff1_used~0_In-1621604646) .cse2)) (= ~y$r_buff1_thd0~0_In-1621604646 ~y$r_buff1_thd0~0_Out-1621604646) (or (and (= ~y$w_buff0_used~0_Out-1621604646 0) .cse3 .cse4) (and (= ~y$w_buff0_used~0_Out-1621604646 ~y$w_buff0_used~0_In-1621604646) .cse5)) (= ~y$r_buff0_thd0~0_Out-1621604646 ~y$r_buff0_thd0~0_In-1621604646) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1621604646| ULTIMATE.start_assume_abort_if_not_~cond_Out-1621604646) (not (= 0 ULTIMATE.start_assume_abort_if_not_~cond_Out-1621604646)) (or (and (= ~y~0_Out-1621604646 ~y$w_buff0~0_In-1621604646) .cse3 .cse4) (and .cse5 (or (and .cse0 .cse1 (= ~y$w_buff1~0_In-1621604646 ~y~0_Out-1621604646)) (and .cse2 (= ~y~0_Out-1621604646 ~y~0_In-1621604646)))))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1621604646|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1621604646, ~y$w_buff1~0=~y$w_buff1~0_In-1621604646, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1621604646, ~y$w_buff0~0=~y$w_buff0~0_In-1621604646, ~y~0=~y~0_In-1621604646, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1621604646, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1621604646} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-1621604646, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1621604646|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-1621604646|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1621604646|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1621604646|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1621604646|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1621604646|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1621604646|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1621604646, ~y$w_buff1~0=~y$w_buff1~0_In-1621604646, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-1621604646, ~y$w_buff0~0=~y$w_buff0~0_In-1621604646, ~y~0=~y~0_Out-1621604646, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1621604646, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-1621604646} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-26 00:33:42,244 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-26 00:33:42,244 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,245 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-26 00:33:42,245 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [773] [2020-10-26 00:33:42,247 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-26 00:33:42,248 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,248 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-26 00:33:42,248 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,249 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-26 00:33:42,249 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,250 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-26 00:33:42,250 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,250 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-26 00:33:42,251 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,251 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-26 00:33:42,251 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,252 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-26 00:33:42,252 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,252 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-26 00:33:42,252 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,253 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-26 00:33:42,253 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,254 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-26 00:33:42,254 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,254 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-26 00:33:42,254 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,254 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-26 00:33:42,255 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,255 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-26 00:33:42,256 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,256 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-26 00:33:42,256 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,256 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-26 00:33:42,256 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,257 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-26 00:33:42,257 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,262 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-26 00:33:42,263 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,263 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-26 00:33:42,263 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,264 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-26 00:33:42,264 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,264 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-26 00:33:42,264 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,264 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-26 00:33:42,265 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,265 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-26 00:33:42,265 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,265 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-26 00:33:42,265 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,266 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-26 00:33:42,266 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 12:33:42 BasicIcfg [2020-10-26 00:33:42,382 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-26 00:33:42,383 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 00:33:42,383 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 00:33:42,385 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 00:33:42,386 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 12:33:21" (3/4) ... [2020-10-26 00:33:42,388 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-26 00:33:42,399 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L820-->L827: Formula: (let ((.cse6 (= (mod ~y$w_buff1_used~0_In-1621604646 256) 0)) (.cse7 (= 0 (mod ~y$r_buff1_thd0~0_In-1621604646 256))) (.cse8 (= (mod ~y$r_buff0_thd0~0_In-1621604646 256) 0)) (.cse9 (= (mod ~y$w_buff0_used~0_In-1621604646 256) 0))) (let ((.cse3 (not .cse9)) (.cse4 (not .cse8)) (.cse5 (or .cse8 .cse9)) (.cse0 (not .cse7)) (.cse1 (not .cse6)) (.cse2 (or .cse6 .cse7))) (and (or (and .cse0 .cse1 (= ~y$w_buff1_used~0_Out-1621604646 0)) (and (= ~y$w_buff1_used~0_Out-1621604646 ~y$w_buff1_used~0_In-1621604646) .cse2)) (= ~y$r_buff1_thd0~0_In-1621604646 ~y$r_buff1_thd0~0_Out-1621604646) (or (and (= ~y$w_buff0_used~0_Out-1621604646 0) .cse3 .cse4) (and (= ~y$w_buff0_used~0_Out-1621604646 ~y$w_buff0_used~0_In-1621604646) .cse5)) (= ~y$r_buff0_thd0~0_Out-1621604646 ~y$r_buff0_thd0~0_In-1621604646) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1621604646| ULTIMATE.start_assume_abort_if_not_~cond_Out-1621604646) (not (= 0 ULTIMATE.start_assume_abort_if_not_~cond_Out-1621604646)) (or (and (= ~y~0_Out-1621604646 ~y$w_buff0~0_In-1621604646) .cse3 .cse4) (and .cse5 (or (and .cse0 .cse1 (= ~y$w_buff1~0_In-1621604646 ~y~0_Out-1621604646)) (and .cse2 (= ~y~0_Out-1621604646 ~y~0_In-1621604646)))))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1621604646|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1621604646, ~y$w_buff1~0=~y$w_buff1~0_In-1621604646, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1621604646, ~y$w_buff0~0=~y$w_buff0~0_In-1621604646, ~y~0=~y~0_In-1621604646, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1621604646, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1621604646} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-1621604646, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1621604646|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-1621604646|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1621604646|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1621604646|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1621604646|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1621604646|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1621604646|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1621604646, ~y$w_buff1~0=~y$w_buff1~0_In-1621604646, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-1621604646, ~y$w_buff0~0=~y$w_buff0~0_In-1621604646, ~y~0=~y~0_Out-1621604646, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1621604646, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-1621604646} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-26 00:33:42,402 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-26 00:33:42,402 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,402 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-26 00:33:42,403 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [773] [2020-10-26 00:33:42,403 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-26 00:33:42,404 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,404 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-26 00:33:42,404 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,404 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-26 00:33:42,405 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,405 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-26 00:33:42,405 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,405 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-26 00:33:42,405 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,406 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-26 00:33:42,406 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,406 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-26 00:33:42,406 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,406 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-26 00:33:42,406 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,407 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-26 00:33:42,407 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,407 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-26 00:33:42,407 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,407 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-26 00:33:42,407 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,408 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-26 00:33:42,408 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,408 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-26 00:33:42,408 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,408 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-26 00:33:42,409 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,409 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-26 00:33:42,409 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,409 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-26 00:33:42,409 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,409 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-26 00:33:42,410 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,410 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-26 00:33:42,410 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,410 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-26 00:33:42,410 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,410 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-26 00:33:42,411 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,411 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-26 00:33:42,411 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,411 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-26 00:33:42,411 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,411 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-26 00:33:42,412 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,412 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-26 00:33:42,412 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:42,536 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-26 00:33:42,536 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 00:33:42,537 INFO L168 Benchmark]: Toolchain (without parser) took 24385.52 ms. Allocated memory was 41.9 MB in the beginning and 255.9 MB in the end (delta: 213.9 MB). Free memory was 26.4 MB in the beginning and 116.2 MB in the end (delta: -89.7 MB). Peak memory consumption was 122.9 MB. Max. memory is 16.1 GB. [2020-10-26 00:33:42,538 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 41.9 MB. Free memory was 24.8 MB in the beginning and 24.8 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 00:33:42,538 INFO L168 Benchmark]: CACSL2BoogieTranslator took 849.27 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 25.8 MB in the beginning and 20.6 MB in the end (delta: 5.2 MB). Peak memory consumption was 15.5 MB. Max. memory is 16.1 GB. [2020-10-26 00:33:42,539 INFO L168 Benchmark]: Boogie Procedure Inliner took 108.41 ms. Allocated memory is still 50.3 MB. Free memory was 20.4 MB in the beginning and 29.8 MB in the end (delta: -9.4 MB). Peak memory consumption was 2.5 MB. Max. memory is 16.1 GB. [2020-10-26 00:33:42,539 INFO L168 Benchmark]: Boogie Preprocessor took 91.35 ms. Allocated memory is still 50.3 MB. Free memory was 29.8 MB in the beginning and 27.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 00:33:42,540 INFO L168 Benchmark]: RCFGBuilder took 2372.04 ms. Allocated memory was 50.3 MB in the beginning and 92.3 MB in the end (delta: 41.9 MB). Free memory was 27.7 MB in the beginning and 62.8 MB in the end (delta: -35.2 MB). Peak memory consumption was 28.8 MB. Max. memory is 16.1 GB. [2020-10-26 00:33:42,540 INFO L168 Benchmark]: TraceAbstraction took 20795.16 ms. Allocated memory was 92.3 MB in the beginning and 255.9 MB in the end (delta: 163.6 MB). Free memory was 62.8 MB in the beginning and 129.8 MB in the end (delta: -67.0 MB). Peak memory consumption was 97.0 MB. Max. memory is 16.1 GB. [2020-10-26 00:33:42,541 INFO L168 Benchmark]: Witness Printer took 153.38 ms. Allocated memory is still 255.9 MB. Free memory was 129.8 MB in the beginning and 116.2 MB in the end (delta: 13.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-10-26 00:33:42,545 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.26 ms. Allocated memory is still 41.9 MB. Free memory was 24.8 MB in the beginning and 24.8 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 849.27 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 25.8 MB in the beginning and 20.6 MB in the end (delta: 5.2 MB). Peak memory consumption was 15.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 108.41 ms. Allocated memory is still 50.3 MB. Free memory was 20.4 MB in the beginning and 29.8 MB in the end (delta: -9.4 MB). Peak memory consumption was 2.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 91.35 ms. Allocated memory is still 50.3 MB. Free memory was 29.8 MB in the beginning and 27.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2372.04 ms. Allocated memory was 50.3 MB in the beginning and 92.3 MB in the end (delta: 41.9 MB). Free memory was 27.7 MB in the beginning and 62.8 MB in the end (delta: -35.2 MB). Peak memory consumption was 28.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 20795.16 ms. Allocated memory was 92.3 MB in the beginning and 255.9 MB in the end (delta: 163.6 MB). Free memory was 62.8 MB in the beginning and 129.8 MB in the end (delta: -67.0 MB). Peak memory consumption was 97.0 MB. Max. memory is 16.1 GB. * Witness Printer took 153.38 ms. Allocated memory is still 255.9 MB. Free memory was 129.8 MB in the beginning and 116.2 MB in the end (delta: 13.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1114 VarBasedMoverChecksPositive, 77 VarBasedMoverChecksNegative, 21 SemBasedMoverChecksPositive, 56 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.3s, 115 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 13.8s, 106 PlacesBefore, 35 PlacesAfterwards, 99 TransitionsBefore, 26 TransitionsAfterwards, 1746 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 93 TotalNumberOfCompositions, 4967 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; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L716] 0 _Bool y$flush_delayed; [L717] 0 int y$mem_tmp; [L718] 0 _Bool y$r_buff0_thd0; [L719] 0 _Bool y$r_buff0_thd1; [L720] 0 _Bool y$r_buff0_thd2; [L721] 0 _Bool y$r_buff0_thd3; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$r_buff1_thd3; [L726] 0 _Bool y$read_delayed; [L727] 0 int *y$read_delayed_var; [L728] 0 int y$w_buff0; [L729] 0 _Bool y$w_buff0_used; [L730] 0 int y$w_buff1; [L731] 0 _Bool y$w_buff1_used; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L811] 0 pthread_t t2498; [L812] FCALL, FORK 0 pthread_create(&t2498, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 0 pthread_t t2499; [L814] FCALL, FORK 0 pthread_create(&t2499, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t2500; [L816] FCALL, FORK 0 pthread_create(&t2500, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L18] COND TRUE 3 !expression [L17] COND FALSE 3 !(0) [L17] 3 __assert_fail ("0", "safe030_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 z = 1 VAL [__unbuffered_cnt=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 z = 2 VAL [__unbuffered_cnt=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L754] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 2 return 0; [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L789] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 3 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L833] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1 [L833] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L837] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L838] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L838] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L838] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L839] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe030_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 97 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 20.4s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 13.9s, HoareTripleCheckerStatistics: 455 SDtfs, 405 SDslu, 630 SDs, 0 SdLazy, 414 SolverSat, 99 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=650occurred 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.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 293 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 271 NumberOfCodeBlocks, 271 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 28793 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...