./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix008_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix008_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a3331ca730809847e96143ef41f88bbabe55051 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-26 00:14:37,122 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 00:14:37,125 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 00:14:37,185 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 00:14:37,186 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 00:14:37,191 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 00:14:37,194 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 00:14:37,200 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 00:14:37,204 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 00:14:37,210 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 00:14:37,212 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 00:14:37,218 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 00:14:37,218 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 00:14:37,222 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 00:14:37,224 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 00:14:37,225 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 00:14:37,227 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 00:14:37,230 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 00:14:37,234 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 00:14:37,241 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 00:14:37,243 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 00:14:37,245 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 00:14:37,247 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 00:14:37,249 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 00:14:37,258 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 00:14:37,258 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 00:14:37,259 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 00:14:37,264 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 00:14:37,264 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 00:14:37,265 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 00:14:37,266 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 00:14:37,267 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 00:14:37,269 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 00:14:37,270 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 00:14:37,273 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 00:14:37,273 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 00:14:37,274 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 00:14:37,274 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 00:14:37,275 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 00:14:37,277 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 00:14:37,278 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 00:14:37,279 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-26 00:14:37,337 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 00:14:37,337 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 00:14:37,340 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 00:14:37,340 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 00:14:37,341 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 00:14:37,341 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 00:14:37,341 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 00:14:37,341 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 00:14:37,342 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 00:14:37,342 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 00:14:37,343 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-26 00:14:37,344 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-26 00:14:37,344 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-26 00:14:37,344 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 00:14:37,344 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 00:14:37,344 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 00:14:37,344 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-26 00:14:37,345 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 00:14:37,345 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 00:14:37,345 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-26 00:14:37,346 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-26 00:14:37,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-26 00:14:37,346 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 00:14:37,346 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-26 00:14:37,346 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-26 00:14:37,347 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 00:14:37,347 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-26 00:14:37,347 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-26 00:14:37,347 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 00:14:37,347 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 -> 3a3331ca730809847e96143ef41f88bbabe55051 [2020-10-26 00:14:37,765 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 00:14:37,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 00:14:37,823 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 00:14:37,825 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 00:14:37,826 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 00:14:37,827 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix008_tso.opt.i [2020-10-26 00:14:37,912 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88f57dc60/6d8d2cb570f745e2b0e160a6b2a65cdf/FLAG185e8f00d [2020-10-26 00:14:38,756 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 00:14:38,758 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix008_tso.opt.i [2020-10-26 00:14:38,787 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88f57dc60/6d8d2cb570f745e2b0e160a6b2a65cdf/FLAG185e8f00d [2020-10-26 00:14:38,928 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88f57dc60/6d8d2cb570f745e2b0e160a6b2a65cdf [2020-10-26 00:14:38,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 00:14:38,938 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 00:14:38,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 00:14:38,940 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 00:14:38,944 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 00:14:38,946 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 12:14:38" (1/1) ... [2020-10-26 00:14:38,950 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12ba82b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:14:38, skipping insertion in model container [2020-10-26 00:14:38,950 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 12:14:38" (1/1) ... [2020-10-26 00:14:38,976 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 00:14:39,048 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 00:14:39,700 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 00:14:39,712 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 00:14:39,780 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 00:14:39,908 INFO L208 MainTranslator]: Completed translation [2020-10-26 00:14:39,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:14:39 WrapperNode [2020-10-26 00:14:39,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 00:14:39,911 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 00:14:39,911 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 00:14:39,911 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 00:14:39,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:14:39" (1/1) ... [2020-10-26 00:14:39,984 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:14:39" (1/1) ... [2020-10-26 00:14:40,053 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 00:14:40,056 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 00:14:40,056 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 00:14:40,056 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 00:14:40,068 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:14:39" (1/1) ... [2020-10-26 00:14:40,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:14:39" (1/1) ... [2020-10-26 00:14:40,092 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:14:39" (1/1) ... [2020-10-26 00:14:40,092 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:14:39" (1/1) ... [2020-10-26 00:14:40,117 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:14:39" (1/1) ... [2020-10-26 00:14:40,127 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:14:39" (1/1) ... [2020-10-26 00:14:40,134 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:14:39" (1/1) ... [2020-10-26 00:14:40,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 00:14:40,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 00:14:40,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 00:14:40,153 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 00:14:40,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:14:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-26 00:14:40,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-26 00:14:40,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-26 00:14:40,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 00:14:40,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-26 00:14:40,245 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-26 00:14:40,245 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-26 00:14:40,246 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-26 00:14:40,246 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-26 00:14:40,246 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-26 00:14:40,246 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-26 00:14:40,247 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-26 00:14:40,247 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-26 00:14:40,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 00:14:40,247 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-26 00:14:40,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 00:14:40,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 00:14:40,250 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-26 00:14:44,236 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 00:14:44,236 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-26 00:14:44,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 12:14:44 BoogieIcfgContainer [2020-10-26 00:14:44,239 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 00:14:44,241 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-26 00:14:44,241 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-26 00:14:44,245 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-26 00:14:44,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 12:14:38" (1/3) ... [2020-10-26 00:14:44,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2188d828 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 12:14:44, skipping insertion in model container [2020-10-26 00:14:44,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:14:39" (2/3) ... [2020-10-26 00:14:44,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2188d828 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 12:14:44, skipping insertion in model container [2020-10-26 00:14:44,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 12:14:44" (3/3) ... [2020-10-26 00:14:44,248 INFO L111 eAbstractionObserver]: Analyzing ICFG mix008_tso.opt.i [2020-10-26 00:14:44,261 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-26 00:14:44,261 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-26 00:14:44,267 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-26 00:14:44,268 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-26 00:14:44,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,344 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,344 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,345 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,345 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,345 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,346 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,346 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,346 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,347 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,347 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,347 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,347 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,347 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,350 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,350 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,350 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,350 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,350 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,350 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,351 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,351 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,351 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,351 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,351 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,357 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,359 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,359 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,359 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,359 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,359 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,360 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,360 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,360 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,360 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,360 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,361 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,361 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,361 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,361 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,361 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,362 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,362 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,362 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,362 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,362 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,363 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,363 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,363 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,363 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,363 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,364 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,364 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,364 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,364 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,364 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,364 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,365 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,365 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,365 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,365 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,365 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,366 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,366 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,366 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,366 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,366 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,366 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,367 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,367 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,367 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,367 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,367 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,367 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,368 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,368 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,371 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,371 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,373 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,373 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,376 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,376 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,376 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,377 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,377 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,377 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,377 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,378 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,378 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,378 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,378 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,378 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,378 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,379 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,379 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,379 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,379 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,379 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,379 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,380 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,380 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,383 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,383 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,383 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,384 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,384 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,384 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,384 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,384 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,384 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,385 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,385 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,385 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,388 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,388 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,389 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,389 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,395 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,395 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,396 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,396 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,399 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,399 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,405 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,408 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:14:44,413 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-26 00:14:44,426 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-26 00:14:44,449 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-26 00:14:44,449 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-26 00:14:44,449 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-26 00:14:44,449 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 00:14:44,450 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 00:14:44,450 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-26 00:14:44,450 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 00:14:44,450 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-26 00:14:44,463 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-26 00:14:44,465 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 120 transitions, 260 flow [2020-10-26 00:14:44,469 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 120 transitions, 260 flow [2020-10-26 00:14:44,471 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 130 places, 120 transitions, 260 flow [2020-10-26 00:14:44,526 INFO L129 PetriNetUnfolder]: 3/116 cut-off events. [2020-10-26 00:14:44,526 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-26 00:14:44,531 INFO L80 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 3/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2020-10-26 00:14:44,535 INFO L116 LiptonReduction]: Number of co-enabled transitions 2726 [2020-10-26 00:14:45,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:14:45,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:45,470 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:45,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:45,473 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:14:45,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:45,546 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:14:45,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:45,548 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:14:45,549 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:45,554 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:14:45,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:14:45,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:14:45,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:14:45,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:14:45,605 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:45,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:14:45,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:45,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:14:45,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:14:45,614 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:14:45,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:14:46,207 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-10-26 00:14:46,267 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:14:46,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:46,272 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:46,272 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:46,277 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:14:46,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:46,415 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:14:46,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:46,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:14:46,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:46,428 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:14:46,429 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:14:46,432 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:14:46,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:14:46,453 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:14:46,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:46,455 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:14:46,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:46,458 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:14:46,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:14:46,461 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:14:46,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:14:47,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:47,633 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:47,635 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:47,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:47,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:47,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:47,684 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:47,686 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:47,688 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:47,688 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:47,690 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:47,691 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:47,692 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:47,693 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:47,697 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:47,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:47,713 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:47,714 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-26 00:14:47,718 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:47,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-26 00:14:47,722 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:47,723 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-26 00:14:47,738 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:14:47,739 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:47,743 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:47,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:47,746 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:47,747 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:47,897 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:14:47,898 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:47,899 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:47,900 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:47,902 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:47,902 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:47,922 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:47,922 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:47,924 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:47,925 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:47,928 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:47,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:47,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:47,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:47,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:47,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:47,963 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:47,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-26 00:14:47,968 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:47,973 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-26 00:14:47,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:47,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-26 00:14:47,984 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:14:47,985 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:47,989 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:47,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:47,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:47,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:48,913 WARN L193 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-26 00:14:49,095 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-26 00:14:49,117 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-26 00:14:49,117 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:49,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:14:49,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:49,387 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:49,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:49,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:49,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:49,407 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:49,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:49,409 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:49,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:49,411 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:49,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:49,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:49,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-26 00:14:49,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:49,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-26 00:14:49,423 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:49,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-26 00:14:49,425 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:14:49,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:49,429 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:49,429 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:49,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:49,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:49,534 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:49,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:49,535 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:49,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:49,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:49,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:49,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:49,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:49,562 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:49,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:49,563 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:49,563 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:49,566 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:49,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-26 00:14:49,569 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:49,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-26 00:14:49,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:49,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-26 00:14:49,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:14:49,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:49,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:49,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:49,579 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:49,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:49,739 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:14:49,739 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:49,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:14:49,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:49,742 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:14:49,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:49,744 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:14:49,744 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:49,779 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:14:49,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:49,780 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:14:49,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:49,782 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:14:49,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:14:49,784 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:14:49,784 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:14:50,215 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:50,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-26 00:14:50,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:14:50,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:50,257 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:14:50,258 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:50,279 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:14:50,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:14:50,281 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:50,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:14:50,284 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:14:50,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:14:50,288 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:14:50,289 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:50,291 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:50,292 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:50,295 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:50,295 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:50,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:50,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-26 00:14:50,374 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:14:50,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:50,427 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:14:50,428 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:50,432 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:14:50,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:14:50,434 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:50,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:14:50,436 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:14:50,437 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:14:50,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:14:50,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:50,442 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:50,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:50,444 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:50,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:50,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:14:50,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:50,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:14:50,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:50,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:14:50,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:14:50,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:14:50,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:14:50,545 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:14:50,546 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:50,547 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:14:50,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:50,549 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:14:50,549 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:50,551 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:14:50,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:50,984 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:14:50,985 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:50,988 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:14:50,988 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:14:50,990 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:50,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:14:50,992 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:14:50,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:14:50,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:14:50,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:50,999 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:51,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:51,002 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:51,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:51,047 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:51,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-26 00:14:51,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:14:51,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:51,194 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:14:51,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:51,195 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:14:51,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:51,197 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:14:51,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:51,199 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:14:51,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:51,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:14:51,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:51,236 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:14:51,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:51,238 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:14:51,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:14:51,241 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:14:51,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:14:51,521 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2020-10-26 00:14:51,648 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:51,649 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-26 00:14:51,651 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:14:51,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:51,681 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:14:51,682 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:51,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:14:51,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:14:51,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:51,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:14:51,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:14:51,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:14:51,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:14:51,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:51,704 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:51,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:51,706 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:14:51,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:51,879 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 25 [2020-10-26 00:14:51,927 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:14:51,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:51,928 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:14:51,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:51,931 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:14:51,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:14:51,933 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:14:51,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:14:51,948 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:14:51,949 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:51,949 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:14:51,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:14:51,951 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:14:51,952 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:51,953 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:14:51,954 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:14:52,358 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-10-26 00:14:52,711 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-10-26 00:14:52,944 WARN L193 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-10-26 00:14:53,135 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2020-10-26 00:14:54,223 WARN L193 SmtUtils]: Spent 946.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-10-26 00:14:54,675 WARN L193 SmtUtils]: Spent 449.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-10-26 00:14:54,838 INFO L131 LiptonReduction]: Checked pairs total: 7457 [2020-10-26 00:14:54,838 INFO L133 LiptonReduction]: Total number of compositions: 104 [2020-10-26 00:14:54,848 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 32 transitions, 84 flow [2020-10-26 00:14:55,145 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3002 states. [2020-10-26 00:14:55,148 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states. [2020-10-26 00:14:55,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-26 00:14:55,160 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:14:55,161 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:14:55,162 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:14:55,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:14:55,174 INFO L82 PathProgramCache]: Analyzing trace with hash 864262698, now seen corresponding path program 1 times [2020-10-26 00:14:55,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:14:55,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901126839] [2020-10-26 00:14:55,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:14:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:14:55,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:14:55,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901126839] [2020-10-26 00:14:55,537 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:14:55,537 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-26 00:14:55,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064389810] [2020-10-26 00:14:55,542 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-26 00:14:55,543 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:14:55,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 00:14:55,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 00:14:55,561 INFO L87 Difference]: Start difference. First operand 3002 states. Second operand 3 states. [2020-10-26 00:14:55,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:14:55,766 INFO L93 Difference]: Finished difference Result 2602 states and 10064 transitions. [2020-10-26 00:14:55,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 00:14:55,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-26 00:14:55,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:14:55,832 INFO L225 Difference]: With dead ends: 2602 [2020-10-26 00:14:55,832 INFO L226 Difference]: Without dead ends: 2122 [2020-10-26 00:14:55,834 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 00:14:55,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2020-10-26 00:14:56,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2122. [2020-10-26 00:14:56,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2122 states. [2020-10-26 00:14:56,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 8080 transitions. [2020-10-26 00:14:56,084 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 8080 transitions. Word has length 9 [2020-10-26 00:14:56,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:14:56,085 INFO L481 AbstractCegarLoop]: Abstraction has 2122 states and 8080 transitions. [2020-10-26 00:14:56,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-26 00:14:56,085 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 8080 transitions. [2020-10-26 00:14:56,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-26 00:14:56,092 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:14:56,093 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:14:56,093 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-26 00:14:56,093 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:14:56,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:14:56,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1627847038, now seen corresponding path program 1 times [2020-10-26 00:14:56,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:14:56,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660685318] [2020-10-26 00:14:56,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:14:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:14:56,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:14:56,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660685318] [2020-10-26 00:14:56,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:14:56,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-26 00:14:56,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867107237] [2020-10-26 00:14:56,291 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-26 00:14:56,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:14:56,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 00:14:56,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 00:14:56,292 INFO L87 Difference]: Start difference. First operand 2122 states and 8080 transitions. Second operand 3 states. [2020-10-26 00:14:56,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:14:56,408 INFO L93 Difference]: Finished difference Result 1930 states and 7248 transitions. [2020-10-26 00:14:56,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 00:14:56,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-26 00:14:56,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:14:56,440 INFO L225 Difference]: With dead ends: 1930 [2020-10-26 00:14:56,440 INFO L226 Difference]: Without dead ends: 1930 [2020-10-26 00:14:56,441 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 00:14:56,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2020-10-26 00:14:56,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1930. [2020-10-26 00:14:56,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1930 states. [2020-10-26 00:14:56,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 7248 transitions. [2020-10-26 00:14:56,591 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 7248 transitions. Word has length 11 [2020-10-26 00:14:56,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:14:56,592 INFO L481 AbstractCegarLoop]: Abstraction has 1930 states and 7248 transitions. [2020-10-26 00:14:56,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-26 00:14:56,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 7248 transitions. [2020-10-26 00:14:56,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-26 00:14:56,603 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:14:56,603 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:14:56,603 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-26 00:14:56,603 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:14:56,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:14:56,615 INFO L82 PathProgramCache]: Analyzing trace with hash 944553840, now seen corresponding path program 1 times [2020-10-26 00:14:56,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:14:56,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813676473] [2020-10-26 00:14:56,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:14:56,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:14:56,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:14:56,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813676473] [2020-10-26 00:14:56,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:14:56,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-26 00:14:56,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522925708] [2020-10-26 00:14:56,743 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-26 00:14:56,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:14:56,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 00:14:56,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 00:14:56,745 INFO L87 Difference]: Start difference. First operand 1930 states and 7248 transitions. Second operand 3 states. [2020-10-26 00:14:56,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:14:56,810 INFO L93 Difference]: Finished difference Result 1834 states and 6848 transitions. [2020-10-26 00:14:56,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 00:14:56,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-26 00:14:56,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:14:56,835 INFO L225 Difference]: With dead ends: 1834 [2020-10-26 00:14:56,835 INFO L226 Difference]: Without dead ends: 1834 [2020-10-26 00:14:56,835 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 00:14:56,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1834 states. [2020-10-26 00:14:56,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1834 to 1834. [2020-10-26 00:14:56,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1834 states. [2020-10-26 00:14:56,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 6848 transitions. [2020-10-26 00:14:56,947 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 6848 transitions. Word has length 13 [2020-10-26 00:14:56,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:14:56,947 INFO L481 AbstractCegarLoop]: Abstraction has 1834 states and 6848 transitions. [2020-10-26 00:14:56,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-26 00:14:56,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 6848 transitions. [2020-10-26 00:14:56,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-26 00:14:56,953 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:14:56,953 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:14:56,953 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-26 00:14:56,953 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:14:56,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:14:56,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1606092448, now seen corresponding path program 1 times [2020-10-26 00:14:56,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:14:56,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143361665] [2020-10-26 00:14:56,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:14:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:14:57,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-10-26 00:14:57,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143361665] [2020-10-26 00:14:57,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:14:57,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-26 00:14:57,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665316798] [2020-10-26 00:14:57,065 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-26 00:14:57,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:14:57,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 00:14:57,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 00:14:57,066 INFO L87 Difference]: Start difference. First operand 1834 states and 6848 transitions. Second operand 3 states. [2020-10-26 00:14:57,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:14:57,115 INFO L93 Difference]: Finished difference Result 2470 states and 8910 transitions. [2020-10-26 00:14:57,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 00:14:57,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-10-26 00:14:57,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:14:57,135 INFO L225 Difference]: With dead ends: 2470 [2020-10-26 00:14:57,135 INFO L226 Difference]: Without dead ends: 1858 [2020-10-26 00:14:57,135 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 00:14:57,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2020-10-26 00:14:57,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1786. [2020-10-26 00:14:57,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1786 states. [2020-10-26 00:14:57,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 6342 transitions. [2020-10-26 00:14:57,276 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 6342 transitions. Word has length 15 [2020-10-26 00:14:57,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:14:57,276 INFO L481 AbstractCegarLoop]: Abstraction has 1786 states and 6342 transitions. [2020-10-26 00:14:57,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-26 00:14:57,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 6342 transitions. [2020-10-26 00:14:57,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-26 00:14:57,282 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:14:57,283 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:14:57,283 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-26 00:14:57,283 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:14:57,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:14:57,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1993091661, now seen corresponding path program 1 times [2020-10-26 00:14:57,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:14:57,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556752618] [2020-10-26 00:14:57,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:14:57,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:14:57,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:14:57,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556752618] [2020-10-26 00:14:57,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:14:57,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 00:14:57,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357623644] [2020-10-26 00:14:57,462 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 00:14:57,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:14:57,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 00:14:57,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 00:14:57,463 INFO L87 Difference]: Start difference. First operand 1786 states and 6342 transitions. Second operand 4 states. [2020-10-26 00:14:57,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:14:57,555 INFO L93 Difference]: Finished difference Result 1870 states and 6036 transitions. [2020-10-26 00:14:57,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 00:14:57,556 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-26 00:14:57,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:14:57,568 INFO L225 Difference]: With dead ends: 1870 [2020-10-26 00:14:57,569 INFO L226 Difference]: Without dead ends: 1390 [2020-10-26 00:14:57,570 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 00:14:57,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-10-26 00:14:57,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1390. [2020-10-26 00:14:57,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1390 states. [2020-10-26 00:14:57,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 4442 transitions. [2020-10-26 00:14:57,626 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 4442 transitions. Word has length 16 [2020-10-26 00:14:57,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:14:57,627 INFO L481 AbstractCegarLoop]: Abstraction has 1390 states and 4442 transitions. [2020-10-26 00:14:57,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 00:14:57,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 4442 transitions. [2020-10-26 00:14:57,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-26 00:14:57,631 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:14:57,631 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:14:57,632 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-26 00:14:57,632 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:14:57,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:14:57,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1393563594, now seen corresponding path program 1 times [2020-10-26 00:14:57,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:14:57,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022226920] [2020-10-26 00:14:57,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:14:57,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:14:57,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:14:57,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022226920] [2020-10-26 00:14:57,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:14:57,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 00:14:57,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62177889] [2020-10-26 00:14:57,757 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-26 00:14:57,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:14:57,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 00:14:57,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-26 00:14:57,758 INFO L87 Difference]: Start difference. First operand 1390 states and 4442 transitions. Second operand 5 states. [2020-10-26 00:14:57,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:14:57,861 INFO L93 Difference]: Finished difference Result 1228 states and 3605 transitions. [2020-10-26 00:14:57,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 00:14:57,862 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-10-26 00:14:57,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:14:57,869 INFO L225 Difference]: With dead ends: 1228 [2020-10-26 00:14:57,870 INFO L226 Difference]: Without dead ends: 928 [2020-10-26 00:14:57,870 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-26 00:14:57,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2020-10-26 00:14:57,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 928. [2020-10-26 00:14:57,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 928 states. [2020-10-26 00:14:57,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 2670 transitions. [2020-10-26 00:14:57,905 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 2670 transitions. Word has length 18 [2020-10-26 00:14:57,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:14:57,906 INFO L481 AbstractCegarLoop]: Abstraction has 928 states and 2670 transitions. [2020-10-26 00:14:57,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-26 00:14:57,906 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 2670 transitions. [2020-10-26 00:14:57,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-26 00:14:57,909 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:14:57,909 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:14:57,909 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-26 00:14:57,910 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:14:57,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:14:57,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1102012972, now seen corresponding path program 1 times [2020-10-26 00:14:57,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:14:57,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152835491] [2020-10-26 00:14:57,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:14:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:14:58,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:14:58,167 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152835491] [2020-10-26 00:14:58,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:14:58,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 00:14:58,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706779743] [2020-10-26 00:14:58,168 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-26 00:14:58,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:14:58,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 00:14:58,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-26 00:14:58,171 INFO L87 Difference]: Start difference. First operand 928 states and 2670 transitions. Second operand 6 states. [2020-10-26 00:14:58,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:14:58,276 INFO L93 Difference]: Finished difference Result 824 states and 2335 transitions. [2020-10-26 00:14:58,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 00:14:58,277 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-26 00:14:58,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:14:58,296 INFO L225 Difference]: With dead ends: 824 [2020-10-26 00:14:58,296 INFO L226 Difference]: Without dead ends: 725 [2020-10-26 00:14:58,297 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-26 00:14:58,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2020-10-26 00:14:58,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 725. [2020-10-26 00:14:58,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2020-10-26 00:14:58,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 2083 transitions. [2020-10-26 00:14:58,318 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 2083 transitions. Word has length 20 [2020-10-26 00:14:58,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:14:58,319 INFO L481 AbstractCegarLoop]: Abstraction has 725 states and 2083 transitions. [2020-10-26 00:14:58,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-26 00:14:58,319 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 2083 transitions. [2020-10-26 00:14:58,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-26 00:14:58,322 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:14:58,322 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-10-26 00:14:58,322 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-26 00:14:58,322 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:14:58,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:14:58,323 INFO L82 PathProgramCache]: Analyzing trace with hash -556866096, now seen corresponding path program 1 times [2020-10-26 00:14:58,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:14:58,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892220098] [2020-10-26 00:14:58,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:14:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:14:58,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:14:58,494 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892220098] [2020-10-26 00:14:58,494 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:14:58,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-26 00:14:58,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140077456] [2020-10-26 00:14:58,495 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 00:14:58,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:14:58,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 00:14:58,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-26 00:14:58,496 INFO L87 Difference]: Start difference. First operand 725 states and 2083 transitions. Second operand 7 states. [2020-10-26 00:14:58,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:14:58,634 INFO L93 Difference]: Finished difference Result 701 states and 2034 transitions. [2020-10-26 00:14:58,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-26 00:14:58,635 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-26 00:14:58,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:14:58,638 INFO L225 Difference]: With dead ends: 701 [2020-10-26 00:14:58,639 INFO L226 Difference]: Without dead ends: 433 [2020-10-26 00:14:58,639 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-10-26 00:14:58,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2020-10-26 00:14:58,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2020-10-26 00:14:58,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2020-10-26 00:14:58,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 1213 transitions. [2020-10-26 00:14:58,654 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 1213 transitions. Word has length 23 [2020-10-26 00:14:58,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:14:58,654 INFO L481 AbstractCegarLoop]: Abstraction has 433 states and 1213 transitions. [2020-10-26 00:14:58,654 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 00:14:58,654 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 1213 transitions. [2020-10-26 00:14:58,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-26 00:14:58,656 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:14:58,657 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-10-26 00:14:58,657 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-26 00:14:58,657 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:14:58,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:14:58,658 INFO L82 PathProgramCache]: Analyzing trace with hash 529821591, now seen corresponding path program 1 times [2020-10-26 00:14:58,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:14:58,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527853932] [2020-10-26 00:14:58,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:14:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:14:58,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:14:58,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527853932] [2020-10-26 00:14:58,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:14:58,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 00:14:58,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179294541] [2020-10-26 00:14:58,745 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 00:14:58,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:14:58,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 00:14:58,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 00:14:58,746 INFO L87 Difference]: Start difference. First operand 433 states and 1213 transitions. Second operand 4 states. [2020-10-26 00:14:58,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:14:58,775 INFO L93 Difference]: Finished difference Result 570 states and 1578 transitions. [2020-10-26 00:14:58,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 00:14:58,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-10-26 00:14:58,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:14:58,778 INFO L225 Difference]: With dead ends: 570 [2020-10-26 00:14:58,778 INFO L226 Difference]: Without dead ends: 184 [2020-10-26 00:14:58,779 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 00:14:58,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2020-10-26 00:14:58,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2020-10-26 00:14:58,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-10-26 00:14:58,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 454 transitions. [2020-10-26 00:14:58,785 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 454 transitions. Word has length 26 [2020-10-26 00:14:58,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:14:58,785 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 454 transitions. [2020-10-26 00:14:58,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 00:14:58,785 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 454 transitions. [2020-10-26 00:14:58,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-26 00:14:58,786 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:14:58,787 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-10-26 00:14:58,787 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-26 00:14:58,787 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:14:58,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:14:58,788 INFO L82 PathProgramCache]: Analyzing trace with hash -109835625, now seen corresponding path program 2 times [2020-10-26 00:14:58,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:14:58,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121805232] [2020-10-26 00:14:58,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:14:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:14:59,274 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 31 [2020-10-26 00:14:59,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:14:59,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121805232] [2020-10-26 00:14:59,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:14:59,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 00:14:59,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829625137] [2020-10-26 00:14:59,403 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 00:14:59,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:14:59,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 00:14:59,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-26 00:14:59,404 INFO L87 Difference]: Start difference. First operand 184 states and 454 transitions. Second operand 7 states. [2020-10-26 00:14:59,783 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 23 [2020-10-26 00:14:59,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:14:59,909 INFO L93 Difference]: Finished difference Result 291 states and 694 transitions. [2020-10-26 00:14:59,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-26 00:14:59,910 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-10-26 00:14:59,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:14:59,912 INFO L225 Difference]: With dead ends: 291 [2020-10-26 00:14:59,912 INFO L226 Difference]: Without dead ends: 189 [2020-10-26 00:14:59,912 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-10-26 00:14:59,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-10-26 00:14:59,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 124. [2020-10-26 00:14:59,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-10-26 00:14:59,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 262 transitions. [2020-10-26 00:14:59,918 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 262 transitions. Word has length 26 [2020-10-26 00:14:59,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:14:59,919 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 262 transitions. [2020-10-26 00:14:59,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 00:14:59,919 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 262 transitions. [2020-10-26 00:14:59,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-26 00:14:59,921 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:14:59,921 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-10-26 00:14:59,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-26 00:14:59,922 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:14:59,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:14:59,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1724378857, now seen corresponding path program 3 times [2020-10-26 00:14:59,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:14:59,923 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236021910] [2020-10-26 00:14:59,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:15:00,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 00:15:00,056 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 00:15:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 00:15:00,176 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 00:15:00,245 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 00:15:00,245 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-26 00:15:00,246 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-26 00:15:00,247 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-26 00:15:00,277 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1253] [1253] L2-->L885: Formula: (let ((.cse7 (= (mod ~z$w_buff0_used~0_In-187151513 256) 0)) (.cse6 (= (mod ~z$r_buff0_thd0~0_In-187151513 256) 0)) (.cse8 (= (mod ~z$r_buff1_thd0~0_In-187151513 256) 0)) (.cse9 (= (mod ~z$w_buff1_used~0_In-187151513 256) 0))) (let ((.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse2 (or .cse8 .cse9)) (.cse3 (or .cse7 .cse6)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (or (and .cse0 (= 0 ~z$w_buff1_used~0_Out-187151513) .cse1) (and .cse2 (= ~z$w_buff1_used~0_In-187151513 ~z$w_buff1_used~0_Out-187151513))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-187151513 0)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-187151513 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-187151513|) (or (and (or (and (= ~z$w_buff1~0_In-187151513 ~z~0_Out-187151513) .cse0 .cse1) (and .cse2 (= ~z~0_In-187151513 ~z~0_Out-187151513))) .cse3) (and (= ~z~0_Out-187151513 ~z$w_buff0~0_In-187151513) .cse4 .cse5)) (= ~z$r_buff0_thd0~0_In-187151513 ~z$r_buff0_thd0~0_Out-187151513) (or (and (= ~z$w_buff0_used~0_In-187151513 ~z$w_buff0_used~0_Out-187151513) .cse3) (and (= ~z$w_buff0_used~0_Out-187151513 0) .cse4 .cse5)) (= ~z$r_buff1_thd0~0_Out-187151513 ~z$r_buff1_thd0~0_In-187151513)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-187151513|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-187151513, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-187151513, ~z$w_buff0~0=~z$w_buff0~0_In-187151513, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-187151513, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-187151513, ~z$w_buff1~0=~z$w_buff1~0_In-187151513, ~z~0=~z~0_In-187151513} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-187151513, ~z$w_buff0~0=~z$w_buff0~0_In-187151513, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-187151513, ~z$w_buff1~0=~z$w_buff1~0_In-187151513, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out-187151513|, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-187151513|, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out-187151513|, ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-187151513|, ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-187151513|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-187151513|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-187151513, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-187151513|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-187151513, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-187151513, ~z~0=~z~0_Out-187151513} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite63, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2020-10-26 00:15:00,290 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,291 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [812] [2020-10-26 00:15:00,291 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,291 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,292 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,292 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,292 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,292 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,293 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,293 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,293 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,293 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,294 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,295 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,295 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,295 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,295 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,295 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,296 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,296 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,296 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,296 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,299 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,299 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,304 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,305 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,305 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,305 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,306 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,306 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,306 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,306 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,307 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,307 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,307 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,308 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,308 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,308 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,308 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,308 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,308 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,309 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,309 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,309 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,309 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,310 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,310 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,310 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,310 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,310 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,310 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,311 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,311 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,311 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 12:15:00 BasicIcfg [2020-10-26 00:15:00,404 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-26 00:15:00,405 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 00:15:00,405 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 00:15:00,405 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 00:15:00,406 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 12:14:44" (3/4) ... [2020-10-26 00:15:00,408 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-26 00:15:00,429 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1253] [1253] L2-->L885: Formula: (let ((.cse7 (= (mod ~z$w_buff0_used~0_In-187151513 256) 0)) (.cse6 (= (mod ~z$r_buff0_thd0~0_In-187151513 256) 0)) (.cse8 (= (mod ~z$r_buff1_thd0~0_In-187151513 256) 0)) (.cse9 (= (mod ~z$w_buff1_used~0_In-187151513 256) 0))) (let ((.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse2 (or .cse8 .cse9)) (.cse3 (or .cse7 .cse6)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (or (and .cse0 (= 0 ~z$w_buff1_used~0_Out-187151513) .cse1) (and .cse2 (= ~z$w_buff1_used~0_In-187151513 ~z$w_buff1_used~0_Out-187151513))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-187151513 0)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-187151513 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-187151513|) (or (and (or (and (= ~z$w_buff1~0_In-187151513 ~z~0_Out-187151513) .cse0 .cse1) (and .cse2 (= ~z~0_In-187151513 ~z~0_Out-187151513))) .cse3) (and (= ~z~0_Out-187151513 ~z$w_buff0~0_In-187151513) .cse4 .cse5)) (= ~z$r_buff0_thd0~0_In-187151513 ~z$r_buff0_thd0~0_Out-187151513) (or (and (= ~z$w_buff0_used~0_In-187151513 ~z$w_buff0_used~0_Out-187151513) .cse3) (and (= ~z$w_buff0_used~0_Out-187151513 0) .cse4 .cse5)) (= ~z$r_buff1_thd0~0_Out-187151513 ~z$r_buff1_thd0~0_In-187151513)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-187151513|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-187151513, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-187151513, ~z$w_buff0~0=~z$w_buff0~0_In-187151513, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-187151513, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-187151513, ~z$w_buff1~0=~z$w_buff1~0_In-187151513, ~z~0=~z~0_In-187151513} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-187151513, ~z$w_buff0~0=~z$w_buff0~0_In-187151513, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-187151513, ~z$w_buff1~0=~z$w_buff1~0_In-187151513, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out-187151513|, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-187151513|, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out-187151513|, ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-187151513|, ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-187151513|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-187151513|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-187151513, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-187151513|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-187151513, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-187151513, ~z~0=~z~0_Out-187151513} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite63, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2020-10-26 00:15:00,431 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,431 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [812] [2020-10-26 00:15:00,431 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,432 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,432 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,432 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,432 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,432 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,432 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,433 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,433 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,433 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,433 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,433 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,433 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,434 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,434 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,434 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,434 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,434 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,434 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,435 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,435 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,435 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,436 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,436 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,436 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,436 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,436 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,437 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,437 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,437 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,437 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,437 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,437 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,437 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,438 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,438 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,438 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,438 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,438 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,438 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,439 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,439 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,439 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,439 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,439 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,440 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,440 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,440 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,440 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,440 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,440 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:00,441 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:00,622 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-26 00:15:00,622 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 00:15:00,624 INFO L168 Benchmark]: Toolchain (without parser) took 21690.49 ms. Allocated memory was 46.1 MB in the beginning and 234.9 MB in the end (delta: 188.7 MB). Free memory was 21.6 MB in the beginning and 55.8 MB in the end (delta: -34.3 MB). Peak memory consumption was 155.2 MB. Max. memory is 16.1 GB. [2020-10-26 00:15:00,627 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 46.1 MB. Free memory was 30.5 MB in the beginning and 30.5 MB in the end (delta: 32.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 00:15:00,627 INFO L168 Benchmark]: CACSL2BoogieTranslator took 969.88 ms. Allocated memory was 46.1 MB in the beginning and 60.8 MB in the end (delta: 14.7 MB). Free memory was 20.9 MB in the beginning and 28.4 MB in the end (delta: -7.5 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.1 GB. [2020-10-26 00:15:00,628 INFO L168 Benchmark]: Boogie Procedure Inliner took 142.41 ms. Allocated memory is still 60.8 MB. Free memory was 28.4 MB in the beginning and 39.8 MB in the end (delta: -11.4 MB). Peak memory consumption was 2.5 MB. Max. memory is 16.1 GB. [2020-10-26 00:15:00,628 INFO L168 Benchmark]: Boogie Preprocessor took 94.32 ms. Allocated memory is still 60.8 MB. Free memory was 39.5 MB in the beginning and 37.2 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 00:15:00,628 INFO L168 Benchmark]: RCFGBuilder took 4088.22 ms. Allocated memory was 60.8 MB in the beginning and 104.9 MB in the end (delta: 44.0 MB). Free memory was 36.9 MB in the beginning and 36.0 MB in the end (delta: 975.2 kB). Peak memory consumption was 44.2 MB. Max. memory is 16.1 GB. [2020-10-26 00:15:00,629 INFO L168 Benchmark]: TraceAbstraction took 16163.26 ms. Allocated memory was 104.9 MB in the beginning and 234.9 MB in the end (delta: 130.0 MB). Free memory was 35.7 MB in the beginning and 82.1 MB in the end (delta: -46.4 MB). Peak memory consumption was 84.7 MB. Max. memory is 16.1 GB. [2020-10-26 00:15:00,629 INFO L168 Benchmark]: Witness Printer took 217.61 ms. Allocated memory is still 234.9 MB. Free memory was 82.1 MB in the beginning and 55.8 MB in the end (delta: 26.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. [2020-10-26 00:15:00,632 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 46.1 MB. Free memory was 30.5 MB in the beginning and 30.5 MB in the end (delta: 32.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 969.88 ms. Allocated memory was 46.1 MB in the beginning and 60.8 MB in the end (delta: 14.7 MB). Free memory was 20.9 MB in the beginning and 28.4 MB in the end (delta: -7.5 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 142.41 ms. Allocated memory is still 60.8 MB. Free memory was 28.4 MB in the beginning and 39.8 MB in the end (delta: -11.4 MB). Peak memory consumption was 2.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 94.32 ms. Allocated memory is still 60.8 MB. Free memory was 39.5 MB in the beginning and 37.2 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 4088.22 ms. Allocated memory was 60.8 MB in the beginning and 104.9 MB in the end (delta: 44.0 MB). Free memory was 36.9 MB in the beginning and 36.0 MB in the end (delta: 975.2 kB). Peak memory consumption was 44.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 16163.26 ms. Allocated memory was 104.9 MB in the beginning and 234.9 MB in the end (delta: 130.0 MB). Free memory was 35.7 MB in the beginning and 82.1 MB in the end (delta: -46.4 MB). Peak memory consumption was 84.7 MB. Max. memory is 16.1 GB. * Witness Printer took 217.61 ms. Allocated memory is still 234.9 MB. Free memory was 82.1 MB in the beginning and 55.8 MB in the end (delta: 26.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1793 VarBasedMoverChecksPositive, 83 VarBasedMoverChecksNegative, 15 SemBasedMoverChecksPositive, 68 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.4s, 211 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.3s, 130 PlacesBefore, 45 PlacesAfterwards, 120 TransitionsBefore, 32 TransitionsAfterwards, 2726 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 3 ChoiceCompositions, 104 TotalNumberOfCompositions, 7457 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p2_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L867] 0 pthread_t t237; [L868] FCALL, FORK 0 pthread_create(&t237, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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] [L869] 0 pthread_t t238; [L870] FCALL, FORK 0 pthread_create(&t238, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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] [L871] 0 pthread_t t239; [L872] FCALL, FORK 0 pthread_create(&t239, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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] [L873] 0 pthread_t t240; [L874] FCALL, FORK 0 pthread_create(&t240, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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] [L813] 4 z$w_buff1 = z$w_buff0 [L814] 4 z$w_buff0 = 1 [L815] 4 z$w_buff1_used = z$w_buff0_used [L816] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L818] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L819] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L820] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L821] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L822] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L823] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 z$flush_delayed = weak$$choice2 [L829] 4 z$mem_tmp = z [L830] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L830] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L831] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L831] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0) [L831] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L831] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L832] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L832] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1) [L832] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L832] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L833] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L833] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L834] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L835] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L836] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 __unbuffered_p3_EAX = z [L838] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L838] 4 z = z$flush_delayed ? z$mem_tmp : z [L839] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L842] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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=53, weak$$choice2=255, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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=53, weak$$choice2=255, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L767] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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=53, weak$$choice2=255, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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=53, weak$$choice2=255, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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=53, weak$$choice2=255, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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=53, weak$$choice2=255, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L789] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L790] 3 z$flush_delayed = weak$$choice2 [L791] 3 z$mem_tmp = z [L792] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L792] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L793] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L793] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L793] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L793] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L794] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L794] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L795] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L795] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L796] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L797] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L797] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L797] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L798] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 __unbuffered_p2_EBX = z [L800] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L800] 3 z = z$flush_delayed ? z$mem_tmp : z [L801] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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=52, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L845] 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) [L845] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L845] 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) [L845] 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) [L846] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L846] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L847] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L847] 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 [L848] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L848] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L849] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L849] 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 [L852] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L854] 4 return 0; [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 3 return 0; [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L876] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L887] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix008_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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=52, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 118 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.8s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.6s, HoareTripleCheckerStatistics: 317 SDtfs, 398 SDslu, 563 SDs, 0 SdLazy, 195 SolverSat, 59 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3002occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 10 MinimizatonAttempts, 137 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 203 NumberOfCodeBlocks, 203 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 167 ConstructedInterpolants, 0 QuantifiedInterpolants, 18976 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...