./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 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/mix051_tso.oepc.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 798582ee4a09ede0f5c496225fe921dfd53b0dfd5ded797f7106b8b9ef24e798 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 02:49:29,264 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 02:49:29,266 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 02:49:29,288 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 02:49:29,289 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 02:49:29,292 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 02:49:29,294 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 02:49:29,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 02:49:29,298 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 02:49:29,302 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 02:49:29,302 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 02:49:29,303 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 02:49:29,304 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 02:49:29,305 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 02:49:29,307 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 02:49:29,308 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 02:49:29,309 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 02:49:29,310 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 02:49:29,313 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 02:49:29,315 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 02:49:29,317 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 02:49:29,318 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 02:49:29,319 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 02:49:29,320 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 02:49:29,325 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 02:49:29,326 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 02:49:29,326 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 02:49:29,327 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 02:49:29,328 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 02:49:29,329 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 02:49:29,329 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 02:49:29,329 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 02:49:29,331 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 02:49:29,331 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 02:49:29,332 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 02:49:29,332 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 02:49:29,333 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 02:49:29,333 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 02:49:29,333 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 02:49:29,334 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 02:49:29,334 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 02:49:29,336 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-16 02:49:29,363 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 02:49:29,364 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 02:49:29,364 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 02:49:29,364 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 02:49:29,365 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 02:49:29,365 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 02:49:29,366 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 02:49:29,366 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 02:49:29,366 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 02:49:29,367 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 02:49:29,367 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 02:49:29,367 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 02:49:29,368 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 02:49:29,368 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 02:49:29,368 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-16 02:49:29,368 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 02:49:29,368 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-16 02:49:29,368 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 02:49:29,368 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 02:49:29,369 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 02:49:29,369 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-16 02:49:29,369 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 02:49:29,369 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 02:49:29,369 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 02:49:29,369 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 02:49:29,370 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 02:49:29,370 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 02:49:29,370 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-16 02:49:29,370 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 02:49:29,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 02:49:29,370 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-16 02:49:29,371 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-16 02:49:29,371 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-16 02:49:29,371 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 02:49:29,371 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 -> 798582ee4a09ede0f5c496225fe921dfd53b0dfd5ded797f7106b8b9ef24e798 [2021-12-16 02:49:29,576 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 02:49:29,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 02:49:29,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 02:49:29,601 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 02:49:29,601 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 02:49:29,602 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i [2021-12-16 02:49:29,649 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/539992c26/0c63d88572a84612afcbbab7d8f05cb1/FLAGd94f9b257 [2021-12-16 02:49:30,105 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 02:49:30,107 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i [2021-12-16 02:49:30,132 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/539992c26/0c63d88572a84612afcbbab7d8f05cb1/FLAGd94f9b257 [2021-12-16 02:49:30,624 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/539992c26/0c63d88572a84612afcbbab7d8f05cb1 [2021-12-16 02:49:30,626 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 02:49:30,627 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 02:49:30,629 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 02:49:30,630 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 02:49:30,632 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 02:49:30,632 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 02:49:30" (1/1) ... [2021-12-16 02:49:30,633 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@770c7ffc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:49:30, skipping insertion in model container [2021-12-16 02:49:30,633 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 02:49:30" (1/1) ... [2021-12-16 02:49:30,639 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 02:49:30,676 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 02:49:30,817 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i[949,962] [2021-12-16 02:49:31,007 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 02:49:31,025 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 02:49:31,033 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i[949,962] [2021-12-16 02:49:31,083 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 02:49:31,116 INFO L208 MainTranslator]: Completed translation [2021-12-16 02:49:31,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:49:31 WrapperNode [2021-12-16 02:49:31,117 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 02:49:31,118 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 02:49:31,118 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 02:49:31,118 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 02:49:31,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:49:31" (1/1) ... [2021-12-16 02:49:31,152 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:49:31" (1/1) ... [2021-12-16 02:49:31,196 INFO L137 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 291 [2021-12-16 02:49:31,197 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 02:49:31,197 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 02:49:31,197 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 02:49:31,197 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 02:49:31,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:49:31" (1/1) ... [2021-12-16 02:49:31,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:49:31" (1/1) ... [2021-12-16 02:49:31,207 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:49:31" (1/1) ... [2021-12-16 02:49:31,214 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:49:31" (1/1) ... [2021-12-16 02:49:31,220 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:49:31" (1/1) ... [2021-12-16 02:49:31,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:49:31" (1/1) ... [2021-12-16 02:49:31,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:49:31" (1/1) ... [2021-12-16 02:49:31,241 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 02:49:31,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 02:49:31,242 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 02:49:31,242 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 02:49:31,254 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:49:31" (1/1) ... [2021-12-16 02:49:31,259 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 02:49:31,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 02:49:31,280 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-16 02:49:31,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-16 02:49:31,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-16 02:49:31,330 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-16 02:49:31,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 02:49:31,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-16 02:49:31,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 02:49:31,330 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-16 02:49:31,330 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-16 02:49:31,331 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-16 02:49:31,331 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-16 02:49:31,331 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-12-16 02:49:31,331 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-12-16 02:49:31,331 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-12-16 02:49:31,331 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-12-16 02:49:31,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 02:49:31,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-16 02:49:31,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 02:49:31,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 02:49:31,333 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-16 02:49:31,485 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 02:49:31,486 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 02:49:31,901 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 02:49:32,141 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 02:49:32,141 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-16 02:49:32,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 02:49:32 BoogieIcfgContainer [2021-12-16 02:49:32,143 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 02:49:32,144 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 02:49:32,144 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 02:49:32,147 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 02:49:32,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 02:49:30" (1/3) ... [2021-12-16 02:49:32,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b670d85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 02:49:32, skipping insertion in model container [2021-12-16 02:49:32,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:49:31" (2/3) ... [2021-12-16 02:49:32,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b670d85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 02:49:32, skipping insertion in model container [2021-12-16 02:49:32,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 02:49:32" (3/3) ... [2021-12-16 02:49:32,149 INFO L111 eAbstractionObserver]: Analyzing ICFG mix051_tso.oepc.i [2021-12-16 02:49:32,153 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-16 02:49:32,153 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 02:49:32,153 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-16 02:49:32,153 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-16 02:49:32,185 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,186 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,186 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,186 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,186 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,186 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,187 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,187 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,187 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,187 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,187 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,187 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,187 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,188 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,188 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,188 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,188 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,188 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,188 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,189 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,189 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,189 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,189 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,189 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,190 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,190 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,190 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,190 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,190 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,190 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,191 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,191 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,191 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,191 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,191 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,191 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,191 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,191 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,192 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,192 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,192 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,192 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,192 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,192 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,193 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,193 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,193 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,193 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,193 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,193 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,194 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,194 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,194 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,194 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,194 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,194 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,195 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,195 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,195 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,195 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,195 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,195 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,195 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,196 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,196 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,196 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,196 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,196 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,196 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,196 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,197 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,197 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,197 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,197 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,197 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,197 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,198 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,198 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,198 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,198 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,198 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,198 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,202 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,202 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,202 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,202 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,202 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,202 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,202 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,202 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,202 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,202 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,203 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,203 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,203 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,203 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,203 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,203 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,203 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,203 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,203 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,203 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,203 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,204 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,204 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,204 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,204 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,204 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,204 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,205 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,205 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,205 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,209 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,209 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,209 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,210 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,210 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,210 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,210 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,210 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,210 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,211 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,212 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,212 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,212 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,212 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,212 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,213 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,213 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,213 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,213 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,213 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,213 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,213 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,214 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,214 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,214 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,214 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,214 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,215 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,215 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,215 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,215 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,215 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,216 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,216 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,216 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,216 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,216 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,217 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,217 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,218 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,218 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,218 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:49:32,218 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-16 02:49:32,262 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 02:49:32,267 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-16 02:49:32,267 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-12-16 02:49:32,296 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 292 flow [2021-12-16 02:49:32,336 INFO L129 PetriNetUnfolder]: 2/132 cut-off events. [2021-12-16 02:49:32,337 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-16 02:49:32,343 INFO L84 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2021-12-16 02:49:32,344 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 136 transitions, 292 flow [2021-12-16 02:49:32,350 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 132 transitions, 276 flow [2021-12-16 02:49:32,358 INFO L129 PetriNetUnfolder]: 0/65 cut-off events. [2021-12-16 02:49:32,358 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-16 02:49:32,358 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:49:32,359 INFO L254 CegarLoopForPetriNet]: 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, 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, 1, 1, 1, 1] [2021-12-16 02:49:32,359 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:49:32,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:49:32,362 INFO L85 PathProgramCache]: Analyzing trace with hash 622711834, now seen corresponding path program 1 times [2021-12-16 02:49:32,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:49:32,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762905208] [2021-12-16 02:49:32,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:49:32,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:49:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:49:32,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:49:32,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:49:32,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762905208] [2021-12-16 02:49:32,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762905208] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:49:32,581 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:49:32,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 02:49:32,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750985578] [2021-12-16 02:49:32,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:49:32,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 02:49:32,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:49:32,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 02:49:32,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 02:49:32,613 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 136 [2021-12-16 02:49:32,616 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 132 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:32,616 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:49:32,616 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 136 [2021-12-16 02:49:32,617 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:49:32,805 INFO L129 PetriNetUnfolder]: 161/674 cut-off events. [2021-12-16 02:49:32,805 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-12-16 02:49:32,808 INFO L84 FinitePrefix]: Finished finitePrefix Result has 976 conditions, 674 events. 161/674 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3711 event pairs, 35 based on Foata normal form. 27/670 useless extension candidates. Maximal degree in co-relation 919. Up to 187 conditions per place. [2021-12-16 02:49:32,812 INFO L132 encePairwiseOnDemand]: 131/136 looper letters, 17 selfloop transitions, 2 changer transitions 0/135 dead transitions. [2021-12-16 02:49:32,812 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 135 transitions, 326 flow [2021-12-16 02:49:32,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 02:49:32,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-16 02:49:32,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2021-12-16 02:49:32,822 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9411764705882353 [2021-12-16 02:49:32,823 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2021-12-16 02:49:32,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2021-12-16 02:49:32,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:49:32,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2021-12-16 02:49:32,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:32,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:32,839 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:32,840 INFO L186 Difference]: Start difference. First operand has 143 places, 132 transitions, 276 flow. Second operand 3 states and 384 transitions. [2021-12-16 02:49:32,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 135 transitions, 326 flow [2021-12-16 02:49:32,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 135 transitions, 320 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-12-16 02:49:32,850 INFO L242 Difference]: Finished difference. Result has 139 places, 128 transitions, 268 flow [2021-12-16 02:49:32,852 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=139, PETRI_TRANSITIONS=128} [2021-12-16 02:49:32,856 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, -4 predicate places. [2021-12-16 02:49:32,861 INFO L470 AbstractCegarLoop]: Abstraction has has 139 places, 128 transitions, 268 flow [2021-12-16 02:49:32,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:32,861 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:49:32,862 INFO L254 CegarLoopForPetriNet]: 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:49:32,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 02:49:32,862 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:49:32,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:49:32,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1216340586, now seen corresponding path program 1 times [2021-12-16 02:49:32,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:49:32,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650675426] [2021-12-16 02:49:32,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:49:32,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:49:32,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:49:33,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:49:33,163 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:49:33,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650675426] [2021-12-16 02:49:33,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650675426] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:49:33,163 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:49:33,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-16 02:49:33,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258920424] [2021-12-16 02:49:33,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:49:33,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 02:49:33,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:49:33,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 02:49:33,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-12-16 02:49:33,170 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2021-12-16 02:49:33,171 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 128 transitions, 268 flow. Second operand has 11 states, 11 states have (on average 110.45454545454545) internal successors, (1215), 11 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:33,171 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:49:33,171 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2021-12-16 02:49:33,171 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:49:33,858 INFO L129 PetriNetUnfolder]: 1032/2950 cut-off events. [2021-12-16 02:49:33,858 INFO L130 PetriNetUnfolder]: For 141/141 co-relation queries the response was YES. [2021-12-16 02:49:33,867 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4687 conditions, 2950 events. 1032/2950 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 23747 event pairs, 461 based on Foata normal form. 0/2863 useless extension candidates. Maximal degree in co-relation 4627. Up to 864 conditions per place. [2021-12-16 02:49:33,876 INFO L132 encePairwiseOnDemand]: 122/136 looper letters, 26 selfloop transitions, 11 changer transitions 70/199 dead transitions. [2021-12-16 02:49:33,876 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 199 transitions, 622 flow [2021-12-16 02:49:33,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-16 02:49:33,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-16 02:49:33,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1841 transitions. [2021-12-16 02:49:33,882 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8460477941176471 [2021-12-16 02:49:33,882 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1841 transitions. [2021-12-16 02:49:33,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1841 transitions. [2021-12-16 02:49:33,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:49:33,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1841 transitions. [2021-12-16 02:49:33,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 115.0625) internal successors, (1841), 16 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:33,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 136.0) internal successors, (2312), 17 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:33,890 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 136.0) internal successors, (2312), 17 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:33,890 INFO L186 Difference]: Start difference. First operand has 139 places, 128 transitions, 268 flow. Second operand 16 states and 1841 transitions. [2021-12-16 02:49:33,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 199 transitions, 622 flow [2021-12-16 02:49:33,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 199 transitions, 604 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-16 02:49:33,896 INFO L242 Difference]: Finished difference. Result has 163 places, 120 transitions, 336 flow [2021-12-16 02:49:33,896 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=336, PETRI_PLACES=163, PETRI_TRANSITIONS=120} [2021-12-16 02:49:33,897 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 20 predicate places. [2021-12-16 02:49:33,897 INFO L470 AbstractCegarLoop]: Abstraction has has 163 places, 120 transitions, 336 flow [2021-12-16 02:49:33,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 110.45454545454545) internal successors, (1215), 11 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:33,898 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:49:33,898 INFO L254 CegarLoopForPetriNet]: 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:49:33,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 02:49:33,898 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:49:33,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:49:33,899 INFO L85 PathProgramCache]: Analyzing trace with hash -2086389198, now seen corresponding path program 1 times [2021-12-16 02:49:33,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:49:33,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175959605] [2021-12-16 02:49:33,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:49:33,899 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:49:33,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:49:34,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:49:34,144 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:49:34,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175959605] [2021-12-16 02:49:34,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175959605] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:49:34,144 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:49:34,144 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-16 02:49:34,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155340137] [2021-12-16 02:49:34,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:49:34,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 02:49:34,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:49:34,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 02:49:34,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-12-16 02:49:34,148 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 136 [2021-12-16 02:49:34,149 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 120 transitions, 336 flow. Second operand has 10 states, 10 states have (on average 111.6) internal successors, (1116), 10 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:34,149 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:49:34,149 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 136 [2021-12-16 02:49:34,149 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:49:34,742 INFO L129 PetriNetUnfolder]: 747/1697 cut-off events. [2021-12-16 02:49:34,742 INFO L130 PetriNetUnfolder]: For 4398/4434 co-relation queries the response was YES. [2021-12-16 02:49:34,749 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5762 conditions, 1697 events. 747/1697 cut-off events. For 4398/4434 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 10754 event pairs, 241 based on Foata normal form. 27/1670 useless extension candidates. Maximal degree in co-relation 5687. Up to 626 conditions per place. [2021-12-16 02:49:34,757 INFO L132 encePairwiseOnDemand]: 124/136 looper letters, 36 selfloop transitions, 10 changer transitions 46/185 dead transitions. [2021-12-16 02:49:34,757 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 185 transitions, 978 flow [2021-12-16 02:49:34,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-16 02:49:34,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-12-16 02:49:34,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1740 transitions. [2021-12-16 02:49:34,761 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8529411764705882 [2021-12-16 02:49:34,761 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1740 transitions. [2021-12-16 02:49:34,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1740 transitions. [2021-12-16 02:49:34,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:49:34,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1740 transitions. [2021-12-16 02:49:34,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 116.0) internal successors, (1740), 15 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:34,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 136.0) internal successors, (2176), 16 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:34,767 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 136.0) internal successors, (2176), 16 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:34,767 INFO L186 Difference]: Start difference. First operand has 163 places, 120 transitions, 336 flow. Second operand 15 states and 1740 transitions. [2021-12-16 02:49:34,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 185 transitions, 978 flow [2021-12-16 02:49:34,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 185 transitions, 948 flow, removed 12 selfloop flow, removed 6 redundant places. [2021-12-16 02:49:34,774 INFO L242 Difference]: Finished difference. Result has 158 places, 124 transitions, 425 flow [2021-12-16 02:49:34,774 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=425, PETRI_PLACES=158, PETRI_TRANSITIONS=124} [2021-12-16 02:49:34,775 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 15 predicate places. [2021-12-16 02:49:34,775 INFO L470 AbstractCegarLoop]: Abstraction has has 158 places, 124 transitions, 425 flow [2021-12-16 02:49:34,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 111.6) internal successors, (1116), 10 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:34,775 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:49:34,775 INFO L254 CegarLoopForPetriNet]: 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:49:34,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-16 02:49:34,776 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:49:34,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:49:34,776 INFO L85 PathProgramCache]: Analyzing trace with hash 577898102, now seen corresponding path program 1 times [2021-12-16 02:49:34,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:49:34,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505626137] [2021-12-16 02:49:34,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:49:34,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:49:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:49:35,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:49:35,076 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:49:35,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505626137] [2021-12-16 02:49:35,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505626137] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:49:35,076 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:49:35,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-16 02:49:35,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244766740] [2021-12-16 02:49:35,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:49:35,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-16 02:49:35,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:49:35,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-16 02:49:35,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-12-16 02:49:35,079 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2021-12-16 02:49:35,080 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 124 transitions, 425 flow. Second operand has 12 states, 12 states have (on average 110.5) internal successors, (1326), 12 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:35,080 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:49:35,080 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2021-12-16 02:49:35,080 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:49:35,782 INFO L129 PetriNetUnfolder]: 881/2009 cut-off events. [2021-12-16 02:49:35,782 INFO L130 PetriNetUnfolder]: For 15825/15835 co-relation queries the response was YES. [2021-12-16 02:49:35,792 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9665 conditions, 2009 events. 881/2009 cut-off events. For 15825/15835 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 13287 event pairs, 127 based on Foata normal form. 34/1989 useless extension candidates. Maximal degree in co-relation 9581. Up to 652 conditions per place. [2021-12-16 02:49:35,804 INFO L132 encePairwiseOnDemand]: 122/136 looper letters, 42 selfloop transitions, 19 changer transitions 56/209 dead transitions. [2021-12-16 02:49:35,804 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 209 transitions, 1671 flow [2021-12-16 02:49:35,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-16 02:49:35,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2021-12-16 02:49:35,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2293 transitions. [2021-12-16 02:49:35,808 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8430147058823529 [2021-12-16 02:49:35,809 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2293 transitions. [2021-12-16 02:49:35,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2293 transitions. [2021-12-16 02:49:35,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:49:35,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2293 transitions. [2021-12-16 02:49:35,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 114.65) internal successors, (2293), 20 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:35,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 136.0) internal successors, (2856), 21 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:35,817 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 136.0) internal successors, (2856), 21 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:35,817 INFO L186 Difference]: Start difference. First operand has 158 places, 124 transitions, 425 flow. Second operand 20 states and 2293 transitions. [2021-12-16 02:49:35,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 209 transitions, 1671 flow [2021-12-16 02:49:35,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 209 transitions, 1564 flow, removed 46 selfloop flow, removed 9 redundant places. [2021-12-16 02:49:35,828 INFO L242 Difference]: Finished difference. Result has 173 places, 131 transitions, 613 flow [2021-12-16 02:49:35,828 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=613, PETRI_PLACES=173, PETRI_TRANSITIONS=131} [2021-12-16 02:49:35,829 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 30 predicate places. [2021-12-16 02:49:35,829 INFO L470 AbstractCegarLoop]: Abstraction has has 173 places, 131 transitions, 613 flow [2021-12-16 02:49:35,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 110.5) internal successors, (1326), 12 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:35,830 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:49:35,830 INFO L254 CegarLoopForPetriNet]: 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:49:35,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 02:49:35,831 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:49:35,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:49:35,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1889085463, now seen corresponding path program 1 times [2021-12-16 02:49:35,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:49:35,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631126301] [2021-12-16 02:49:35,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:49:35,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:49:35,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:49:35,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:49:35,941 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:49:35,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631126301] [2021-12-16 02:49:35,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631126301] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:49:35,942 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:49:35,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 02:49:35,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471969309] [2021-12-16 02:49:35,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:49:35,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 02:49:35,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:49:35,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 02:49:35,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 02:49:35,944 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2021-12-16 02:49:35,945 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 131 transitions, 613 flow. Second operand has 6 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:35,945 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:49:35,945 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2021-12-16 02:49:35,945 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:49:37,603 INFO L129 PetriNetUnfolder]: 6483/10811 cut-off events. [2021-12-16 02:49:37,604 INFO L130 PetriNetUnfolder]: For 237964/238517 co-relation queries the response was YES. [2021-12-16 02:49:37,649 INFO L84 FinitePrefix]: Finished finitePrefix Result has 62149 conditions, 10811 events. 6483/10811 cut-off events. For 237964/238517 co-relation queries the response was YES. Maximal size of possible extension queue 711. Compared 81685 event pairs, 188 based on Foata normal form. 517/11088 useless extension candidates. Maximal degree in co-relation 62059. Up to 3887 conditions per place. [2021-12-16 02:49:37,705 INFO L132 encePairwiseOnDemand]: 125/136 looper letters, 117 selfloop transitions, 16 changer transitions 85/311 dead transitions. [2021-12-16 02:49:37,705 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 311 transitions, 3200 flow [2021-12-16 02:49:37,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 02:49:37,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-16 02:49:37,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1190 transitions. [2021-12-16 02:49:37,708 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.875 [2021-12-16 02:49:37,708 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1190 transitions. [2021-12-16 02:49:37,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1190 transitions. [2021-12-16 02:49:37,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:49:37,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1190 transitions. [2021-12-16 02:49:37,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 119.0) internal successors, (1190), 10 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:37,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 136.0) internal successors, (1496), 11 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:37,713 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 136.0) internal successors, (1496), 11 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:37,713 INFO L186 Difference]: Start difference. First operand has 173 places, 131 transitions, 613 flow. Second operand 10 states and 1190 transitions. [2021-12-16 02:49:37,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 311 transitions, 3200 flow [2021-12-16 02:49:37,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 311 transitions, 2697 flow, removed 249 selfloop flow, removed 12 redundant places. [2021-12-16 02:49:37,780 INFO L242 Difference]: Finished difference. Result has 164 places, 145 transitions, 651 flow [2021-12-16 02:49:37,781 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=651, PETRI_PLACES=164, PETRI_TRANSITIONS=145} [2021-12-16 02:49:37,781 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 21 predicate places. [2021-12-16 02:49:37,781 INFO L470 AbstractCegarLoop]: Abstraction has has 164 places, 145 transitions, 651 flow [2021-12-16 02:49:37,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:37,782 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:49:37,782 INFO L254 CegarLoopForPetriNet]: 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:49:37,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-16 02:49:37,783 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:49:37,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:49:37,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1356074680, now seen corresponding path program 1 times [2021-12-16 02:49:37,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:49:37,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511208898] [2021-12-16 02:49:37,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:49:37,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:49:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:49:37,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:49:37,862 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:49:37,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511208898] [2021-12-16 02:49:37,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511208898] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:49:37,862 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:49:37,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 02:49:37,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123506955] [2021-12-16 02:49:37,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:49:37,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 02:49:37,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:49:37,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 02:49:37,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:49:37,865 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2021-12-16 02:49:37,865 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 145 transitions, 651 flow. Second operand has 7 states, 7 states have (on average 111.28571428571429) internal successors, (779), 7 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:37,865 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:49:37,866 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2021-12-16 02:49:37,866 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:49:39,437 INFO L129 PetriNetUnfolder]: 5853/10402 cut-off events. [2021-12-16 02:49:39,437 INFO L130 PetriNetUnfolder]: For 163201/163753 co-relation queries the response was YES. [2021-12-16 02:49:39,490 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57697 conditions, 10402 events. 5853/10402 cut-off events. For 163201/163753 co-relation queries the response was YES. Maximal size of possible extension queue 775. Compared 85121 event pairs, 119 based on Foata normal form. 653/11001 useless extension candidates. Maximal degree in co-relation 57610. Up to 2890 conditions per place. [2021-12-16 02:49:39,533 INFO L132 encePairwiseOnDemand]: 125/136 looper letters, 128 selfloop transitions, 30 changer transitions 121/372 dead transitions. [2021-12-16 02:49:39,534 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 372 transitions, 3729 flow [2021-12-16 02:49:39,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 02:49:39,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-16 02:49:39,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1547 transitions. [2021-12-16 02:49:39,541 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.875 [2021-12-16 02:49:39,541 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1547 transitions. [2021-12-16 02:49:39,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1547 transitions. [2021-12-16 02:49:39,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:49:39,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1547 transitions. [2021-12-16 02:49:39,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 119.0) internal successors, (1547), 13 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:39,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:39,547 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:39,547 INFO L186 Difference]: Start difference. First operand has 164 places, 145 transitions, 651 flow. Second operand 13 states and 1547 transitions. [2021-12-16 02:49:39,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 372 transitions, 3729 flow [2021-12-16 02:49:39,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 372 transitions, 3727 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-16 02:49:39,630 INFO L242 Difference]: Finished difference. Result has 181 places, 163 transitions, 896 flow [2021-12-16 02:49:39,630 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=896, PETRI_PLACES=181, PETRI_TRANSITIONS=163} [2021-12-16 02:49:39,632 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 38 predicate places. [2021-12-16 02:49:39,633 INFO L470 AbstractCegarLoop]: Abstraction has has 181 places, 163 transitions, 896 flow [2021-12-16 02:49:39,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.28571428571429) internal successors, (779), 7 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:39,634 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:49:39,634 INFO L254 CegarLoopForPetriNet]: 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:49:39,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-16 02:49:39,634 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:49:39,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:49:39,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1976071747, now seen corresponding path program 1 times [2021-12-16 02:49:39,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:49:39,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974075528] [2021-12-16 02:49:39,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:49:39,636 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:49:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:49:39,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:49:39,752 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:49:39,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974075528] [2021-12-16 02:49:39,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974075528] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:49:39,753 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:49:39,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 02:49:39,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504191685] [2021-12-16 02:49:39,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:49:39,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 02:49:39,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:49:39,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 02:49:39,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-16 02:49:39,758 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2021-12-16 02:49:39,759 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 163 transitions, 896 flow. Second operand has 8 states, 8 states have (on average 111.25) internal successors, (890), 8 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:39,759 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:49:39,760 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2021-12-16 02:49:39,760 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:49:41,316 INFO L129 PetriNetUnfolder]: 4972/9285 cut-off events. [2021-12-16 02:49:41,316 INFO L130 PetriNetUnfolder]: For 159630/160214 co-relation queries the response was YES. [2021-12-16 02:49:41,374 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55784 conditions, 9285 events. 4972/9285 cut-off events. For 159630/160214 co-relation queries the response was YES. Maximal size of possible extension queue 772. Compared 80001 event pairs, 116 based on Foata normal form. 582/9822 useless extension candidates. Maximal degree in co-relation 55689. Up to 2636 conditions per place. [2021-12-16 02:49:41,397 INFO L132 encePairwiseOnDemand]: 125/136 looper letters, 130 selfloop transitions, 35 changer transitions 147/405 dead transitions. [2021-12-16 02:49:41,397 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 405 transitions, 4466 flow [2021-12-16 02:49:41,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-16 02:49:41,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-16 02:49:41,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1901 transitions. [2021-12-16 02:49:41,401 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8736213235294118 [2021-12-16 02:49:41,401 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1901 transitions. [2021-12-16 02:49:41,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1901 transitions. [2021-12-16 02:49:41,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:49:41,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1901 transitions. [2021-12-16 02:49:41,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 118.8125) internal successors, (1901), 16 states have internal predecessors, (1901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:41,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 136.0) internal successors, (2312), 17 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:41,408 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 136.0) internal successors, (2312), 17 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:41,408 INFO L186 Difference]: Start difference. First operand has 181 places, 163 transitions, 896 flow. Second operand 16 states and 1901 transitions. [2021-12-16 02:49:41,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 405 transitions, 4466 flow [2021-12-16 02:49:41,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 405 transitions, 4391 flow, removed 30 selfloop flow, removed 4 redundant places. [2021-12-16 02:49:41,765 INFO L242 Difference]: Finished difference. Result has 199 places, 170 transitions, 1040 flow [2021-12-16 02:49:41,765 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1040, PETRI_PLACES=199, PETRI_TRANSITIONS=170} [2021-12-16 02:49:41,766 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 56 predicate places. [2021-12-16 02:49:41,766 INFO L470 AbstractCegarLoop]: Abstraction has has 199 places, 170 transitions, 1040 flow [2021-12-16 02:49:41,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 111.25) internal successors, (890), 8 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:41,766 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:49:41,766 INFO L254 CegarLoopForPetriNet]: 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:49:41,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-16 02:49:41,767 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:49:41,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:49:41,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1519327847, now seen corresponding path program 1 times [2021-12-16 02:49:41,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:49:41,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501460181] [2021-12-16 02:49:41,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:49:41,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:49:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:49:42,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:49:42,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:49:42,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501460181] [2021-12-16 02:49:42,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501460181] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:49:42,073 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:49:42,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-16 02:49:42,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070105112] [2021-12-16 02:49:42,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:49:42,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-16 02:49:42,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:49:42,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-16 02:49:42,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-12-16 02:49:42,075 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 136 [2021-12-16 02:49:42,076 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 170 transitions, 1040 flow. Second operand has 13 states, 13 states have (on average 107.84615384615384) internal successors, (1402), 13 states have internal predecessors, (1402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:42,076 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:49:42,076 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 136 [2021-12-16 02:49:42,076 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:49:43,084 INFO L129 PetriNetUnfolder]: 1342/5724 cut-off events. [2021-12-16 02:49:43,085 INFO L130 PetriNetUnfolder]: For 30896/32068 co-relation queries the response was YES. [2021-12-16 02:49:43,135 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21961 conditions, 5724 events. 1342/5724 cut-off events. For 30896/32068 co-relation queries the response was YES. Maximal size of possible extension queue 605. Compared 69364 event pairs, 53 based on Foata normal form. 59/5512 useless extension candidates. Maximal degree in co-relation 21853. Up to 777 conditions per place. [2021-12-16 02:49:43,164 INFO L132 encePairwiseOnDemand]: 121/136 looper letters, 92 selfloop transitions, 33 changer transitions 25/278 dead transitions. [2021-12-16 02:49:43,165 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 278 transitions, 2649 flow [2021-12-16 02:49:43,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-16 02:49:43,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-16 02:49:43,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1588 transitions. [2021-12-16 02:49:43,169 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8340336134453782 [2021-12-16 02:49:43,169 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1588 transitions. [2021-12-16 02:49:43,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1588 transitions. [2021-12-16 02:49:43,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:49:43,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1588 transitions. [2021-12-16 02:49:43,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 113.42857142857143) internal successors, (1588), 14 states have internal predecessors, (1588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:43,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 136.0) internal successors, (2040), 15 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:43,175 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 136.0) internal successors, (2040), 15 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:43,176 INFO L186 Difference]: Start difference. First operand has 199 places, 170 transitions, 1040 flow. Second operand 14 states and 1588 transitions. [2021-12-16 02:49:43,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 278 transitions, 2649 flow [2021-12-16 02:49:43,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 278 transitions, 2562 flow, removed 21 selfloop flow, removed 11 redundant places. [2021-12-16 02:49:43,543 INFO L242 Difference]: Finished difference. Result has 206 places, 195 transitions, 1414 flow [2021-12-16 02:49:43,544 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=953, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1414, PETRI_PLACES=206, PETRI_TRANSITIONS=195} [2021-12-16 02:49:43,546 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 63 predicate places. [2021-12-16 02:49:43,546 INFO L470 AbstractCegarLoop]: Abstraction has has 206 places, 195 transitions, 1414 flow [2021-12-16 02:49:43,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 107.84615384615384) internal successors, (1402), 13 states have internal predecessors, (1402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:43,547 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:49:43,547 INFO L254 CegarLoopForPetriNet]: 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:49:43,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-16 02:49:43,547 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:49:43,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:49:43,547 INFO L85 PathProgramCache]: Analyzing trace with hash 2100294423, now seen corresponding path program 2 times [2021-12-16 02:49:43,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:49:43,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695088974] [2021-12-16 02:49:43,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:49:43,548 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:49:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:49:43,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:49:43,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:49:43,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695088974] [2021-12-16 02:49:43,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695088974] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:49:43,702 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:49:43,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-16 02:49:43,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658689851] [2021-12-16 02:49:43,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:49:43,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 02:49:43,703 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:49:43,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 02:49:43,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-16 02:49:43,704 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2021-12-16 02:49:43,705 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 195 transitions, 1414 flow. Second operand has 9 states, 9 states have (on average 111.22222222222223) internal successors, (1001), 9 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:43,705 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:49:43,705 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2021-12-16 02:49:43,705 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:49:46,668 INFO L129 PetriNetUnfolder]: 9702/17243 cut-off events. [2021-12-16 02:49:46,669 INFO L130 PetriNetUnfolder]: For 438336/441556 co-relation queries the response was YES. [2021-12-16 02:49:46,769 INFO L84 FinitePrefix]: Finished finitePrefix Result has 119989 conditions, 17243 events. 9702/17243 cut-off events. For 438336/441556 co-relation queries the response was YES. Maximal size of possible extension queue 1493. Compared 157547 event pairs, 174 based on Foata normal form. 1813/18568 useless extension candidates. Maximal degree in co-relation 119938. Up to 6366 conditions per place. [2021-12-16 02:49:46,794 INFO L132 encePairwiseOnDemand]: 126/136 looper letters, 81 selfloop transitions, 27 changer transitions 331/535 dead transitions. [2021-12-16 02:49:46,794 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 535 transitions, 7807 flow [2021-12-16 02:49:46,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-16 02:49:46,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-12-16 02:49:46,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2097 transitions. [2021-12-16 02:49:46,798 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8566176470588235 [2021-12-16 02:49:46,798 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2097 transitions. [2021-12-16 02:49:46,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2097 transitions. [2021-12-16 02:49:46,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:49:46,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2097 transitions. [2021-12-16 02:49:46,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 116.5) internal successors, (2097), 18 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:46,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 136.0) internal successors, (2584), 19 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:46,805 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 136.0) internal successors, (2584), 19 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:46,805 INFO L186 Difference]: Start difference. First operand has 206 places, 195 transitions, 1414 flow. Second operand 18 states and 2097 transitions. [2021-12-16 02:49:46,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 535 transitions, 7807 flow [2021-12-16 02:49:47,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 535 transitions, 5970 flow, removed 917 selfloop flow, removed 8 redundant places. [2021-12-16 02:49:47,758 INFO L242 Difference]: Finished difference. Result has 218 places, 158 transitions, 885 flow [2021-12-16 02:49:47,759 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=1172, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=885, PETRI_PLACES=218, PETRI_TRANSITIONS=158} [2021-12-16 02:49:47,759 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 75 predicate places. [2021-12-16 02:49:47,759 INFO L470 AbstractCegarLoop]: Abstraction has has 218 places, 158 transitions, 885 flow [2021-12-16 02:49:47,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 111.22222222222223) internal successors, (1001), 9 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:47,760 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:49:47,760 INFO L254 CegarLoopForPetriNet]: 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, 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, 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, 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, 1] [2021-12-16 02:49:47,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-16 02:49:47,761 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:49:47,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:49:47,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1251647534, now seen corresponding path program 1 times [2021-12-16 02:49:47,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:49:47,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058831731] [2021-12-16 02:49:47,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:49:47,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:49:47,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:49:47,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:49:47,861 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:49:47,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058831731] [2021-12-16 02:49:47,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058831731] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:49:47,862 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:49:47,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 02:49:47,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180978573] [2021-12-16 02:49:47,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:49:47,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 02:49:47,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:49:47,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 02:49:47,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:49:47,865 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2021-12-16 02:49:47,866 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 158 transitions, 885 flow. Second operand has 7 states, 7 states have (on average 113.85714285714286) internal successors, (797), 7 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:47,866 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:49:47,866 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2021-12-16 02:49:47,867 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:49:48,683 INFO L129 PetriNetUnfolder]: 1161/4948 cut-off events. [2021-12-16 02:49:48,683 INFO L130 PetriNetUnfolder]: For 27533/29019 co-relation queries the response was YES. [2021-12-16 02:49:48,734 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18251 conditions, 4948 events. 1161/4948 cut-off events. For 27533/29019 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 60169 event pairs, 74 based on Foata normal form. 37/4607 useless extension candidates. Maximal degree in co-relation 18144. Up to 907 conditions per place. [2021-12-16 02:49:48,749 INFO L132 encePairwiseOnDemand]: 130/136 looper letters, 67 selfloop transitions, 2 changer transitions 5/196 dead transitions. [2021-12-16 02:49:48,749 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 196 transitions, 1420 flow [2021-12-16 02:49:48,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 02:49:48,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-16 02:49:48,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 813 transitions. [2021-12-16 02:49:48,751 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8539915966386554 [2021-12-16 02:49:48,752 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 813 transitions. [2021-12-16 02:49:48,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 813 transitions. [2021-12-16 02:49:48,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:49:48,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 813 transitions. [2021-12-16 02:49:48,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.14285714285714) internal successors, (813), 7 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:48,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:48,757 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:48,757 INFO L186 Difference]: Start difference. First operand has 218 places, 158 transitions, 885 flow. Second operand 7 states and 813 transitions. [2021-12-16 02:49:48,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 196 transitions, 1420 flow [2021-12-16 02:49:48,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 196 transitions, 1022 flow, removed 148 selfloop flow, removed 37 redundant places. [2021-12-16 02:49:48,936 INFO L242 Difference]: Finished difference. Result has 179 places, 159 transitions, 640 flow [2021-12-16 02:49:48,936 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=640, PETRI_PLACES=179, PETRI_TRANSITIONS=159} [2021-12-16 02:49:48,938 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 36 predicate places. [2021-12-16 02:49:48,938 INFO L470 AbstractCegarLoop]: Abstraction has has 179 places, 159 transitions, 640 flow [2021-12-16 02:49:48,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.85714285714286) internal successors, (797), 7 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:48,938 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:49:48,939 INFO L254 CegarLoopForPetriNet]: 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, 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, 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, 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, 1] [2021-12-16 02:49:48,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-16 02:49:48,939 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:49:48,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:49:48,939 INFO L85 PathProgramCache]: Analyzing trace with hash -668658260, now seen corresponding path program 2 times [2021-12-16 02:49:48,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:49:48,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902066003] [2021-12-16 02:49:48,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:49:48,940 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:49:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:49:49,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:49:49,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:49:49,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902066003] [2021-12-16 02:49:49,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902066003] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:49:49,059 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:49:49,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 02:49:49,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022746662] [2021-12-16 02:49:49,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:49:49,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 02:49:49,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:49:49,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 02:49:49,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:49:49,061 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2021-12-16 02:49:49,061 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 159 transitions, 640 flow. Second operand has 7 states, 7 states have (on average 113.85714285714286) internal successors, (797), 7 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:49,061 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:49:49,062 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2021-12-16 02:49:49,062 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:49:49,973 INFO L129 PetriNetUnfolder]: 2054/8947 cut-off events. [2021-12-16 02:49:49,973 INFO L130 PetriNetUnfolder]: For 7836/8667 co-relation queries the response was YES. [2021-12-16 02:49:50,030 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20507 conditions, 8947 events. 2054/8947 cut-off events. For 7836/8667 co-relation queries the response was YES. Maximal size of possible extension queue 1265. Compared 124114 event pairs, 38 based on Foata normal form. 38/8301 useless extension candidates. Maximal degree in co-relation 20480. Up to 1270 conditions per place. [2021-12-16 02:49:50,039 INFO L132 encePairwiseOnDemand]: 130/136 looper letters, 47 selfloop transitions, 2 changer transitions 25/197 dead transitions. [2021-12-16 02:49:50,039 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 197 transitions, 1047 flow [2021-12-16 02:49:50,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 02:49:50,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-16 02:49:50,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 816 transitions. [2021-12-16 02:49:50,041 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2021-12-16 02:49:50,041 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 816 transitions. [2021-12-16 02:49:50,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 816 transitions. [2021-12-16 02:49:50,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:49:50,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 816 transitions. [2021-12-16 02:49:50,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.57142857142857) internal successors, (816), 7 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:50,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:50,044 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:50,044 INFO L186 Difference]: Start difference. First operand has 179 places, 159 transitions, 640 flow. Second operand 7 states and 816 transitions. [2021-12-16 02:49:50,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 197 transitions, 1047 flow [2021-12-16 02:49:50,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 197 transitions, 1036 flow, removed 5 selfloop flow, removed 4 redundant places. [2021-12-16 02:49:50,170 INFO L242 Difference]: Finished difference. Result has 183 places, 152 transitions, 579 flow [2021-12-16 02:49:50,170 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=579, PETRI_PLACES=183, PETRI_TRANSITIONS=152} [2021-12-16 02:49:50,171 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 40 predicate places. [2021-12-16 02:49:50,171 INFO L470 AbstractCegarLoop]: Abstraction has has 183 places, 152 transitions, 579 flow [2021-12-16 02:49:50,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.85714285714286) internal successors, (797), 7 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:50,171 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:49:50,172 INFO L254 CegarLoopForPetriNet]: 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, 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, 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, 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, 1] [2021-12-16 02:49:50,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-16 02:49:50,172 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:49:50,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:49:50,172 INFO L85 PathProgramCache]: Analyzing trace with hash 169091956, now seen corresponding path program 3 times [2021-12-16 02:49:50,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:49:50,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783543848] [2021-12-16 02:49:50,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:49:50,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:49:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:49:50,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:49:50,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:49:50,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783543848] [2021-12-16 02:49:50,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783543848] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:49:50,369 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:49:50,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-16 02:49:50,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537673637] [2021-12-16 02:49:50,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:49:50,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 02:49:50,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:49:50,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 02:49:50,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-12-16 02:49:50,370 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2021-12-16 02:49:50,371 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 152 transitions, 579 flow. Second operand has 11 states, 11 states have (on average 111.0) internal successors, (1221), 11 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:50,371 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:49:50,371 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2021-12-16 02:49:50,371 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:49:51,304 INFO L129 PetriNetUnfolder]: 2163/9905 cut-off events. [2021-12-16 02:49:51,304 INFO L130 PetriNetUnfolder]: For 6784/8442 co-relation queries the response was YES. [2021-12-16 02:49:51,392 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20952 conditions, 9905 events. 2163/9905 cut-off events. For 6784/8442 co-relation queries the response was YES. Maximal size of possible extension queue 1409. Compared 143141 event pairs, 44 based on Foata normal form. 70/9187 useless extension candidates. Maximal degree in co-relation 20923. Up to 1628 conditions per place. [2021-12-16 02:49:51,403 INFO L132 encePairwiseOnDemand]: 125/136 looper letters, 25 selfloop transitions, 12 changer transitions 11/166 dead transitions. [2021-12-16 02:49:51,403 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 166 transitions, 755 flow [2021-12-16 02:49:51,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 02:49:51,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-16 02:49:51,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1020 transitions. [2021-12-16 02:49:51,405 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2021-12-16 02:49:51,405 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1020 transitions. [2021-12-16 02:49:51,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1020 transitions. [2021-12-16 02:49:51,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:49:51,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1020 transitions. [2021-12-16 02:49:51,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 113.33333333333333) internal successors, (1020), 9 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:51,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:51,408 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:51,409 INFO L186 Difference]: Start difference. First operand has 183 places, 152 transitions, 579 flow. Second operand 9 states and 1020 transitions. [2021-12-16 02:49:51,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 166 transitions, 755 flow [2021-12-16 02:49:51,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 166 transitions, 714 flow, removed 11 selfloop flow, removed 9 redundant places. [2021-12-16 02:49:51,554 INFO L242 Difference]: Finished difference. Result has 183 places, 152 transitions, 593 flow [2021-12-16 02:49:51,554 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=593, PETRI_PLACES=183, PETRI_TRANSITIONS=152} [2021-12-16 02:49:51,555 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 40 predicate places. [2021-12-16 02:49:51,555 INFO L470 AbstractCegarLoop]: Abstraction has has 183 places, 152 transitions, 593 flow [2021-12-16 02:49:51,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 111.0) internal successors, (1221), 11 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:49:51,555 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:49:51,556 INFO L254 CegarLoopForPetriNet]: 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, 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, 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, 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, 1] [2021-12-16 02:49:51,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-16 02:49:51,556 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:49:51,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:49:51,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1124050760, now seen corresponding path program 4 times [2021-12-16 02:49:51,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:49:51,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767795116] [2021-12-16 02:49:51,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:49:51,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:49:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 02:49:51,595 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 02:49:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 02:49:51,687 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 02:49:51,687 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-16 02:49:51,688 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2021-12-16 02:49:51,689 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2021-12-16 02:49:51,690 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2021-12-16 02:49:51,691 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2021-12-16 02:49:51,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2021-12-16 02:49:51,693 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2021-12-16 02:49:51,693 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2021-12-16 02:49:51,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-16 02:49:51,696 INFO L732 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:49:51,700 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-16 02:49:51,700 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-16 02:49:51,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 02:49:51 BasicIcfg [2021-12-16 02:49:51,826 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-16 02:49:51,827 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-16 02:49:51,827 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-16 02:49:51,827 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-16 02:49:51,827 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 02:49:32" (3/4) ... [2021-12-16 02:49:51,829 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-16 02:49:51,938 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-16 02:49:51,938 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-16 02:49:51,939 INFO L158 Benchmark]: Toolchain (without parser) took 21311.16ms. Allocated memory was 130.0MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 94.7MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2021-12-16 02:49:51,939 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 86.0MB. Free memory was 57.4MB in the beginning and 57.4MB in the end (delta: 26.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 02:49:51,939 INFO L158 Benchmark]: CACSL2BoogieTranslator took 487.71ms. Allocated memory is still 130.0MB. Free memory was 94.4MB in the beginning and 92.0MB in the end (delta: 2.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-16 02:49:51,940 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.22ms. Allocated memory is still 130.0MB. Free memory was 92.0MB in the beginning and 88.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-16 02:49:51,940 INFO L158 Benchmark]: Boogie Preprocessor took 43.95ms. Allocated memory is still 130.0MB. Free memory was 88.6MB in the beginning and 86.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 02:49:51,940 INFO L158 Benchmark]: RCFGBuilder took 901.04ms. Allocated memory is still 130.0MB. Free memory was 86.5MB in the beginning and 66.2MB in the end (delta: 20.2MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. [2021-12-16 02:49:51,940 INFO L158 Benchmark]: TraceAbstraction took 19682.48ms. Allocated memory was 130.0MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 65.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2021-12-16 02:49:51,941 INFO L158 Benchmark]: Witness Printer took 111.31ms. Allocated memory is still 2.9GB. Free memory was 1.3GB in the beginning and 1.2GB in the end (delta: 47.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2021-12-16 02:49:51,942 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.17ms. Allocated memory is still 86.0MB. Free memory was 57.4MB in the beginning and 57.4MB in the end (delta: 26.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 487.71ms. Allocated memory is still 130.0MB. Free memory was 94.4MB in the beginning and 92.0MB in the end (delta: 2.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.22ms. Allocated memory is still 130.0MB. Free memory was 92.0MB in the beginning and 88.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.95ms. Allocated memory is still 130.0MB. Free memory was 88.6MB in the beginning and 86.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 901.04ms. Allocated memory is still 130.0MB. Free memory was 86.5MB in the beginning and 66.2MB in the end (delta: 20.2MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. * TraceAbstraction took 19682.48ms. Allocated memory was 130.0MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 65.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 111.31ms. Allocated memory is still 2.9GB. Free memory was 1.3GB in the beginning and 1.2GB in the end (delta: 47.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L718] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L723] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L724] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L725] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L726] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L727] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L728] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L729] 0 _Bool x$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0] [L730] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0] [L731] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L732] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L733] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L734] 0 _Bool x$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0] [L735] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0] [L736] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L737] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L738] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L739] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L740] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L742] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L745] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L746] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L848] 0 pthread_t t1377; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1377={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L849] FCALL, FORK 0 pthread_create(&t1377, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1377, ((void *)0), P0, ((void *)0))=-3, t1377={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L850] 0 pthread_t t1378; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1377={5:0}, t1378={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L851] FCALL, FORK 0 pthread_create(&t1378, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1378, ((void *)0), P1, ((void *)0))=-2, t1377={5:0}, t1378={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L852] 0 pthread_t t1379; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1377={5:0}, t1378={6:0}, t1379={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L853] FCALL, FORK 0 pthread_create(&t1379, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1379, ((void *)0), P2, ((void *)0))=-1, t1377={5:0}, t1378={6:0}, t1379={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L854] 0 pthread_t t1380; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1377={5:0}, t1378={6:0}, t1379={7:0}, t1380={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L855] FCALL, FORK 0 pthread_create(&t1380, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1380, ((void *)0), P3, ((void *)0))=0, t1377={5:0}, t1378={6:0}, t1379={7:0}, t1380={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L774] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L774] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L820] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L823] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L756] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L756] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L760] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L806] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L806] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L808] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L810] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L826] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L826] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L826] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L826] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L827] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L827] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L828] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L828] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L829] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L829] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L830] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L830] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L833] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1377={5:0}, t1378={6:0}, t1379={7:0}, t1380={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L865] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L865] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 x$flush_delayed = weak$$choice2 [L871] 0 x$mem_tmp = x [L872] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L873] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L874] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L875] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L876] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L878] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L880] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L880] 0 x = x$flush_delayed ? x$mem_tmp : x [L881] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1377={5:0}, t1378={6:0}, t1379={7:0}, t1380={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L883] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 172 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 19.4s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 16.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 984 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 984 mSDsluCounter, 574 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1257 mSDsCounter, 321 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2179 IncrementalHoareTripleChecker+Invalid, 2500 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 321 mSolverCounterUnsat, 103 mSDtfsCounter, 2179 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 190 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1414occurred in iteration=8, InterpolantAutomatonStates: 148, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1212 NumberOfCodeBlocks, 1212 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1095 ConstructedInterpolants, 0 QuantifiedInterpolants, 5614 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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! [2021-12-16 02:49:51,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE