./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix057_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 96f16385 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/mix057_tso.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 d418f4c235d4e249cca49982294bc62a0d9b5e97 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-96f1638 [2020-12-02 12:00:59,008 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-02 12:00:59,011 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-02 12:00:59,068 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-02 12:00:59,069 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-02 12:00:59,074 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-02 12:00:59,078 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-02 12:00:59,085 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-02 12:00:59,091 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-02 12:00:59,098 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-02 12:00:59,100 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-02 12:00:59,101 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-02 12:00:59,102 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-02 12:00:59,107 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-02 12:00:59,109 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-02 12:00:59,111 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-02 12:00:59,112 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-02 12:00:59,117 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-02 12:00:59,121 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-02 12:00:59,129 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-02 12:00:59,134 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-02 12:00:59,136 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-02 12:00:59,140 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-02 12:00:59,141 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-02 12:00:59,151 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-02 12:00:59,151 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-02 12:00:59,152 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-02 12:00:59,155 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-02 12:00:59,155 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-02 12:00:59,157 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-02 12:00:59,157 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-02 12:00:59,158 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-02 12:00:59,162 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-02 12:00:59,163 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-02 12:00:59,164 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-02 12:00:59,165 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-02 12:00:59,169 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-02 12:00:59,169 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-02 12:00:59,169 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-02 12:00:59,172 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-02 12:00:59,173 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-02 12:00:59,175 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-02 12:00:59,234 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-02 12:00:59,234 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-02 12:00:59,236 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-02 12:00:59,236 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-02 12:00:59,236 INFO L138 SettingsManager]: * Use SBE=true [2020-12-02 12:00:59,237 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-02 12:00:59,237 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-02 12:00:59,237 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-02 12:00:59,238 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-02 12:00:59,238 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-02 12:00:59,238 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-02 12:00:59,238 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-02 12:00:59,239 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-02 12:00:59,239 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-02 12:00:59,239 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-02 12:00:59,239 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-02 12:00:59,240 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-02 12:00:59,240 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-02 12:00:59,240 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-02 12:00:59,241 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-02 12:00:59,241 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-02 12:00:59,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 12:00:59,241 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-02 12:00:59,242 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-02 12:00:59,242 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-02 12:00:59,242 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-02 12:00:59,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-02 12:00:59,243 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-02 12:00:59,243 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-02 12:00:59,243 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 -> d418f4c235d4e249cca49982294bc62a0d9b5e97 [2020-12-02 12:00:59,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-02 12:00:59,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-02 12:00:59,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-02 12:00:59,683 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-02 12:00:59,684 INFO L275 PluginConnector]: CDTParser initialized [2020-12-02 12:00:59,686 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix057_tso.opt.i [2020-12-02 12:00:59,785 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49c289ee2/b561642dce254f62a1a392e1c5c169ba/FLAG1affbb478 [2020-12-02 12:01:00,549 INFO L306 CDTParser]: Found 1 translation units. [2020-12-02 12:01:00,550 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix057_tso.opt.i [2020-12-02 12:01:00,579 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49c289ee2/b561642dce254f62a1a392e1c5c169ba/FLAG1affbb478 [2020-12-02 12:01:00,832 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49c289ee2/b561642dce254f62a1a392e1c5c169ba [2020-12-02 12:01:00,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-02 12:01:00,837 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-02 12:01:00,841 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-02 12:01:00,842 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-02 12:01:00,846 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-02 12:01:00,847 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:01:00" (1/1) ... [2020-12-02 12:01:00,852 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ea89dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:01:00, skipping insertion in model container [2020-12-02 12:01:00,852 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:01:00" (1/1) ... [2020-12-02 12:01:00,862 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-02 12:01:00,949 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-02 12:01:01,135 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix057_tso.opt.i[948,961] [2020-12-02 12:01:01,440 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-02 12:01:01,460 INFO L203 MainTranslator]: Completed pre-run [2020-12-02 12:01:01,488 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix057_tso.opt.i[948,961] [2020-12-02 12:01:01,568 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-02 12:01:01,714 INFO L208 MainTranslator]: Completed translation [2020-12-02 12:01:01,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:01:01 WrapperNode [2020-12-02 12:01:01,715 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-02 12:01:01,721 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-02 12:01:01,722 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-02 12:01:01,722 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-02 12:01:01,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:01:01" (1/1) ... [2020-12-02 12:01:01,794 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:01:01" (1/1) ... [2020-12-02 12:01:01,871 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-02 12:01:01,873 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-02 12:01:01,874 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-02 12:01:01,874 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-02 12:01:01,889 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:01:01" (1/1) ... [2020-12-02 12:01:01,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:01:01" (1/1) ... [2020-12-02 12:01:01,912 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:01:01" (1/1) ... [2020-12-02 12:01:01,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:01:01" (1/1) ... [2020-12-02 12:01:01,958 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:01:01" (1/1) ... [2020-12-02 12:01:01,968 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:01:01" (1/1) ... [2020-12-02 12:01:01,977 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:01:01" (1/1) ... [2020-12-02 12:01:01,991 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-02 12:01:01,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-02 12:01:01,997 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-02 12:01:01,997 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-02 12:01:02,001 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:01:01" (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-12-02 12:01:02,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-02 12:01:02,146 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-02 12:01:02,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-02 12:01:02,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-02 12:01:02,148 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-02 12:01:02,148 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-02 12:01:02,148 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-02 12:01:02,149 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-02 12:01:02,150 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-02 12:01:02,150 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-02 12:01:02,150 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-12-02 12:01:02,151 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-12-02 12:01:02,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-02 12:01:02,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-02 12:01:02,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-02 12:01:02,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-02 12:01:02,156 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-02 12:01:04,705 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-02 12:01:04,705 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-02 12:01:04,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:01:04 BoogieIcfgContainer [2020-12-02 12:01:04,708 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-02 12:01:04,710 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-02 12:01:04,710 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-02 12:01:04,714 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-02 12:01:04,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:01:00" (1/3) ... [2020-12-02 12:01:04,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66695f30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:01:04, skipping insertion in model container [2020-12-02 12:01:04,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:01:01" (2/3) ... [2020-12-02 12:01:04,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66695f30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:01:04, skipping insertion in model container [2020-12-02 12:01:04,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:01:04" (3/3) ... [2020-12-02 12:01:04,718 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_tso.opt.i [2020-12-02 12:01:04,737 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-02 12:01:04,737 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-02 12:01:04,742 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-02 12:01:04,743 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-02 12:01:04,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,813 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,814 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,814 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,815 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,818 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,818 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,819 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,819 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,822 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,822 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,822 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,823 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,823 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,824 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,824 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,824 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,824 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,825 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,825 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,825 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,825 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,827 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,827 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,827 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,827 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,827 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,829 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,830 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,830 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,830 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,830 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,831 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,831 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,831 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,831 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,831 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,832 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,832 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,833 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,833 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,833 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,833 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,834 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,834 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,834 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,834 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,835 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,835 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,836 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,837 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,837 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,837 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,837 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,838 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,838 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,838 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,840 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,842 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,843 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,846 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,847 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,847 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,847 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,847 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,848 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,848 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,850 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,850 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,850 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,851 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,851 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,851 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,852 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,852 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,852 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,852 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,853 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,853 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,855 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,855 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,855 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,855 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:04,857 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-02 12:01:04,871 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-12-02 12:01:04,896 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-02 12:01:04,896 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-02 12:01:04,896 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-02 12:01:04,897 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-02 12:01:04,897 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-02 12:01:04,897 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-02 12:01:04,897 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-02 12:01:04,897 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-02 12:01:04,912 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-02 12:01:04,915 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 112 transitions, 244 flow [2020-12-02 12:01:04,919 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 112 transitions, 244 flow [2020-12-02 12:01:04,920 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 244 flow [2020-12-02 12:01:04,979 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2020-12-02 12:01:04,980 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-02 12:01:04,986 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2020-12-02 12:01:04,990 INFO L116 LiptonReduction]: Number of co-enabled transitions 2406 [2020-12-02 12:01:05,126 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:05,127 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:05,129 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:05,130 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:05,245 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:05,247 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:05,249 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:05,252 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:05,453 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:05,454 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:05,459 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:05,460 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:05,465 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:05,465 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:05,474 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:05,474 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:01:05,480 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:05,481 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:01:05,487 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:05,487 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:01:05,494 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-02 12:01:05,495 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:05,498 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-02 12:01:05,499 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:05,506 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-02 12:01:05,507 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:05,618 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:05,619 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:05,621 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:05,622 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:05,626 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-02 12:01:05,627 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 12:01:05,633 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-02 12:01:05,633 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:05,705 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:05,706 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:05,707 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:05,708 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:05,766 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-02 12:01:05,767 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:05,768 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-02 12:01:05,768 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:06,063 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:06,064 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:06,065 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:06,065 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:06,115 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:06,115 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:06,116 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:06,117 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:06,132 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2020-12-02 12:01:06,133 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:06,134 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 2, 1] term [2020-12-02 12:01:06,134 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:06,136 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2020-12-02 12:01:06,136 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:06,184 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:06,185 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:06,186 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:06,187 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:06,229 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:06,230 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:06,231 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:06,231 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:06,561 WARN L197 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-12-02 12:01:06,668 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-12-02 12:01:07,279 WARN L197 SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2020-12-02 12:01:07,485 WARN L197 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-12-02 12:01:07,543 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:07,543 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:07,544 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:07,545 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:07,548 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-02 12:01:07,549 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 12:01:07,553 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-02 12:01:07,553 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:07,625 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:07,626 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:07,636 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:07,636 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:07,637 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:07,638 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:07,642 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:07,642 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:01:07,644 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:07,645 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:01:07,647 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:07,647 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:01:07,652 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-02 12:01:07,652 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:07,655 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-02 12:01:07,656 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:07,658 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-02 12:01:07,659 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:07,746 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-02 12:01:07,747 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:07,748 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-02 12:01:07,748 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:07,779 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:07,780 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:07,781 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:07,782 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:07,836 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 2, 1] term [2020-12-02 12:01:07,837 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:07,838 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-12-02 12:01:07,838 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:07,893 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:07,893 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:07,894 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:07,895 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:07,940 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-02 12:01:07,941 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:07,942 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-02 12:01:07,942 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:07,974 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:07,975 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:07,976 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:07,976 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:08,025 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:08,026 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:08,027 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:08,027 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:08,063 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-02 12:01:08,064 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:08,064 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-02 12:01:08,065 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:08,134 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:08,134 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:08,135 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:08,136 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:08,138 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-02 12:01:08,139 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 12:01:08,142 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-02 12:01:08,143 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:08,214 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:08,215 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:08,224 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:08,224 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:08,225 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:08,226 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:08,229 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:08,230 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:01:08,231 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:08,232 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:01:08,234 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:08,235 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:01:08,238 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-02 12:01:08,238 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:08,241 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-02 12:01:08,242 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:08,243 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-02 12:01:08,244 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:08,438 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-02 12:01:08,439 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:08,439 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-02 12:01:08,440 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:08,471 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:08,472 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:08,473 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:08,473 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:09,772 WARN L197 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-12-02 12:01:10,766 WARN L197 SmtUtils]: Spent 989.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 185 [2020-12-02 12:01:13,117 WARN L197 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2020-12-02 12:01:14,232 WARN L197 SmtUtils]: Spent 1.11 s on a formula simplification that was a NOOP. DAG size: 265 [2020-12-02 12:01:14,299 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:14,301 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:14,302 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:14,306 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:14,342 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 2, 1] term [2020-12-02 12:01:14,343 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:14,350 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-12-02 12:01:14,350 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:14,402 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:14,402 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:14,416 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:14,417 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:14,418 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:14,418 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:14,421 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:14,422 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:01:14,423 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:14,424 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:01:14,425 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:14,425 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:01:14,429 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-02 12:01:14,429 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:14,430 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-02 12:01:14,431 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:14,433 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-02 12:01:14,433 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:14,494 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:14,494 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:14,495 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:14,495 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:14,498 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-02 12:01:14,498 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 12:01:14,501 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-02 12:01:14,502 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:14,745 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2020-12-02 12:01:14,973 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-02 12:01:14,974 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:14,974 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-02 12:01:14,975 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:15,010 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:15,011 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:15,011 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:15,012 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:15,403 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:15,404 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:15,404 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:15,405 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:15,406 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:15,407 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:15,408 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:15,409 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:15,433 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:15,434 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:15,435 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:15,435 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:15,437 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:15,437 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:01:15,439 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:15,440 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:01:15,472 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-02 12:01:15,473 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:15,474 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-02 12:01:15,474 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:15,497 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:15,497 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:15,498 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:15,498 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:15,535 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:15,535 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:15,536 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:15,537 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:15,559 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-02 12:01:15,560 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:15,561 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-02 12:01:15,561 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:15,785 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:15,785 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:15,787 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:15,787 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:15,789 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:15,789 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:15,791 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:15,791 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:15,822 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:15,823 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:15,824 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:15,824 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:15,826 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:15,826 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:01:15,828 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:15,828 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:01:16,426 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-02 12:01:16,426 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:16,465 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:16,466 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:16,467 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:16,467 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:16,468 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:16,469 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:01:16,471 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:16,471 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:01:16,490 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:16,491 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:16,491 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:16,492 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:16,493 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:16,493 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:16,495 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:16,495 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:16,642 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-02 12:01:16,642 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:16,643 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-02 12:01:16,644 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:16,671 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:16,672 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:16,673 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:16,673 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:16,869 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-12-02 12:01:17,021 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-12-02 12:01:17,254 WARN L197 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-02 12:01:17,495 WARN L197 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-02 12:01:17,579 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:17,580 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:17,581 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:17,582 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:17,583 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:17,584 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:17,586 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:17,586 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:17,588 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:17,589 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:17,590 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:17,591 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:17,593 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:17,594 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:17,595 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:17,596 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:17,647 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:17,648 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:17,649 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:17,649 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:17,651 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-02 12:01:17,652 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 12:01:17,655 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-02 12:01:17,655 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:17,818 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:17,818 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:17,819 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:17,819 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:17,847 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 2, 1] term [2020-12-02 12:01:17,848 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:17,848 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-12-02 12:01:17,849 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:17,903 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:17,903 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:17,908 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:17,909 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:17,910 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:17,910 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:17,912 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:17,913 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:17,914 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:17,914 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:17,917 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:17,918 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:17,919 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:17,919 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:17,921 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:17,922 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:17,969 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:17,969 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:17,970 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:17,971 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:17,973 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-02 12:01:17,973 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 12:01:17,976 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-02 12:01:17,976 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:18,194 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-02 12:01:18,195 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:18,195 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-02 12:01:18,196 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:18,230 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:18,231 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:18,232 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:18,232 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:18,290 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:18,291 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:18,291 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:18,292 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:18,322 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:18,322 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:18,323 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:18,323 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:18,487 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:18,487 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:18,488 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:18,489 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:18,491 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-02 12:01:18,492 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 12:01:18,495 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-02 12:01:18,495 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:18,539 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:18,539 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:18,541 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:18,542 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:18,542 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:18,543 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:18,545 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:18,545 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:18,547 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:18,547 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:18,549 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:18,549 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:18,550 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:18,551 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:18,553 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:18,553 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:18,691 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 2, 1] term [2020-12-02 12:01:18,691 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:18,692 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-12-02 12:01:18,692 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:18,718 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:18,719 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:18,720 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:18,720 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:18,828 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:18,829 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:18,830 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:18,830 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:18,832 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-02 12:01:18,833 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 12:01:18,836 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-02 12:01:18,836 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:18,866 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:18,867 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:18,875 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:18,876 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:18,877 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:18,877 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:18,879 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:18,880 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:18,881 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:18,882 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:18,883 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:18,884 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:18,886 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:18,887 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:18,888 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:18,888 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:19,516 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-12-02 12:01:19,726 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-12-02 12:01:21,183 WARN L197 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2020-12-02 12:01:21,437 WARN L197 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-12-02 12:01:21,964 WARN L197 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2020-12-02 12:01:22,212 WARN L197 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-12-02 12:01:22,229 INFO L131 LiptonReduction]: Checked pairs total: 6250 [2020-12-02 12:01:22,229 INFO L133 LiptonReduction]: Total number of compositions: 91 [2020-12-02 12:01:22,236 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 33 transitions, 86 flow [2020-12-02 12:01:22,513 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3082 states. [2020-12-02 12:01:22,516 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states. [2020-12-02 12:01:22,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-02 12:01:22,525 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:01:22,526 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:01:22,527 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:01:22,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:01:22,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1657207024, now seen corresponding path program 1 times [2020-12-02 12:01:22,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:01:22,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734674449] [2020-12-02 12:01:22,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:01:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:01:22,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:01:22,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734674449] [2020-12-02 12:01:22,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:01:22,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-02 12:01:22,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626147828] [2020-12-02 12:01:22,896 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-02 12:01:22,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:01:22,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-02 12:01:22,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 12:01:22,916 INFO L87 Difference]: Start difference. First operand 3082 states. Second operand 3 states. [2020-12-02 12:01:23,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:01:23,061 INFO L93 Difference]: Finished difference Result 2602 states and 10064 transitions. [2020-12-02 12:01:23,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-02 12:01:23,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-12-02 12:01:23,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:01:23,130 INFO L225 Difference]: With dead ends: 2602 [2020-12-02 12:01:23,130 INFO L226 Difference]: Without dead ends: 2202 [2020-12-02 12:01:23,132 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-12-02 12:01:23,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2202 states. [2020-12-02 12:01:23,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2202 to 2202. [2020-12-02 12:01:23,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2202 states. [2020-12-02 12:01:23,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 8424 transitions. [2020-12-02 12:01:23,365 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 8424 transitions. Word has length 9 [2020-12-02 12:01:23,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:01:23,369 INFO L481 AbstractCegarLoop]: Abstraction has 2202 states and 8424 transitions. [2020-12-02 12:01:23,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-02 12:01:23,369 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 8424 transitions. [2020-12-02 12:01:23,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-02 12:01:23,383 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:01:23,383 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:01:23,383 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-02 12:01:23,384 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:01:23,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:01:23,390 INFO L82 PathProgramCache]: Analyzing trace with hash 796408796, now seen corresponding path program 1 times [2020-12-02 12:01:23,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:01:23,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533841457] [2020-12-02 12:01:23,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:01:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:01:23,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:01:23,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533841457] [2020-12-02 12:01:23,628 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:01:23,628 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-02 12:01:23,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820235367] [2020-12-02 12:01:23,630 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 12:01:23,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:01:23,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 12:01:23,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 12:01:23,635 INFO L87 Difference]: Start difference. First operand 2202 states and 8424 transitions. Second operand 4 states. [2020-12-02 12:01:23,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:01:23,718 INFO L93 Difference]: Finished difference Result 2502 states and 9254 transitions. [2020-12-02 12:01:23,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 12:01:23,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-12-02 12:01:23,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:01:23,744 INFO L225 Difference]: With dead ends: 2502 [2020-12-02 12:01:23,744 INFO L226 Difference]: Without dead ends: 2102 [2020-12-02 12:01:23,745 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-02 12:01:23,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2102 states. [2020-12-02 12:01:23,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2102 to 2102. [2020-12-02 12:01:23,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2102 states. [2020-12-02 12:01:23,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 7964 transitions. [2020-12-02 12:01:23,859 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 7964 transitions. Word has length 12 [2020-12-02 12:01:23,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:01:23,859 INFO L481 AbstractCegarLoop]: Abstraction has 2102 states and 7964 transitions. [2020-12-02 12:01:23,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 12:01:23,860 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 7964 transitions. [2020-12-02 12:01:23,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-02 12:01:23,863 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:01:23,864 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:01:23,864 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-02 12:01:23,864 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:01:23,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:01:23,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1081135003, now seen corresponding path program 1 times [2020-12-02 12:01:23,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:01:23,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708668533] [2020-12-02 12:01:23,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:01:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:01:24,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:01:24,072 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708668533] [2020-12-02 12:01:24,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:01:24,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-02 12:01:24,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5485647] [2020-12-02 12:01:24,075 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 12:01:24,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:01:24,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 12:01:24,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 12:01:24,077 INFO L87 Difference]: Start difference. First operand 2102 states and 7964 transitions. Second operand 4 states. [2020-12-02 12:01:24,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:01:24,148 INFO L93 Difference]: Finished difference Result 2392 states and 8786 transitions. [2020-12-02 12:01:24,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 12:01:24,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-12-02 12:01:24,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:01:24,171 INFO L225 Difference]: With dead ends: 2392 [2020-12-02 12:01:24,172 INFO L226 Difference]: Without dead ends: 2042 [2020-12-02 12:01:24,172 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-02 12:01:24,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states. [2020-12-02 12:01:24,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 2042. [2020-12-02 12:01:24,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2042 states. [2020-12-02 12:01:24,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 7696 transitions. [2020-12-02 12:01:24,270 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 7696 transitions. Word has length 13 [2020-12-02 12:01:24,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:01:24,271 INFO L481 AbstractCegarLoop]: Abstraction has 2042 states and 7696 transitions. [2020-12-02 12:01:24,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 12:01:24,271 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 7696 transitions. [2020-12-02 12:01:24,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-02 12:01:24,274 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:01:24,274 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:01:24,275 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-02 12:01:24,275 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:01:24,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:01:24,276 INFO L82 PathProgramCache]: Analyzing trace with hash 844817491, now seen corresponding path program 1 times [2020-12-02 12:01:24,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:01:24,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900193225] [2020-12-02 12:01:24,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:01:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:01:24,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:01:24,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900193225] [2020-12-02 12:01:24,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:01:24,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-02 12:01:24,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565661237] [2020-12-02 12:01:24,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 12:01:24,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:01:24,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 12:01:24,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 12:01:24,370 INFO L87 Difference]: Start difference. First operand 2042 states and 7696 transitions. Second operand 4 states. [2020-12-02 12:01:24,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:01:24,463 INFO L93 Difference]: Finished difference Result 2318 states and 8482 transitions. [2020-12-02 12:01:24,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 12:01:24,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-12-02 12:01:24,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:01:24,485 INFO L225 Difference]: With dead ends: 2318 [2020-12-02 12:01:24,485 INFO L226 Difference]: Without dead ends: 1998 [2020-12-02 12:01:24,486 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-02 12:01:24,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2020-12-02 12:01:24,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1998. [2020-12-02 12:01:24,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states. [2020-12-02 12:01:24,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 7504 transitions. [2020-12-02 12:01:24,574 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 7504 transitions. Word has length 14 [2020-12-02 12:01:24,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:01:24,574 INFO L481 AbstractCegarLoop]: Abstraction has 1998 states and 7504 transitions. [2020-12-02 12:01:24,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 12:01:24,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 7504 transitions. [2020-12-02 12:01:24,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-02 12:01:24,578 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:01:24,578 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:01:24,579 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-02 12:01:24,579 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:01:24,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:01:24,579 INFO L82 PathProgramCache]: Analyzing trace with hash -496330171, now seen corresponding path program 1 times [2020-12-02 12:01:24,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:01:24,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154675377] [2020-12-02 12:01:24,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:01:24,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:01:24,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:01:24,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154675377] [2020-12-02 12:01:24,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:01:24,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 12:01:24,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352368116] [2020-12-02 12:01:24,744 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 12:01:24,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:01:24,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 12:01:24,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-02 12:01:24,745 INFO L87 Difference]: Start difference. First operand 1998 states and 7504 transitions. Second operand 6 states. [2020-12-02 12:01:24,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:01:24,950 INFO L93 Difference]: Finished difference Result 2166 states and 7916 transitions. [2020-12-02 12:01:24,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 12:01:24,951 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-12-02 12:01:24,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:01:24,971 INFO L225 Difference]: With dead ends: 2166 [2020-12-02 12:01:24,972 INFO L226 Difference]: Without dead ends: 1910 [2020-12-02 12:01:24,972 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-12-02 12:01:24,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1910 states. [2020-12-02 12:01:25,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1910 to 1910. [2020-12-02 12:01:25,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1910 states. [2020-12-02 12:01:25,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 7120 transitions. [2020-12-02 12:01:25,056 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 7120 transitions. Word has length 15 [2020-12-02 12:01:25,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:01:25,056 INFO L481 AbstractCegarLoop]: Abstraction has 1910 states and 7120 transitions. [2020-12-02 12:01:25,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 12:01:25,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 7120 transitions. [2020-12-02 12:01:25,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-02 12:01:25,060 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:01:25,061 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:01:25,061 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-02 12:01:25,061 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:01:25,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:01:25,062 INFO L82 PathProgramCache]: Analyzing trace with hash 418193947, now seen corresponding path program 1 times [2020-12-02 12:01:25,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:01:25,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236289825] [2020-12-02 12:01:25,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:01:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:01:25,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:01:25,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236289825] [2020-12-02 12:01:25,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:01:25,189 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-02 12:01:25,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799717799] [2020-12-02 12:01:25,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-02 12:01:25,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:01:25,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-02 12:01:25,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-02 12:01:25,192 INFO L87 Difference]: Start difference. First operand 1910 states and 7120 transitions. Second operand 5 states. [2020-12-02 12:01:25,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:01:25,345 INFO L93 Difference]: Finished difference Result 2136 states and 7798 transitions. [2020-12-02 12:01:25,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 12:01:25,347 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-12-02 12:01:25,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:01:25,367 INFO L225 Difference]: With dead ends: 2136 [2020-12-02 12:01:25,368 INFO L226 Difference]: Without dead ends: 1926 [2020-12-02 12:01:25,370 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-02 12:01:25,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2020-12-02 12:01:25,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1926. [2020-12-02 12:01:25,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1926 states. [2020-12-02 12:01:25,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 7176 transitions. [2020-12-02 12:01:25,452 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 7176 transitions. Word has length 15 [2020-12-02 12:01:25,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:01:25,453 INFO L481 AbstractCegarLoop]: Abstraction has 1926 states and 7176 transitions. [2020-12-02 12:01:25,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-02 12:01:25,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 7176 transitions. [2020-12-02 12:01:25,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-02 12:01:25,458 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:01:25,458 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:01:25,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-02 12:01:25,459 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:01:25,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:01:25,459 INFO L82 PathProgramCache]: Analyzing trace with hash -516647633, now seen corresponding path program 2 times [2020-12-02 12:01:25,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:01:25,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235720820] [2020-12-02 12:01:25,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:01:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:01:25,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:01:25,628 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235720820] [2020-12-02 12:01:25,628 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:01:25,628 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 12:01:25,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344134982] [2020-12-02 12:01:25,630 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 12:01:25,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:01:25,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 12:01:25,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-02 12:01:25,631 INFO L87 Difference]: Start difference. First operand 1926 states and 7176 transitions. Second operand 6 states. [2020-12-02 12:01:25,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:01:25,834 INFO L93 Difference]: Finished difference Result 2052 states and 7482 transitions. [2020-12-02 12:01:25,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 12:01:25,835 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-12-02 12:01:25,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:01:25,870 INFO L225 Difference]: With dead ends: 2052 [2020-12-02 12:01:25,870 INFO L226 Difference]: Without dead ends: 1842 [2020-12-02 12:01:25,870 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-12-02 12:01:25,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2020-12-02 12:01:25,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 1826. [2020-12-02 12:01:25,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1826 states. [2020-12-02 12:01:25,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 6776 transitions. [2020-12-02 12:01:25,951 INFO L78 Accepts]: Start accepts. Automaton has 1826 states and 6776 transitions. Word has length 15 [2020-12-02 12:01:25,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:01:25,951 INFO L481 AbstractCegarLoop]: Abstraction has 1826 states and 6776 transitions. [2020-12-02 12:01:25,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 12:01:25,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 6776 transitions. [2020-12-02 12:01:25,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-02 12:01:25,959 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:01:25,959 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:01:25,959 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-02 12:01:25,959 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:01:25,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:01:25,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1792289385, now seen corresponding path program 1 times [2020-12-02 12:01:25,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:01:25,965 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904273703] [2020-12-02 12:01:25,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:01:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:01:26,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:01:26,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904273703] [2020-12-02 12:01:26,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:01:26,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 12:01:26,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887598415] [2020-12-02 12:01:26,118 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 12:01:26,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:01:26,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 12:01:26,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-02 12:01:26,120 INFO L87 Difference]: Start difference. First operand 1826 states and 6776 transitions. Second operand 6 states. [2020-12-02 12:01:26,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:01:26,322 INFO L93 Difference]: Finished difference Result 2366 states and 8612 transitions. [2020-12-02 12:01:26,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-02 12:01:26,323 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-12-02 12:01:26,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:01:26,335 INFO L225 Difference]: With dead ends: 2366 [2020-12-02 12:01:26,335 INFO L226 Difference]: Without dead ends: 2114 [2020-12-02 12:01:26,337 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-12-02 12:01:26,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states. [2020-12-02 12:01:26,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 2058. [2020-12-02 12:01:26,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2058 states. [2020-12-02 12:01:26,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 7584 transitions. [2020-12-02 12:01:26,423 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 7584 transitions. Word has length 16 [2020-12-02 12:01:26,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:01:26,423 INFO L481 AbstractCegarLoop]: Abstraction has 2058 states and 7584 transitions. [2020-12-02 12:01:26,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 12:01:26,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 7584 transitions. [2020-12-02 12:01:26,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-02 12:01:26,429 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:01:26,429 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:01:26,430 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-02 12:01:26,430 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:01:26,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:01:26,430 INFO L82 PathProgramCache]: Analyzing trace with hash -274918620, now seen corresponding path program 1 times [2020-12-02 12:01:26,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:01:26,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087061225] [2020-12-02 12:01:26,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:01:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:01:26,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:01:26,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087061225] [2020-12-02 12:01:26,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:01:26,613 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 12:01:26,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843086196] [2020-12-02 12:01:26,613 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-02 12:01:26,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:01:26,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-02 12:01:26,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-02 12:01:26,615 INFO L87 Difference]: Start difference. First operand 2058 states and 7584 transitions. Second operand 7 states. [2020-12-02 12:01:26,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:01:26,894 INFO L93 Difference]: Finished difference Result 2474 states and 8820 transitions. [2020-12-02 12:01:26,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-02 12:01:26,895 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-12-02 12:01:26,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:01:26,906 INFO L225 Difference]: With dead ends: 2474 [2020-12-02 12:01:26,907 INFO L226 Difference]: Without dead ends: 2018 [2020-12-02 12:01:26,907 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-12-02 12:01:26,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2018 states. [2020-12-02 12:01:26,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2018 to 1658. [2020-12-02 12:01:26,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1658 states. [2020-12-02 12:01:26,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 5992 transitions. [2020-12-02 12:01:26,987 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 5992 transitions. Word has length 17 [2020-12-02 12:01:26,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:01:26,987 INFO L481 AbstractCegarLoop]: Abstraction has 1658 states and 5992 transitions. [2020-12-02 12:01:26,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-02 12:01:26,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 5992 transitions. [2020-12-02 12:01:26,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-02 12:01:26,993 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:01:26,993 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:01:26,994 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-02 12:01:26,994 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:01:26,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:01:26,995 INFO L82 PathProgramCache]: Analyzing trace with hash -267292124, now seen corresponding path program 1 times [2020-12-02 12:01:26,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:01:26,995 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554627475] [2020-12-02 12:01:26,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:01:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:01:27,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:01:27,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554627475] [2020-12-02 12:01:27,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:01:27,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-02 12:01:27,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870494221] [2020-12-02 12:01:27,106 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 12:01:27,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:01:27,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 12:01:27,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 12:01:27,107 INFO L87 Difference]: Start difference. First operand 1658 states and 5992 transitions. Second operand 4 states. [2020-12-02 12:01:27,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:01:27,163 INFO L93 Difference]: Finished difference Result 1722 states and 5682 transitions. [2020-12-02 12:01:27,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 12:01:27,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-12-02 12:01:27,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:01:27,172 INFO L225 Difference]: With dead ends: 1722 [2020-12-02 12:01:27,173 INFO L226 Difference]: Without dead ends: 1322 [2020-12-02 12:01:27,173 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-12-02 12:01:27,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2020-12-02 12:01:27,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1322. [2020-12-02 12:01:27,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2020-12-02 12:01:27,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 4330 transitions. [2020-12-02 12:01:27,233 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 4330 transitions. Word has length 17 [2020-12-02 12:01:27,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:01:27,234 INFO L481 AbstractCegarLoop]: Abstraction has 1322 states and 4330 transitions. [2020-12-02 12:01:27,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 12:01:27,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 4330 transitions. [2020-12-02 12:01:27,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-02 12:01:27,239 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:01:27,239 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:01:27,239 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-02 12:01:27,240 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:01:27,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:01:27,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1175676895, now seen corresponding path program 1 times [2020-12-02 12:01:27,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:01:27,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964631764] [2020-12-02 12:01:27,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:01:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:01:27,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:01:27,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964631764] [2020-12-02 12:01:27,371 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:01:27,371 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 12:01:27,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407555164] [2020-12-02 12:01:27,372 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-02 12:01:27,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:01:27,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-02 12:01:27,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-02 12:01:27,373 INFO L87 Difference]: Start difference. First operand 1322 states and 4330 transitions. Second operand 5 states. [2020-12-02 12:01:27,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:01:27,444 INFO L93 Difference]: Finished difference Result 1136 states and 3401 transitions. [2020-12-02 12:01:27,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 12:01:27,445 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-12-02 12:01:27,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:01:27,449 INFO L225 Difference]: With dead ends: 1136 [2020-12-02 12:01:27,449 INFO L226 Difference]: Without dead ends: 880 [2020-12-02 12:01:27,450 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-12-02 12:01:27,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2020-12-02 12:01:27,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 880. [2020-12-02 12:01:27,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2020-12-02 12:01:27,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 2592 transitions. [2020-12-02 12:01:27,480 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 2592 transitions. Word has length 18 [2020-12-02 12:01:27,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:01:27,480 INFO L481 AbstractCegarLoop]: Abstraction has 880 states and 2592 transitions. [2020-12-02 12:01:27,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-02 12:01:27,480 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 2592 transitions. [2020-12-02 12:01:27,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-02 12:01:27,483 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:01:27,484 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:01:27,484 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-02 12:01:27,484 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:01:27,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:01:27,485 INFO L82 PathProgramCache]: Analyzing trace with hash 908797382, now seen corresponding path program 1 times [2020-12-02 12:01:27,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:01:27,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369551251] [2020-12-02 12:01:27,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:01:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:01:27,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:01:27,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369551251] [2020-12-02 12:01:27,540 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:01:27,541 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-02 12:01:27,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564300865] [2020-12-02 12:01:27,541 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 12:01:27,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:01:27,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 12:01:27,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 12:01:27,542 INFO L87 Difference]: Start difference. First operand 880 states and 2592 transitions. Second operand 4 states. [2020-12-02 12:01:27,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:01:27,582 INFO L93 Difference]: Finished difference Result 1295 states and 3672 transitions. [2020-12-02 12:01:27,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 12:01:27,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-12-02 12:01:27,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:01:27,587 INFO L225 Difference]: With dead ends: 1295 [2020-12-02 12:01:27,587 INFO L226 Difference]: Without dead ends: 900 [2020-12-02 12:01:27,588 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-12-02 12:01:27,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2020-12-02 12:01:27,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 868. [2020-12-02 12:01:27,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2020-12-02 12:01:27,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 2424 transitions. [2020-12-02 12:01:27,615 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 2424 transitions. Word has length 19 [2020-12-02 12:01:27,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:01:27,616 INFO L481 AbstractCegarLoop]: Abstraction has 868 states and 2424 transitions. [2020-12-02 12:01:27,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 12:01:27,616 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 2424 transitions. [2020-12-02 12:01:27,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 12:01:27,619 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:01:27,619 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-12-02 12:01:27,619 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-02 12:01:27,619 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:01:27,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:01:27,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1820204981, now seen corresponding path program 1 times [2020-12-02 12:01:27,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:01:27,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813049457] [2020-12-02 12:01:27,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:01:27,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:01:27,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:01:27,690 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813049457] [2020-12-02 12:01:27,690 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:01:27,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 12:01:27,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958370821] [2020-12-02 12:01:27,691 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-02 12:01:27,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:01:27,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-02 12:01:27,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-02 12:01:27,692 INFO L87 Difference]: Start difference. First operand 868 states and 2424 transitions. Second operand 5 states. [2020-12-02 12:01:27,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:01:27,738 INFO L93 Difference]: Finished difference Result 1198 states and 3266 transitions. [2020-12-02 12:01:27,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 12:01:27,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-12-02 12:01:27,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:01:27,741 INFO L225 Difference]: With dead ends: 1198 [2020-12-02 12:01:27,741 INFO L226 Difference]: Without dead ends: 558 [2020-12-02 12:01:27,742 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-02 12:01:27,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-12-02 12:01:27,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 558. [2020-12-02 12:01:27,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2020-12-02 12:01:27,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 1426 transitions. [2020-12-02 12:01:27,776 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 1426 transitions. Word has length 20 [2020-12-02 12:01:27,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:01:27,776 INFO L481 AbstractCegarLoop]: Abstraction has 558 states and 1426 transitions. [2020-12-02 12:01:27,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-02 12:01:27,777 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 1426 transitions. [2020-12-02 12:01:27,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 12:01:27,778 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:01:27,778 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-12-02 12:01:27,779 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-02 12:01:27,779 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:01:27,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:01:27,780 INFO L82 PathProgramCache]: Analyzing trace with hash -245781237, now seen corresponding path program 2 times [2020-12-02 12:01:27,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:01:27,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732023353] [2020-12-02 12:01:27,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:01:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:01:27,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:01:27,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732023353] [2020-12-02 12:01:27,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:01:27,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-02 12:01:27,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047746981] [2020-12-02 12:01:27,846 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 12:01:27,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:01:27,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 12:01:27,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 12:01:27,847 INFO L87 Difference]: Start difference. First operand 558 states and 1426 transitions. Second operand 4 states. [2020-12-02 12:01:27,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:01:27,880 INFO L93 Difference]: Finished difference Result 789 states and 1937 transitions. [2020-12-02 12:01:27,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 12:01:27,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-12-02 12:01:27,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:01:27,884 INFO L225 Difference]: With dead ends: 789 [2020-12-02 12:01:27,884 INFO L226 Difference]: Without dead ends: 570 [2020-12-02 12:01:27,884 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-12-02 12:01:27,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-12-02 12:01:27,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 542. [2020-12-02 12:01:27,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2020-12-02 12:01:27,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1315 transitions. [2020-12-02 12:01:27,901 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1315 transitions. Word has length 20 [2020-12-02 12:01:27,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:01:27,901 INFO L481 AbstractCegarLoop]: Abstraction has 542 states and 1315 transitions. [2020-12-02 12:01:27,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 12:01:27,901 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1315 transitions. [2020-12-02 12:01:27,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 12:01:27,903 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:01:27,904 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-12-02 12:01:27,904 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-02 12:01:27,904 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:01:27,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:01:27,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1693048300, now seen corresponding path program 1 times [2020-12-02 12:01:27,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:01:27,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633958994] [2020-12-02 12:01:27,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:01:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:01:27,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:01:27,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633958994] [2020-12-02 12:01:27,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:01:27,989 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 12:01:27,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411873327] [2020-12-02 12:01:27,990 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 12:01:27,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:01:27,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 12:01:27,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-02 12:01:27,991 INFO L87 Difference]: Start difference. First operand 542 states and 1315 transitions. Second operand 6 states. [2020-12-02 12:01:28,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:01:28,060 INFO L93 Difference]: Finished difference Result 442 states and 1010 transitions. [2020-12-02 12:01:28,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 12:01:28,061 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-12-02 12:01:28,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:01:28,062 INFO L225 Difference]: With dead ends: 442 [2020-12-02 12:01:28,063 INFO L226 Difference]: Without dead ends: 306 [2020-12-02 12:01:28,063 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-12-02 12:01:28,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2020-12-02 12:01:28,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2020-12-02 12:01:28,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2020-12-02 12:01:28,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 665 transitions. [2020-12-02 12:01:28,072 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 665 transitions. Word has length 20 [2020-12-02 12:01:28,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:01:28,073 INFO L481 AbstractCegarLoop]: Abstraction has 306 states and 665 transitions. [2020-12-02 12:01:28,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 12:01:28,073 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 665 transitions. [2020-12-02 12:01:28,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-02 12:01:28,074 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:01:28,074 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:01:28,075 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-02 12:01:28,075 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:01:28,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:01:28,075 INFO L82 PathProgramCache]: Analyzing trace with hash -259093983, now seen corresponding path program 1 times [2020-12-02 12:01:28,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:01:28,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522013021] [2020-12-02 12:01:28,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:01:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:01:28,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:01:28,169 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522013021] [2020-12-02 12:01:28,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:01:28,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-02 12:01:28,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645647082] [2020-12-02 12:01:28,171 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-02 12:01:28,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:01:28,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-02 12:01:28,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-02 12:01:28,172 INFO L87 Difference]: Start difference. First operand 306 states and 665 transitions. Second operand 7 states. [2020-12-02 12:01:28,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:01:28,256 INFO L93 Difference]: Finished difference Result 277 states and 608 transitions. [2020-12-02 12:01:28,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-02 12:01:28,257 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-12-02 12:01:28,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:01:28,258 INFO L225 Difference]: With dead ends: 277 [2020-12-02 12:01:28,258 INFO L226 Difference]: Without dead ends: 64 [2020-12-02 12:01:28,258 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-12-02 12:01:28,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-12-02 12:01:28,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-12-02 12:01:28,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-12-02 12:01:28,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 122 transitions. [2020-12-02 12:01:28,261 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 122 transitions. Word has length 23 [2020-12-02 12:01:28,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:01:28,261 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 122 transitions. [2020-12-02 12:01:28,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-02 12:01:28,262 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 122 transitions. [2020-12-02 12:01:28,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-02 12:01:28,262 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:01:28,263 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:01:28,263 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-02 12:01:28,263 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:01:28,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:01:28,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1810376578, now seen corresponding path program 1 times [2020-12-02 12:01:28,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:01:28,264 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663737952] [2020-12-02 12:01:28,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:01:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 12:01:28,305 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 12:01:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 12:01:28,364 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 12:01:28,413 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-02 12:01:28,413 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-02 12:01:28,414 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-02 12:01:28,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 12:01:28 BasicIcfg [2020-12-02 12:01:28,534 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-02 12:01:28,534 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-02 12:01:28,535 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-02 12:01:28,535 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-02 12:01:28,535 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:01:04" (3/4) ... [2020-12-02 12:01:28,538 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-02 12:01:28,663 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-12-02 12:01:28,663 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-02 12:01:28,664 INFO L168 Benchmark]: Toolchain (without parser) took 27826.84 ms. Allocated memory was 48.2 MB in the beginning and 343.9 MB in the end (delta: 295.7 MB). Free memory was 23.6 MB in the beginning and 145.9 MB in the end (delta: -122.4 MB). Peak memory consumption was 174.4 MB. Max. memory is 16.1 GB. [2020-12-02 12:01:28,664 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 39.8 MB. Free memory was 17.8 MB in the beginning and 17.7 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 12:01:28,665 INFO L168 Benchmark]: CACSL2BoogieTranslator took 877.86 ms. Allocated memory is still 48.2 MB. Free memory was 23.3 MB in the beginning and 21.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 9.0 MB. Max. memory is 16.1 GB. [2020-12-02 12:01:28,665 INFO L168 Benchmark]: Boogie Procedure Inliner took 151.39 ms. Allocated memory is still 48.2 MB. Free memory was 21.6 MB in the beginning and 18.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-02 12:01:28,666 INFO L168 Benchmark]: Boogie Preprocessor took 121.60 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 18.7 MB in the beginning and 38.9 MB in the end (delta: -20.2 MB). Peak memory consumption was 2.9 MB. Max. memory is 16.1 GB. [2020-12-02 12:01:28,666 INFO L168 Benchmark]: RCFGBuilder took 2712.35 ms. Allocated memory was 58.7 MB in the beginning and 86.0 MB in the end (delta: 27.3 MB). Free memory was 38.9 MB in the beginning and 34.6 MB in the end (delta: 4.3 MB). Peak memory consumption was 34.9 MB. Max. memory is 16.1 GB. [2020-12-02 12:01:28,667 INFO L168 Benchmark]: TraceAbstraction took 23823.68 ms. Allocated memory was 86.0 MB in the beginning and 343.9 MB in the end (delta: 257.9 MB). Free memory was 33.8 MB in the beginning and 162.7 MB in the end (delta: -128.9 MB). Peak memory consumption was 129.7 MB. Max. memory is 16.1 GB. [2020-12-02 12:01:28,667 INFO L168 Benchmark]: Witness Printer took 128.62 ms. Allocated memory is still 343.9 MB. Free memory was 162.7 MB in the beginning and 145.9 MB in the end (delta: 16.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-12-02 12:01:28,669 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.38 ms. Allocated memory is still 39.8 MB. Free memory was 17.8 MB in the beginning and 17.7 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 877.86 ms. Allocated memory is still 48.2 MB. Free memory was 23.3 MB in the beginning and 21.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 9.0 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 151.39 ms. Allocated memory is still 48.2 MB. Free memory was 21.6 MB in the beginning and 18.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 121.60 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 18.7 MB in the beginning and 38.9 MB in the end (delta: -20.2 MB). Peak memory consumption was 2.9 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2712.35 ms. Allocated memory was 58.7 MB in the beginning and 86.0 MB in the end (delta: 27.3 MB). Free memory was 38.9 MB in the beginning and 34.6 MB in the end (delta: 4.3 MB). Peak memory consumption was 34.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 23823.68 ms. Allocated memory was 86.0 MB in the beginning and 343.9 MB in the end (delta: 257.9 MB). Free memory was 33.8 MB in the beginning and 162.7 MB in the end (delta: -128.9 MB). Peak memory consumption was 129.7 MB. Max. memory is 16.1 GB. * Witness Printer took 128.62 ms. Allocated memory is still 343.9 MB. Free memory was 162.7 MB in the beginning and 145.9 MB in the end (delta: 16.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1543 VarBasedMoverChecksPositive, 63 VarBasedMoverChecksNegative, 8 SemBasedMoverChecksPositive, 55 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.7s, 158 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 17.3s, 123 PlacesBefore, 45 PlacesAfterwards, 112 TransitionsBefore, 33 TransitionsAfterwards, 2406 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 91 TotalNumberOfCompositions, 6250 MoverChecksTotal - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L722] 0 int z = 0; [L723] 0 _Bool z$flush_delayed; [L724] 0 int z$mem_tmp; [L725] 0 _Bool z$r_buff0_thd0; [L726] 0 _Bool z$r_buff0_thd1; [L727] 0 _Bool z$r_buff0_thd2; [L728] 0 _Bool z$r_buff0_thd3; [L729] 0 _Bool z$r_buff0_thd4; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$r_buff1_thd4; [L735] 0 _Bool z$read_delayed; [L736] 0 int *z$read_delayed_var; [L737] 0 int z$w_buff0; [L738] 0 _Bool z$w_buff0_used; [L739] 0 int z$w_buff1; [L740] 0 _Bool z$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L834] 0 pthread_t t1541; [L835] FCALL, FORK 0 pthread_create(&t1541, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 pthread_t t1542; [L837] FCALL, FORK 0 pthread_create(&t1542, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1543; [L839] FCALL, FORK 0 pthread_create(&t1543, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1544; [L841] FCALL, FORK 0 pthread_create(&t1544, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 2 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L761] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, 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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L782] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L782] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L783] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L786] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 3 return 0; [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L815] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L816] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L819] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 4 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z [L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L860] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L861] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L861] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L862] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L866] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L866] 0 z = z$flush_delayed ? z$mem_tmp : z [L867] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 111 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 23.5s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 17.6s, HoareTripleCheckerStatistics: 615 SDtfs, 773 SDslu, 1165 SDs, 0 SdLazy, 396 SolverSat, 116 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3082occurred 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: 1.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 492 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 289 NumberOfCodeBlocks, 289 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 247 ConstructedInterpolants, 0 QuantifiedInterpolants, 17988 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...