./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix057_rmo.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_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b9f0d6f00c4a03763e12a033ab517f3e7d39b81a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:57,115 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-02 12:00:57,120 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-02 12:00:57,186 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-02 12:00:57,187 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-02 12:00:57,193 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-02 12:00:57,198 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-02 12:00:57,206 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-02 12:00:57,211 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-02 12:00:57,219 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-02 12:00:57,221 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-02 12:00:57,227 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-02 12:00:57,227 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-02 12:00:57,232 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-02 12:00:57,234 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-02 12:00:57,237 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-02 12:00:57,239 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-02 12:00:57,243 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-02 12:00:57,248 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-02 12:00:57,258 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-02 12:00:57,260 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-02 12:00:57,262 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-02 12:00:57,264 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-02 12:00:57,267 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-02 12:00:57,277 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-02 12:00:57,278 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-02 12:00:57,278 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-02 12:00:57,281 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-02 12:00:57,282 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-02 12:00:57,284 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-02 12:00:57,284 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-02 12:00:57,285 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-02 12:00:57,289 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-02 12:00:57,290 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-02 12:00:57,292 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-02 12:00:57,293 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-02 12:00:57,294 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-02 12:00:57,295 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-02 12:00:57,295 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-02 12:00:57,298 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-02 12:00:57,300 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-02 12:00:57,302 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:57,369 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-02 12:00:57,370 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-02 12:00:57,373 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-02 12:00:57,374 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-02 12:00:57,375 INFO L138 SettingsManager]: * Use SBE=true [2020-12-02 12:00:57,375 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-02 12:00:57,375 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-02 12:00:57,376 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-02 12:00:57,376 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-02 12:00:57,377 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-02 12:00:57,378 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-02 12:00:57,378 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-02 12:00:57,379 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-02 12:00:57,379 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-02 12:00:57,379 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-02 12:00:57,380 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-02 12:00:57,380 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-02 12:00:57,380 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-02 12:00:57,381 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-02 12:00:57,381 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-02 12:00:57,382 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-02 12:00:57,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 12:00:57,382 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-02 12:00:57,383 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-02 12:00:57,383 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-02 12:00:57,383 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-02 12:00:57,383 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-02 12:00:57,384 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-02 12:00:57,384 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-02 12:00:57,384 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 -> b9f0d6f00c4a03763e12a033ab517f3e7d39b81a [2020-12-02 12:00:57,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-02 12:00:57,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-02 12:00:57,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-02 12:00:57,915 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-02 12:00:57,916 INFO L275 PluginConnector]: CDTParser initialized [2020-12-02 12:00:57,918 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix057_rmo.opt.i [2020-12-02 12:00:58,010 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2a0a2a8d/634851aa084347958c5633b95bff707f/FLAGae9b81fca [2020-12-02 12:00:58,771 INFO L306 CDTParser]: Found 1 translation units. [2020-12-02 12:00:58,772 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix057_rmo.opt.i [2020-12-02 12:00:58,805 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2a0a2a8d/634851aa084347958c5633b95bff707f/FLAGae9b81fca [2020-12-02 12:00:58,944 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2a0a2a8d/634851aa084347958c5633b95bff707f [2020-12-02 12:00:58,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-02 12:00:58,949 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-02 12:00:58,951 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-02 12:00:58,951 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-02 12:00:58,956 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-02 12:00:58,957 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:00:58" (1/1) ... [2020-12-02 12:00:58,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f762b78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:00:58, skipping insertion in model container [2020-12-02 12:00:58,961 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:00:58" (1/1) ... [2020-12-02 12:00:58,970 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-02 12:00:59,049 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-02 12:00:59,353 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_rmo.opt.i[948,961] [2020-12-02 12:00:59,740 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-02 12:00:59,754 INFO L203 MainTranslator]: Completed pre-run [2020-12-02 12:00:59,768 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_rmo.opt.i[948,961] [2020-12-02 12:00:59,840 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-02 12:00:59,953 INFO L208 MainTranslator]: Completed translation [2020-12-02 12:00:59,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:00:59 WrapperNode [2020-12-02 12:00:59,958 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-02 12:00:59,963 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-02 12:00:59,963 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-02 12:00:59,963 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-02 12:00:59,973 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:00:59" (1/1) ... [2020-12-02 12:01:00,023 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:00:59" (1/1) ... [2020-12-02 12:01:00,082 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-02 12:01:00,083 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-02 12:01:00,083 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-02 12:01:00,083 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-02 12:01:00,093 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:00:59" (1/1) ... [2020-12-02 12:01:00,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:00:59" (1/1) ... [2020-12-02 12:01:00,113 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:00:59" (1/1) ... [2020-12-02 12:01:00,113 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:00:59" (1/1) ... [2020-12-02 12:01:00,136 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:00:59" (1/1) ... [2020-12-02 12:01:00,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:00:59" (1/1) ... [2020-12-02 12:01:00,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:00:59" (1/1) ... [2020-12-02 12:01:00,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-02 12:01:00,152 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-02 12:01:00,152 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-02 12:01:00,152 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-02 12:01:00,153 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:00:59" (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:00,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-02 12:01:00,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-02 12:01:00,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-02 12:01:00,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-02 12:01:00,253 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-02 12:01:00,253 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-02 12:01:00,253 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-02 12:01:00,254 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-02 12:01:00,254 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-02 12:01:00,254 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-02 12:01:00,254 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-12-02 12:01:00,254 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-12-02 12:01:00,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-02 12:01:00,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-02 12:01:00,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-02 12:01:00,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-02 12:01:00,257 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:02,257 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-02 12:01:02,257 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-02 12:01:02,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:01:02 BoogieIcfgContainer [2020-12-02 12:01:02,261 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-02 12:01:02,262 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-02 12:01:02,263 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-02 12:01:02,266 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-02 12:01:02,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:00:58" (1/3) ... [2020-12-02 12:01:02,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c0bb523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:01:02, skipping insertion in model container [2020-12-02 12:01:02,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:00:59" (2/3) ... [2020-12-02 12:01:02,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c0bb523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:01:02, skipping insertion in model container [2020-12-02 12:01:02,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:01:02" (3/3) ... [2020-12-02 12:01:02,270 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_rmo.opt.i [2020-12-02 12:01:02,286 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-02 12:01:02,286 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-02 12:01:02,291 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-02 12:01:02,292 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-02 12:01:02,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,343 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,343 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,344 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,344 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,347 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,347 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,347 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,347 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,348 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,348 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,348 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,349 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,349 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,352 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,352 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,354 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,354 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,356 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,356 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,357 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,357 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,361 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,361 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,361 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,361 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,362 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,362 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,362 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,362 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,363 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,363 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:02,363 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,363 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:02,364 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,364 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:02,364 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,364 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:02,364 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,365 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,365 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,365 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,365 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,365 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,365 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,367 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,368 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,368 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,368 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,368 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,368 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,369 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,373 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,373 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,376 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,376 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,385 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,385 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,388 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,389 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,391 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,391 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,391 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,398 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,399 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,399 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,399 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,399 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:02,399 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,400 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,400 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,400 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,402 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,402 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,403 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,403 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:01:02,404 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-02 12:01:02,418 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-12-02 12:01:02,456 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-02 12:01:02,457 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-02 12:01:02,457 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-02 12:01:02,457 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-02 12:01:02,457 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-02 12:01:02,457 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-02 12:01:02,458 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-02 12:01:02,458 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-02 12:01:02,479 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-02 12:01:02,482 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 112 transitions, 244 flow [2020-12-02 12:01:02,486 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 112 transitions, 244 flow [2020-12-02 12:01:02,488 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 244 flow [2020-12-02 12:01:02,578 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2020-12-02 12:01:02,579 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-02 12:01:02,585 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:02,592 INFO L116 LiptonReduction]: Number of co-enabled transitions 2406 [2020-12-02 12:01:02,782 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:02,783 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:02,786 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:02,787 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:02,885 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:02,886 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:02,891 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:02,892 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:03,037 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:03,037 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:03,041 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:03,041 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:03,043 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:03,043 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:03,048 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:03,049 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:01:03,051 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:03,052 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:01:03,055 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:03,056 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:01:03,060 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:03,061 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:03,063 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:03,063 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:03,066 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:03,066 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:03,150 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:03,151 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:03,152 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:03,153 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:03,156 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-02 12:01:03,156 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 12:01:03,160 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:03,161 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:03,237 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:03,238 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:03,239 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:03,240 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:03,289 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-02 12:01:03,290 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:03,291 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-02 12:01:03,291 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:03,565 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:03,565 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:03,567 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:03,568 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:03,630 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2020-12-02 12:01:03,631 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:03,632 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 2, 1] term [2020-12-02 12:01:03,633 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:03,634 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2020-12-02 12:01:03,634 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:03,639 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:03,639 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:03,640 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:03,641 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:03,695 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:03,696 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:03,697 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:03,698 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:03,747 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:03,748 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:03,749 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:03,749 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:04,069 WARN L197 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-12-02 12:01:04,788 WARN L197 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2020-12-02 12:01:04,978 WARN L197 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-12-02 12:01:05,023 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:05,024 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:05,025 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:05,026 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:05,029 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-02 12:01:05,029 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 12:01:05,033 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,033 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:05,100 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:05,100 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:05,103 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:05,104 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:05,105 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:05,105 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:05,109 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,109 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:01:05,111 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,111 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:01:05,113 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,114 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:01:05,118 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,118 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:05,122 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,122 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:05,124 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,125 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:05,204 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-02 12:01:05,205 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:05,206 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-02 12:01:05,206 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:05,236 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:05,237 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:05,239 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:05,239 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:05,304 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 2, 1] term [2020-12-02 12:01:05,304 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:05,305 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-12-02 12:01:05,306 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:05,343 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:05,344 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:05,345 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:05,345 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:05,386 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-02 12:01:05,386 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:05,387 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-02 12:01:05,388 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:05,420 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:05,421 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:05,422 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:05,422 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, 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,466 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:05,467 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:05,498 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-02 12:01:05,499 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:05,500 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-02 12:01:05,500 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:05,562 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:05,563 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:05,564 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:05,564 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:05,567 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-02 12:01:05,567 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 12:01:05,570 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,571 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:05,658 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:05,659 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:05,665 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:05,665 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:05,667 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:05,667 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:05,671 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,672 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:01:05,674 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,675 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:01:05,676 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,677 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:01:05,682 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,682 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:05,686 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,687 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:05,689 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,690 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:05,891 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-02 12:01:05,892 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:05,893 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-02 12:01:05,893 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:05,922 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:05,922 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:05,923 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:05,924 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:07,103 WARN L197 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-12-02 12:01:07,996 WARN L197 SmtUtils]: Spent 888.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 185 [2020-12-02 12:01:09,999 WARN L197 SmtUtils]: Spent 2.00 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2020-12-02 12:01:10,882 WARN L197 SmtUtils]: Spent 879.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2020-12-02 12:01:10,925 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:10,926 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:10,926 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:10,927 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:10,961 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 2, 1] term [2020-12-02 12:01:10,962 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:10,962 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-12-02 12:01:10,963 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:11,021 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:11,022 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:11,034 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:11,035 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:11,036 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:11,036 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:11,039 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:11,040 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:01:11,041 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:11,042 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:01:11,043 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:11,044 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:01:11,047 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:11,048 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:11,049 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:11,049 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:11,051 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:11,051 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:11,109 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:11,110 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:11,111 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:11,111 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:11,114 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-02 12:01:11,115 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 12:01:11,118 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:11,118 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:11,491 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-02 12:01:11,492 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:11,492 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-02 12:01:11,493 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:11,529 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:11,529 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:11,530 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:11,530 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:11,861 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:11,862 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:11,862 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:11,862 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:11,864 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:11,864 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:11,866 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:11,867 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:11,884 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:11,885 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:11,885 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:11,886 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:11,887 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:11,888 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:01:11,890 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:11,890 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:01:11,918 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-02 12:01:11,919 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:11,920 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-02 12:01:11,920 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:11,939 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:11,940 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:11,941 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:11,941 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:11,974 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:11,974 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:11,975 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:11,975 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:11,998 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-02 12:01:11,998 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:11,999 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-02 12:01:11,999 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:12,218 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:12,219 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:12,220 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:12,220 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:12,222 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:12,223 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:12,224 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:12,225 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:12,245 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:12,246 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:12,247 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:12,247 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:12,249 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:12,249 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:01:12,252 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:12,253 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:01:12,742 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-02 12:01:12,743 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:12,779 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:12,779 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:12,780 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:12,781 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:12,782 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:12,783 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:01:12,785 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:12,785 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:01:12,802 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:12,803 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:12,804 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:12,804 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:12,806 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:12,806 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:12,808 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:12,809 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:12,919 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-02 12:01:12,920 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:12,921 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-02 12:01:12,921 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:12,952 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:12,953 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:12,953 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:12,954 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:13,206 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-12-02 12:01:13,404 WARN L197 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-02 12:01:13,606 WARN L197 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-02 12:01:13,690 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:13,691 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:13,693 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:13,693 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:13,695 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:13,695 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:13,697 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:13,698 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:13,699 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:13,700 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:13,703 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:13,703 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:13,706 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:13,706 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:13,708 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:13,708 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:13,772 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:13,773 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:13,774 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:13,774 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:13,777 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-02 12:01:13,777 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 12:01:13,780 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:13,781 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:13,907 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:13,907 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:13,908 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:13,908 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:13,937 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 2, 1] term [2020-12-02 12:01:13,938 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:13,938 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-12-02 12:01:13,938 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:13,972 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:13,972 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:13,975 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:13,975 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:13,976 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:13,976 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:13,978 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:13,979 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:13,979 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:13,980 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:13,982 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:13,982 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:13,983 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:13,983 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:13,985 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:13,985 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:14,042 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:14,043 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:14,044 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:14,045 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:14,047 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-02 12:01:14,047 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 12:01:14,050 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,050 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:14,243 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-02 12:01:14,243 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:14,244 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-02 12:01:14,244 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:14,270 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:14,270 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:14,271 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:14,271 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:14,322 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:14,322 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:14,323 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:14,323 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:14,366 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:14,367 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:14,368 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:14,368 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:14,493 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,496 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:14,496 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:14,499 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-02 12:01:14,500 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 12:01:14,504 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,504 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:14,543 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:14,544 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:14,546 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:14,546 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:14,547 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:14,548 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:14,550 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:14,551 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:14,552 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:14,553 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:14,554 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:14,555 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:14,556 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:14,556 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:14,558 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:14,558 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:14,674 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 2, 1] term [2020-12-02 12:01:14,674 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:14,675 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-12-02 12:01:14,675 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:14,698 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:14,698 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:14,699 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:14,699 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:14,783 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-02 12:01:14,784 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:14,785 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-02 12:01:14,785 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:14,787 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-02 12:01:14,788 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 12:01:14,791 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,791 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:14,823 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:01:14,824 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:01:14,832 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:14,833 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:14,834 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-02 12:01:14,834 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:14,836 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:14,836 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:14,838 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:14,838 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:14,840 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:14,840 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:14,842 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:14,843 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:14,844 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:14,844 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:01:16,563 WARN L197 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2020-12-02 12:01:16,763 WARN L197 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-12-02 12:01:17,208 WARN L197 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2020-12-02 12:01:17,420 WARN L197 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-12-02 12:01:17,432 INFO L131 LiptonReduction]: Checked pairs total: 6250 [2020-12-02 12:01:17,432 INFO L133 LiptonReduction]: Total number of compositions: 91 [2020-12-02 12:01:17,441 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 33 transitions, 86 flow [2020-12-02 12:01:17,697 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3082 states. [2020-12-02 12:01:17,700 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states. [2020-12-02 12:01:17,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-02 12:01:17,708 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:01:17,709 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:01:17,710 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:17,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:01:17,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1657207024, now seen corresponding path program 1 times [2020-12-02 12:01:17,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:01:17,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281896892] [2020-12-02 12:01:17,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:01:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:01:18,043 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:18,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281896892] [2020-12-02 12:01:18,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:01:18,045 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-02 12:01:18,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843746424] [2020-12-02 12:01:18,051 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-02 12:01:18,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:01:18,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-02 12:01:18,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 12:01:18,069 INFO L87 Difference]: Start difference. First operand 3082 states. Second operand 3 states. [2020-12-02 12:01:18,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:01:18,213 INFO L93 Difference]: Finished difference Result 2602 states and 10064 transitions. [2020-12-02 12:01:18,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-02 12:01:18,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-12-02 12:01:18,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:01:18,277 INFO L225 Difference]: With dead ends: 2602 [2020-12-02 12:01:18,277 INFO L226 Difference]: Without dead ends: 2202 [2020-12-02 12:01:18,278 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:18,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2202 states. [2020-12-02 12:01:18,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2202 to 2202. [2020-12-02 12:01:18,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2202 states. [2020-12-02 12:01:18,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 8424 transitions. [2020-12-02 12:01:18,473 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 8424 transitions. Word has length 9 [2020-12-02 12:01:18,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:01:18,474 INFO L481 AbstractCegarLoop]: Abstraction has 2202 states and 8424 transitions. [2020-12-02 12:01:18,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-02 12:01:18,474 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 8424 transitions. [2020-12-02 12:01:18,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-02 12:01:18,478 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:01:18,478 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:01:18,479 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-02 12:01:18,479 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:18,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:01:18,480 INFO L82 PathProgramCache]: Analyzing trace with hash 796408796, now seen corresponding path program 1 times [2020-12-02 12:01:18,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:01:18,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246100556] [2020-12-02 12:01:18,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:01:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:01:18,674 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:18,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246100556] [2020-12-02 12:01:18,675 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:01:18,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-02 12:01:18,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485038855] [2020-12-02 12:01:18,678 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 12:01:18,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:01:18,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 12:01:18,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 12:01:18,679 INFO L87 Difference]: Start difference. First operand 2202 states and 8424 transitions. Second operand 4 states. [2020-12-02 12:01:18,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:01:18,756 INFO L93 Difference]: Finished difference Result 2502 states and 9254 transitions. [2020-12-02 12:01:18,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 12:01:18,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-12-02 12:01:18,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:01:18,777 INFO L225 Difference]: With dead ends: 2502 [2020-12-02 12:01:18,777 INFO L226 Difference]: Without dead ends: 2102 [2020-12-02 12:01:18,778 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:18,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2102 states. [2020-12-02 12:01:18,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2102 to 2102. [2020-12-02 12:01:18,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2102 states. [2020-12-02 12:01:18,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 7964 transitions. [2020-12-02 12:01:18,886 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 7964 transitions. Word has length 12 [2020-12-02 12:01:18,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:01:18,887 INFO L481 AbstractCegarLoop]: Abstraction has 2102 states and 7964 transitions. [2020-12-02 12:01:18,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 12:01:18,887 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 7964 transitions. [2020-12-02 12:01:18,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-02 12:01:18,893 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:01:18,894 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:01:18,894 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-02 12:01:18,894 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:18,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:01:18,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1081135003, now seen corresponding path program 1 times [2020-12-02 12:01:18,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:01:18,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601099899] [2020-12-02 12:01:18,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:01:18,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:01:19,061 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:19,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601099899] [2020-12-02 12:01:19,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:01:19,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-02 12:01:19,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293623137] [2020-12-02 12:01:19,062 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 12:01:19,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:01:19,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 12:01:19,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 12:01:19,067 INFO L87 Difference]: Start difference. First operand 2102 states and 7964 transitions. Second operand 4 states. [2020-12-02 12:01:19,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:01:19,131 INFO L93 Difference]: Finished difference Result 2392 states and 8786 transitions. [2020-12-02 12:01:19,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 12:01:19,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-12-02 12:01:19,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:01:19,152 INFO L225 Difference]: With dead ends: 2392 [2020-12-02 12:01:19,152 INFO L226 Difference]: Without dead ends: 2042 [2020-12-02 12:01:19,152 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:19,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states. [2020-12-02 12:01:19,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 2042. [2020-12-02 12:01:19,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2042 states. [2020-12-02 12:01:19,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 7696 transitions. [2020-12-02 12:01:19,287 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 7696 transitions. Word has length 13 [2020-12-02 12:01:19,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:01:19,288 INFO L481 AbstractCegarLoop]: Abstraction has 2042 states and 7696 transitions. [2020-12-02 12:01:19,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 12:01:19,288 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 7696 transitions. [2020-12-02 12:01:19,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-02 12:01:19,291 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:01:19,291 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:01:19,291 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-02 12:01:19,292 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:19,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:01:19,292 INFO L82 PathProgramCache]: Analyzing trace with hash 844817491, now seen corresponding path program 1 times [2020-12-02 12:01:19,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:01:19,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436995258] [2020-12-02 12:01:19,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:01:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:01:19,504 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:19,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436995258] [2020-12-02 12:01:19,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:01:19,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-02 12:01:19,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616686434] [2020-12-02 12:01:19,506 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-02 12:01:19,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:01:19,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-02 12:01:19,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-02 12:01:19,507 INFO L87 Difference]: Start difference. First operand 2042 states and 7696 transitions. Second operand 5 states. [2020-12-02 12:01:19,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:01:19,618 INFO L93 Difference]: Finished difference Result 2318 states and 8482 transitions. [2020-12-02 12:01:19,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 12:01:19,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-12-02 12:01:19,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:01:19,640 INFO L225 Difference]: With dead ends: 2318 [2020-12-02 12:01:19,641 INFO L226 Difference]: Without dead ends: 1998 [2020-12-02 12:01:19,641 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-02 12:01:19,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2020-12-02 12:01:19,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1998. [2020-12-02 12:01:19,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states. [2020-12-02 12:01:19,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 7504 transitions. [2020-12-02 12:01:19,729 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 7504 transitions. Word has length 14 [2020-12-02 12:01:19,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:01:19,730 INFO L481 AbstractCegarLoop]: Abstraction has 1998 states and 7504 transitions. [2020-12-02 12:01:19,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-02 12:01:19,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 7504 transitions. [2020-12-02 12:01:19,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-02 12:01:19,734 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:01:19,734 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:19,734 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-02 12:01:19,735 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:19,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:01:19,735 INFO L82 PathProgramCache]: Analyzing trace with hash -496330171, now seen corresponding path program 1 times [2020-12-02 12:01:19,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:01:19,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322386626] [2020-12-02 12:01:19,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:01:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:01:19,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:01:19,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322386626] [2020-12-02 12:01:19,919 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:01:19,919 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 12:01:19,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528067902] [2020-12-02 12:01:19,920 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 12:01:19,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:01:19,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 12:01:19,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-02 12:01:19,922 INFO L87 Difference]: Start difference. First operand 1998 states and 7504 transitions. Second operand 6 states. [2020-12-02 12:01:20,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:01:20,126 INFO L93 Difference]: Finished difference Result 2414 states and 8952 transitions. [2020-12-02 12:01:20,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-02 12:01:20,127 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-12-02 12:01:20,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:01:20,149 INFO L225 Difference]: With dead ends: 2414 [2020-12-02 12:01:20,149 INFO L226 Difference]: Without dead ends: 2158 [2020-12-02 12:01:20,149 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-12-02 12:01:20,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158 states. [2020-12-02 12:01:20,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 2158. [2020-12-02 12:01:20,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2158 states. [2020-12-02 12:01:20,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2158 states to 2158 states and 8128 transitions. [2020-12-02 12:01:20,242 INFO L78 Accepts]: Start accepts. Automaton has 2158 states and 8128 transitions. Word has length 15 [2020-12-02 12:01:20,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:01:20,242 INFO L481 AbstractCegarLoop]: Abstraction has 2158 states and 8128 transitions. [2020-12-02 12:01:20,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 12:01:20,242 INFO L276 IsEmpty]: Start isEmpty. Operand 2158 states and 8128 transitions. [2020-12-02 12:01:20,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-02 12:01:20,246 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:01:20,246 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:20,246 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-02 12:01:20,246 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:20,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:01:20,247 INFO L82 PathProgramCache]: Analyzing trace with hash 417955619, now seen corresponding path program 2 times [2020-12-02 12:01:20,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:01:20,248 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995445516] [2020-12-02 12:01:20,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:01:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:01:20,417 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:20,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995445516] [2020-12-02 12:01:20,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:01:20,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 12:01:20,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077807195] [2020-12-02 12:01:20,418 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 12:01:20,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:01:20,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 12:01:20,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-02 12:01:20,419 INFO L87 Difference]: Start difference. First operand 2158 states and 8128 transitions. Second operand 6 states. [2020-12-02 12:01:20,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:01:20,556 INFO L93 Difference]: Finished difference Result 2326 states and 8540 transitions. [2020-12-02 12:01:20,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 12:01:20,557 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-12-02 12:01:20,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:01:20,595 INFO L225 Difference]: With dead ends: 2326 [2020-12-02 12:01:20,596 INFO L226 Difference]: Without dead ends: 2070 [2020-12-02 12:01:20,596 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-12-02 12:01:20,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2070 states. [2020-12-02 12:01:20,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2070 to 2070. [2020-12-02 12:01:20,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2070 states. [2020-12-02 12:01:20,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 2070 states and 7744 transitions. [2020-12-02 12:01:20,690 INFO L78 Accepts]: Start accepts. Automaton has 2070 states and 7744 transitions. Word has length 15 [2020-12-02 12:01:20,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:01:20,690 INFO L481 AbstractCegarLoop]: Abstraction has 2070 states and 7744 transitions. [2020-12-02 12:01:20,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 12:01:20,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 7744 transitions. [2020-12-02 12:01:20,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-02 12:01:20,695 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:01:20,695 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:20,696 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-02 12:01:20,696 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:20,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:01:20,697 INFO L82 PathProgramCache]: Analyzing trace with hash 418193947, now seen corresponding path program 1 times [2020-12-02 12:01:20,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:01:20,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74545039] [2020-12-02 12:01:20,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:01:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:01:20,829 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:20,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74545039] [2020-12-02 12:01:20,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:01:20,830 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-02 12:01:20,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298172492] [2020-12-02 12:01:20,830 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-02 12:01:20,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:01:20,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-02 12:01:20,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-02 12:01:20,832 INFO L87 Difference]: Start difference. First operand 2070 states and 7744 transitions. Second operand 5 states. [2020-12-02 12:01:20,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:01:20,953 INFO L93 Difference]: Finished difference Result 2296 states and 8422 transitions. [2020-12-02 12:01:20,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 12:01:20,954 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-12-02 12:01:20,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:01:20,971 INFO L225 Difference]: With dead ends: 2296 [2020-12-02 12:01:20,971 INFO L226 Difference]: Without dead ends: 2086 [2020-12-02 12:01:20,972 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:20,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2086 states. [2020-12-02 12:01:21,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2086 to 2086. [2020-12-02 12:01:21,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2086 states. [2020-12-02 12:01:21,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2086 states to 2086 states and 7800 transitions. [2020-12-02 12:01:21,053 INFO L78 Accepts]: Start accepts. Automaton has 2086 states and 7800 transitions. Word has length 15 [2020-12-02 12:01:21,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:01:21,054 INFO L481 AbstractCegarLoop]: Abstraction has 2086 states and 7800 transitions. [2020-12-02 12:01:21,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-02 12:01:21,054 INFO L276 IsEmpty]: Start isEmpty. Operand 2086 states and 7800 transitions. [2020-12-02 12:01:21,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-02 12:01:21,061 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:01:21,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:21,061 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-02 12:01:21,062 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:21,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:01:21,062 INFO L82 PathProgramCache]: Analyzing trace with hash -516647633, now seen corresponding path program 2 times [2020-12-02 12:01:21,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:01:21,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341788917] [2020-12-02 12:01:21,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:01:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:01:21,147 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:21,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341788917] [2020-12-02 12:01:21,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:01:21,148 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 12:01:21,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731631190] [2020-12-02 12:01:21,149 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 12:01:21,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:01:21,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 12:01:21,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-02 12:01:21,150 INFO L87 Difference]: Start difference. First operand 2086 states and 7800 transitions. Second operand 6 states. [2020-12-02 12:01:21,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:01:21,275 INFO L93 Difference]: Finished difference Result 2212 states and 8106 transitions. [2020-12-02 12:01:21,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 12:01:21,276 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-12-02 12:01:21,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:01:21,288 INFO L225 Difference]: With dead ends: 2212 [2020-12-02 12:01:21,288 INFO L226 Difference]: Without dead ends: 2002 [2020-12-02 12:01:21,289 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-02 12:01:21,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2020-12-02 12:01:21,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1986. [2020-12-02 12:01:21,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1986 states. [2020-12-02 12:01:21,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1986 states to 1986 states and 7400 transitions. [2020-12-02 12:01:21,395 INFO L78 Accepts]: Start accepts. Automaton has 1986 states and 7400 transitions. Word has length 15 [2020-12-02 12:01:21,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:01:21,396 INFO L481 AbstractCegarLoop]: Abstraction has 1986 states and 7400 transitions. [2020-12-02 12:01:21,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 12:01:21,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 7400 transitions. [2020-12-02 12:01:21,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-02 12:01:21,402 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:01:21,402 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:21,402 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-02 12:01:21,403 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:21,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:01:21,405 INFO L82 PathProgramCache]: Analyzing trace with hash 70377803, now seen corresponding path program 1 times [2020-12-02 12:01:21,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:01:21,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951485174] [2020-12-02 12:01:21,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:01:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:01:21,527 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:21,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951485174] [2020-12-02 12:01:21,528 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:01:21,528 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 12:01:21,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071353196] [2020-12-02 12:01:21,529 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 12:01:21,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:01:21,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 12:01:21,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-02 12:01:21,530 INFO L87 Difference]: Start difference. First operand 1986 states and 7400 transitions. Second operand 6 states. [2020-12-02 12:01:21,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:01:21,678 INFO L93 Difference]: Finished difference Result 2370 states and 8702 transitions. [2020-12-02 12:01:21,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 12:01:21,679 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-12-02 12:01:21,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:01:21,694 INFO L225 Difference]: With dead ends: 2370 [2020-12-02 12:01:21,695 INFO L226 Difference]: Without dead ends: 2202 [2020-12-02 12:01:21,695 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-02 12:01:21,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2202 states. [2020-12-02 12:01:21,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2202 to 1954. [2020-12-02 12:01:21,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2020-12-02 12:01:21,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 7272 transitions. [2020-12-02 12:01:21,787 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 7272 transitions. Word has length 16 [2020-12-02 12:01:21,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:01:21,788 INFO L481 AbstractCegarLoop]: Abstraction has 1954 states and 7272 transitions. [2020-12-02 12:01:21,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 12:01:21,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 7272 transitions. [2020-12-02 12:01:21,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-02 12:01:21,794 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:01:21,794 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:21,794 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-02 12:01:21,794 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:21,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:01:21,795 INFO L82 PathProgramCache]: Analyzing trace with hash 79315103, now seen corresponding path program 2 times [2020-12-02 12:01:21,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:01:21,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866924714] [2020-12-02 12:01:21,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:01:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:01:21,881 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:21,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866924714] [2020-12-02 12:01:21,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:01:21,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 12:01:21,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317641058] [2020-12-02 12:01:21,883 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 12:01:21,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:01:21,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 12:01:21,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-02 12:01:21,884 INFO L87 Difference]: Start difference. First operand 1954 states and 7272 transitions. Second operand 6 states. [2020-12-02 12:01:22,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:01:22,011 INFO L93 Difference]: Finished difference Result 2170 states and 7946 transitions. [2020-12-02 12:01:22,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 12:01:22,012 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-12-02 12:01:22,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:01:22,025 INFO L225 Difference]: With dead ends: 2170 [2020-12-02 12:01:22,026 INFO L226 Difference]: Without dead ends: 2002 [2020-12-02 12:01:22,026 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-02 12:01:22,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2020-12-02 12:01:22,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1970. [2020-12-02 12:01:22,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1970 states. [2020-12-02 12:01:22,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1970 states and 7328 transitions. [2020-12-02 12:01:22,108 INFO L78 Accepts]: Start accepts. Automaton has 1970 states and 7328 transitions. Word has length 16 [2020-12-02 12:01:22,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:01:22,109 INFO L481 AbstractCegarLoop]: Abstraction has 1970 states and 7328 transitions. [2020-12-02 12:01:22,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 12:01:22,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 7328 transitions. [2020-12-02 12:01:22,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-02 12:01:22,115 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:01:22,115 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:22,115 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-02 12:01:22,115 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:22,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:01:22,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1134504105, now seen corresponding path program 3 times [2020-12-02 12:01:22,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:01:22,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987929641] [2020-12-02 12:01:22,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:01:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:01:22,270 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,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987929641] [2020-12-02 12:01:22,271 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:01:22,272 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 12:01:22,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837125159] [2020-12-02 12:01:22,272 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 12:01:22,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:01:22,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 12:01:22,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-02 12:01:22,275 INFO L87 Difference]: Start difference. First operand 1970 states and 7328 transitions. Second operand 6 states. [2020-12-02 12:01:22,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:01:22,437 INFO L93 Difference]: Finished difference Result 2202 states and 8058 transitions. [2020-12-02 12:01:22,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 12:01:22,438 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-12-02 12:01:22,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:01:22,449 INFO L225 Difference]: With dead ends: 2202 [2020-12-02 12:01:22,450 INFO L226 Difference]: Without dead ends: 2034 [2020-12-02 12:01:22,450 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-02 12:01:22,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2034 states. [2020-12-02 12:01:22,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 1906. [2020-12-02 12:01:22,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1906 states. [2020-12-02 12:01:22,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1906 states and 7040 transitions. [2020-12-02 12:01:22,524 INFO L78 Accepts]: Start accepts. Automaton has 1906 states and 7040 transitions. Word has length 16 [2020-12-02 12:01:22,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:01:22,524 INFO L481 AbstractCegarLoop]: Abstraction has 1906 states and 7040 transitions. [2020-12-02 12:01:22,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 12:01:22,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1906 states and 7040 transitions. [2020-12-02 12:01:22,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-02 12:01:22,529 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:01:22,529 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:22,529 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-02 12:01:22,530 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:22,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:01:22,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1163997195, now seen corresponding path program 4 times [2020-12-02 12:01:22,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:01:22,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923061766] [2020-12-02 12:01:22,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:01:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:01:22,689 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,690 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923061766] [2020-12-02 12:01:22,690 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:01:22,690 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 12:01:22,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862003552] [2020-12-02 12:01:22,691 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-02 12:01:22,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:01:22,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-02 12:01:22,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-02 12:01:22,692 INFO L87 Difference]: Start difference. First operand 1906 states and 7040 transitions. Second operand 7 states. [2020-12-02 12:01:22,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:01:22,835 INFO L93 Difference]: Finished difference Result 2266 states and 8222 transitions. [2020-12-02 12:01:22,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 12:01:22,836 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-12-02 12:01:22,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:01:22,847 INFO L225 Difference]: With dead ends: 2266 [2020-12-02 12:01:22,847 INFO L226 Difference]: Without dead ends: 2042 [2020-12-02 12:01:22,848 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-12-02 12:01:22,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states. [2020-12-02 12:01:22,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 1994. [2020-12-02 12:01:22,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1994 states. [2020-12-02 12:01:22,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1994 states and 7328 transitions. [2020-12-02 12:01:22,921 INFO L78 Accepts]: Start accepts. Automaton has 1994 states and 7328 transitions. Word has length 16 [2020-12-02 12:01:22,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:01:22,922 INFO L481 AbstractCegarLoop]: Abstraction has 1994 states and 7328 transitions. [2020-12-02 12:01:22,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-02 12:01:22,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 7328 transitions. [2020-12-02 12:01:22,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-02 12:01:22,927 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:01:22,928 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:22,928 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-02 12:01:22,928 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:22,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:01:22,929 INFO L82 PathProgramCache]: Analyzing trace with hash -274918620, now seen corresponding path program 1 times [2020-12-02 12:01:22,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:01:22,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487440348] [2020-12-02 12:01:22,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:01:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:01:23,064 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,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487440348] [2020-12-02 12:01:23,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:01:23,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 12:01:23,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803786953] [2020-12-02 12:01:23,066 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-02 12:01:23,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:01:23,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-02 12:01:23,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-02 12:01:23,067 INFO L87 Difference]: Start difference. First operand 1994 states and 7328 transitions. Second operand 7 states. [2020-12-02 12:01:23,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:01:23,199 INFO L93 Difference]: Finished difference Result 2534 states and 9026 transitions. [2020-12-02 12:01:23,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 12:01:23,200 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-12-02 12:01:23,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:01:23,210 INFO L225 Difference]: With dead ends: 2534 [2020-12-02 12:01:23,210 INFO L226 Difference]: Without dead ends: 2018 [2020-12-02 12:01:23,211 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-12-02 12:01:23,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2018 states. [2020-12-02 12:01:23,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2018 to 1658. [2020-12-02 12:01:23,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1658 states. [2020-12-02 12:01:23,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 5992 transitions. [2020-12-02 12:01:23,274 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 5992 transitions. Word has length 17 [2020-12-02 12:01:23,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:01:23,275 INFO L481 AbstractCegarLoop]: Abstraction has 1658 states and 5992 transitions. [2020-12-02 12:01:23,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-02 12:01:23,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 5992 transitions. [2020-12-02 12:01:23,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-02 12:01:23,280 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:01:23,280 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:23,280 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-02 12:01:23,280 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:23,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:01:23,281 INFO L82 PathProgramCache]: Analyzing trace with hash -267292124, now seen corresponding path program 1 times [2020-12-02 12:01:23,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:01:23,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002792906] [2020-12-02 12:01:23,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:01:23,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:01:23,349 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,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002792906] [2020-12-02 12:01:23,349 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:01:23,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-02 12:01:23,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308542051] [2020-12-02 12:01:23,350 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 12:01:23,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:01:23,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 12:01:23,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 12:01:23,352 INFO L87 Difference]: Start difference. First operand 1658 states and 5992 transitions. Second operand 4 states. [2020-12-02 12:01:23,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:01:23,398 INFO L93 Difference]: Finished difference Result 1722 states and 5682 transitions. [2020-12-02 12:01:23,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 12:01:23,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-12-02 12:01:23,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:01:23,405 INFO L225 Difference]: With dead ends: 1722 [2020-12-02 12:01:23,406 INFO L226 Difference]: Without dead ends: 1322 [2020-12-02 12:01:23,406 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:23,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2020-12-02 12:01:23,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1322. [2020-12-02 12:01:23,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2020-12-02 12:01:23,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 4330 transitions. [2020-12-02 12:01:23,450 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 4330 transitions. Word has length 17 [2020-12-02 12:01:23,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:01:23,450 INFO L481 AbstractCegarLoop]: Abstraction has 1322 states and 4330 transitions. [2020-12-02 12:01:23,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 12:01:23,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 4330 transitions. [2020-12-02 12:01:23,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-02 12:01:23,455 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:01:23,455 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:23,455 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-02 12:01:23,455 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:23,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:01:23,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1175676895, now seen corresponding path program 1 times [2020-12-02 12:01:23,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:01:23,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070946575] [2020-12-02 12:01:23,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:01:23,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:01:23,527 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,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070946575] [2020-12-02 12:01:23,528 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:01:23,528 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 12:01:23,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172940798] [2020-12-02 12:01:23,529 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-02 12:01:23,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:01:23,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-02 12:01:23,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-02 12:01:23,530 INFO L87 Difference]: Start difference. First operand 1322 states and 4330 transitions. Second operand 5 states. [2020-12-02 12:01:23,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:01:23,583 INFO L93 Difference]: Finished difference Result 1136 states and 3401 transitions. [2020-12-02 12:01:23,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 12:01:23,584 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-12-02 12:01:23,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:01:23,587 INFO L225 Difference]: With dead ends: 1136 [2020-12-02 12:01:23,588 INFO L226 Difference]: Without dead ends: 880 [2020-12-02 12:01:23,588 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:23,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2020-12-02 12:01:23,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 880. [2020-12-02 12:01:23,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2020-12-02 12:01:23,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 2592 transitions. [2020-12-02 12:01:23,614 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 2592 transitions. Word has length 18 [2020-12-02 12:01:23,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:01:23,614 INFO L481 AbstractCegarLoop]: Abstraction has 880 states and 2592 transitions. [2020-12-02 12:01:23,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-02 12:01:23,615 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 2592 transitions. [2020-12-02 12:01:23,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-02 12:01:23,617 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:01:23,618 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:23,618 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-02 12:01:23,618 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:23,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:01:23,619 INFO L82 PathProgramCache]: Analyzing trace with hash 908797382, now seen corresponding path program 1 times [2020-12-02 12:01:23,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:01:23,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289320796] [2020-12-02 12:01:23,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:01:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:01:23,674 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,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289320796] [2020-12-02 12:01:23,675 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:01:23,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-02 12:01:23,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166906699] [2020-12-02 12:01:23,676 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 12:01:23,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:01:23,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 12:01:23,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 12:01:23,677 INFO L87 Difference]: Start difference. First operand 880 states and 2592 transitions. Second operand 4 states. [2020-12-02 12:01:23,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:01:23,719 INFO L93 Difference]: Finished difference Result 1295 states and 3672 transitions. [2020-12-02 12:01:23,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 12:01:23,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-12-02 12:01:23,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:01:23,723 INFO L225 Difference]: With dead ends: 1295 [2020-12-02 12:01:23,723 INFO L226 Difference]: Without dead ends: 900 [2020-12-02 12:01:23,724 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:23,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2020-12-02 12:01:23,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 868. [2020-12-02 12:01:23,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2020-12-02 12:01:23,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 2424 transitions. [2020-12-02 12:01:23,749 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 2424 transitions. Word has length 19 [2020-12-02 12:01:23,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:01:23,750 INFO L481 AbstractCegarLoop]: Abstraction has 868 states and 2424 transitions. [2020-12-02 12:01:23,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 12:01:23,750 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 2424 transitions. [2020-12-02 12:01:23,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 12:01:23,753 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:01:23,753 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:23,753 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-02 12:01:23,753 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:23,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:01:23,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1820204981, now seen corresponding path program 1 times [2020-12-02 12:01:23,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:01:23,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120430474] [2020-12-02 12:01:23,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:01:23,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:01:23,817 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,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120430474] [2020-12-02 12:01:23,818 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:01:23,818 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-02 12:01:23,818 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030112888] [2020-12-02 12:01:23,819 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 12:01:23,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:01:23,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 12:01:23,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 12:01:23,820 INFO L87 Difference]: Start difference. First operand 868 states and 2424 transitions. Second operand 4 states. [2020-12-02 12:01:23,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:01:23,850 INFO L93 Difference]: Finished difference Result 1263 states and 3373 transitions. [2020-12-02 12:01:23,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 12:01:23,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-12-02 12:01:23,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:01:23,854 INFO L225 Difference]: With dead ends: 1263 [2020-12-02 12:01:23,855 INFO L226 Difference]: Without dead ends: 880 [2020-12-02 12:01:23,855 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:23,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2020-12-02 12:01:23,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 852. [2020-12-02 12:01:23,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2020-12-02 12:01:23,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 2243 transitions. [2020-12-02 12:01:23,879 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 2243 transitions. Word has length 20 [2020-12-02 12:01:23,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:01:23,880 INFO L481 AbstractCegarLoop]: Abstraction has 852 states and 2243 transitions. [2020-12-02 12:01:23,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 12:01:23,880 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 2243 transitions. [2020-12-02 12:01:23,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 12:01:23,882 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:01:23,883 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:23,883 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-02 12:01:23,883 INFO L429 AbstractCegarLoop]: === Iteration 18 === [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,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:01:23,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1693048300, now seen corresponding path program 1 times [2020-12-02 12:01:23,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:01:23,884 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920007608] [2020-12-02 12:01:23,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:01:23,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:01:23,968 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,970 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920007608] [2020-12-02 12:01:23,970 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:01:23,970 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 12:01:23,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912964934] [2020-12-02 12:01:23,973 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 12:01:23,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:01:23,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 12:01:23,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-02 12:01:23,975 INFO L87 Difference]: Start difference. First operand 852 states and 2243 transitions. Second operand 6 states. [2020-12-02 12:01:24,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:01:24,032 INFO L93 Difference]: Finished difference Result 736 states and 1888 transitions. [2020-12-02 12:01:24,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 12:01:24,033 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-12-02 12:01:24,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:01:24,035 INFO L225 Difference]: With dead ends: 736 [2020-12-02 12:01:24,035 INFO L226 Difference]: Without dead ends: 564 [2020-12-02 12:01:24,036 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:24,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-12-02 12:01:24,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2020-12-02 12:01:24,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2020-12-02 12:01:24,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 1425 transitions. [2020-12-02 12:01:24,062 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 1425 transitions. Word has length 20 [2020-12-02 12:01:24,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:01:24,063 INFO L481 AbstractCegarLoop]: Abstraction has 564 states and 1425 transitions. [2020-12-02 12:01:24,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 12:01:24,063 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 1425 transitions. [2020-12-02 12:01:24,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-02 12:01:24,065 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:01:24,065 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:24,065 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-02 12:01:24,065 INFO L429 AbstractCegarLoop]: === Iteration 19 === [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,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:01:24,066 INFO L82 PathProgramCache]: Analyzing trace with hash 550601577, now seen corresponding path program 1 times [2020-12-02 12:01:24,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:01:24,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361014899] [2020-12-02 12:01:24,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:01:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:01:24,126 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,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361014899] [2020-12-02 12:01:24,127 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:01:24,127 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 12:01:24,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020399826] [2020-12-02 12:01:24,127 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-02 12:01:24,128 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:01:24,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-02 12:01:24,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-02 12:01:24,129 INFO L87 Difference]: Start difference. First operand 564 states and 1425 transitions. Second operand 5 states. [2020-12-02 12:01:24,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:01:24,164 INFO L93 Difference]: Finished difference Result 745 states and 1814 transitions. [2020-12-02 12:01:24,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 12:01:24,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-12-02 12:01:24,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:01:24,166 INFO L225 Difference]: With dead ends: 745 [2020-12-02 12:01:24,166 INFO L226 Difference]: Without dead ends: 306 [2020-12-02 12:01:24,166 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:24,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2020-12-02 12:01:24,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2020-12-02 12:01:24,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2020-12-02 12:01:24,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 665 transitions. [2020-12-02 12:01:24,174 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 665 transitions. Word has length 23 [2020-12-02 12:01:24,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:01:24,174 INFO L481 AbstractCegarLoop]: Abstraction has 306 states and 665 transitions. [2020-12-02 12:01:24,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-02 12:01:24,174 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 665 transitions. [2020-12-02 12:01:24,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-02 12:01:24,175 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:01:24,176 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:24,176 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-02 12:01:24,176 INFO L429 AbstractCegarLoop]: === Iteration 20 === [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,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:01:24,177 INFO L82 PathProgramCache]: Analyzing trace with hash -259093983, now seen corresponding path program 2 times [2020-12-02 12:01:24,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:01:24,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877094549] [2020-12-02 12:01:24,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:01:24,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:01:24,260 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,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877094549] [2020-12-02 12:01:24,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:01:24,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-02 12:01:24,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595636951] [2020-12-02 12:01:24,262 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-02 12:01:24,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:01:24,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-02 12:01:24,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-02 12:01:24,263 INFO L87 Difference]: Start difference. First operand 306 states and 665 transitions. Second operand 7 states. [2020-12-02 12:01:24,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:01:24,330 INFO L93 Difference]: Finished difference Result 277 states and 608 transitions. [2020-12-02 12:01:24,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-02 12:01:24,331 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-12-02 12:01:24,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:01:24,331 INFO L225 Difference]: With dead ends: 277 [2020-12-02 12:01:24,331 INFO L226 Difference]: Without dead ends: 64 [2020-12-02 12:01:24,332 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:24,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-12-02 12:01:24,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-12-02 12:01:24,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-12-02 12:01:24,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 122 transitions. [2020-12-02 12:01:24,334 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 122 transitions. Word has length 23 [2020-12-02 12:01:24,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:01:24,334 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 122 transitions. [2020-12-02 12:01:24,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-02 12:01:24,334 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 122 transitions. [2020-12-02 12:01:24,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-02 12:01:24,335 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:01:24,335 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:24,335 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-02 12:01:24,335 INFO L429 AbstractCegarLoop]: === Iteration 21 === [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,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:01:24,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1810376578, now seen corresponding path program 1 times [2020-12-02 12:01:24,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:01:24,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549817658] [2020-12-02 12:01:24,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:01:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 12:01:24,384 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 12:01:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 12:01:24,446 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 12:01:24,519 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-02 12:01:24,519 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-02 12:01:24,520 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-02 12:01:24,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 12:01:24 BasicIcfg [2020-12-02 12:01:24,698 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-02 12:01:24,699 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-02 12:01:24,699 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-02 12:01:24,699 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-02 12:01:24,699 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:02" (3/4) ... [2020-12-02 12:01:24,703 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-02 12:01:24,850 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-12-02 12:01:24,850 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-02 12:01:24,852 INFO L168 Benchmark]: Toolchain (without parser) took 25902.45 ms. Allocated memory was 48.2 MB in the beginning and 390.1 MB in the end (delta: 341.8 MB). Free memory was 31.1 MB in the beginning and 163.1 MB in the end (delta: -132.1 MB). Peak memory consumption was 209.9 MB. Max. memory is 16.1 GB. [2020-12-02 12:01:24,852 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 39.8 MB. Free memory is still 25.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 12:01:24,852 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1009.88 ms. Allocated memory is still 48.2 MB. Free memory was 30.9 MB in the beginning and 28.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 16.0 MB. Max. memory is 16.1 GB. [2020-12-02 12:01:24,853 INFO L168 Benchmark]: Boogie Procedure Inliner took 119.52 ms. Allocated memory is still 48.2 MB. Free memory was 28.7 MB in the beginning and 25.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-02 12:01:24,853 INFO L168 Benchmark]: Boogie Preprocessor took 68.15 ms. Allocated memory is still 48.2 MB. Free memory was 25.9 MB in the beginning and 23.6 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-02 12:01:24,855 INFO L168 Benchmark]: RCFGBuilder took 2109.19 ms. Allocated memory was 48.2 MB in the beginning and 104.9 MB in the end (delta: 56.6 MB). Free memory was 23.6 MB in the beginning and 39.3 MB in the end (delta: -15.7 MB). Peak memory consumption was 41.1 MB. Max. memory is 16.1 GB. [2020-12-02 12:01:24,855 INFO L168 Benchmark]: TraceAbstraction took 22435.57 ms. Allocated memory was 104.9 MB in the beginning and 390.1 MB in the end (delta: 285.2 MB). Free memory was 38.4 MB in the beginning and 179.9 MB in the end (delta: -141.5 MB). Peak memory consumption was 144.5 MB. Max. memory is 16.1 GB. [2020-12-02 12:01:24,856 INFO L168 Benchmark]: Witness Printer took 151.99 ms. Allocated memory is still 390.1 MB. Free memory was 179.9 MB in the beginning and 163.1 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-12-02 12:01:24,858 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.22 ms. Allocated memory is still 39.8 MB. Free memory is still 25.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1009.88 ms. Allocated memory is still 48.2 MB. Free memory was 30.9 MB in the beginning and 28.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 16.0 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 119.52 ms. Allocated memory is still 48.2 MB. Free memory was 28.7 MB in the beginning and 25.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 68.15 ms. Allocated memory is still 48.2 MB. Free memory was 25.9 MB in the beginning and 23.6 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2109.19 ms. Allocated memory was 48.2 MB in the beginning and 104.9 MB in the end (delta: 56.6 MB). Free memory was 23.6 MB in the beginning and 39.3 MB in the end (delta: -15.7 MB). Peak memory consumption was 41.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 22435.57 ms. Allocated memory was 104.9 MB in the beginning and 390.1 MB in the end (delta: 285.2 MB). Free memory was 38.4 MB in the beginning and 179.9 MB in the end (delta: -141.5 MB). Peak memory consumption was 144.5 MB. Max. memory is 16.1 GB. * Witness Printer took 151.99 ms. Allocated memory is still 390.1 MB. Free memory was 179.9 MB in the beginning and 163.1 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 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.5s, 158 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 14.9s, 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 t1533; [L835] FCALL, FORK 0 pthread_create(&t1533, ((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 t1534; [L837] FCALL, FORK 0 pthread_create(&t1534, ((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 t1535; [L839] FCALL, FORK 0 pthread_create(&t1535, ((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 t1536; [L841] FCALL, FORK 0 pthread_create(&t1536, ((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] 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] 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] 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] 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] 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] 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=255, 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: 22.0s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 15.2s, HoareTripleCheckerStatistics: 807 SDtfs, 952 SDslu, 1604 SDs, 0 SdLazy, 568 SolverSat, 137 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 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.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 892 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 355 NumberOfCodeBlocks, 355 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 309 ConstructedInterpolants, 0 QuantifiedInterpolants, 27721 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...