./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix042.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/mix042.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 65b1f643bcee3322b8ab5a998e6338f6065aa9114a28902f0ff5431bd8cb45ea --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 22:19:32,288 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 22:19:32,290 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 22:19:32,351 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 22:19:32,352 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 22:19:32,354 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 22:19:32,355 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 22:19:32,357 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 22:19:32,359 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 22:19:32,362 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 22:19:32,363 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 22:19:32,364 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 22:19:32,364 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 22:19:32,366 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 22:19:32,367 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 22:19:32,370 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 22:19:32,371 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 22:19:32,372 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 22:19:32,374 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 22:19:32,378 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 22:19:32,379 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 22:19:32,380 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 22:19:32,381 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 22:19:32,381 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 22:19:32,386 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 22:19:32,387 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 22:19:32,387 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 22:19:32,388 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 22:19:32,389 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 22:19:32,389 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 22:19:32,389 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 22:19:32,390 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 22:19:32,391 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 22:19:32,392 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 22:19:32,393 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 22:19:32,393 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 22:19:32,394 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 22:19:32,394 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 22:19:32,394 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 22:19:32,394 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 22:19:32,395 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 22:19:32,396 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 22:19:32,422 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 22:19:32,422 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 22:19:32,423 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 22:19:32,423 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 22:19:32,424 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 22:19:32,424 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 22:19:32,424 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 22:19:32,425 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 22:19:32,425 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 22:19:32,425 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 22:19:32,425 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 22:19:32,426 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 22:19:32,426 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 22:19:32,426 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 22:19:32,426 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 22:19:32,426 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 22:19:32,426 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 22:19:32,427 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 22:19:32,427 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 22:19:32,427 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 22:19:32,427 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 22:19:32,427 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 22:19:32,427 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 22:19:32,427 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 22:19:32,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 22:19:32,428 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 22:19:32,428 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 22:19:32,429 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 22:19:32,429 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 22:19:32,429 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 22:19:32,429 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 22:19:32,430 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 22:19:32,430 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 22:19:32,430 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 22:19:32,430 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 -> 65b1f643bcee3322b8ab5a998e6338f6065aa9114a28902f0ff5431bd8cb45ea [2021-12-17 22:19:32,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 22:19:32,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 22:19:32,640 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 22:19:32,641 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 22:19:32,641 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 22:19:32,642 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix042.oepc.i [2021-12-17 22:19:32,685 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d5ecb486/c4ba1837a93744b29bd59c9c3658f91c/FLAGf0956c1cc [2021-12-17 22:19:33,163 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 22:19:33,166 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix042.oepc.i [2021-12-17 22:19:33,184 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d5ecb486/c4ba1837a93744b29bd59c9c3658f91c/FLAGf0956c1cc [2021-12-17 22:19:33,197 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d5ecb486/c4ba1837a93744b29bd59c9c3658f91c [2021-12-17 22:19:33,199 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 22:19:33,200 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 22:19:33,202 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 22:19:33,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 22:19:33,205 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 22:19:33,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:19:33" (1/1) ... [2021-12-17 22:19:33,206 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@432a46f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:19:33, skipping insertion in model container [2021-12-17 22:19:33,207 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:19:33" (1/1) ... [2021-12-17 22:19:33,211 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 22:19:33,258 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 22:19:33,425 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/mix042.oepc.i[945,958] [2021-12-17 22:19:33,616 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 22:19:33,623 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 22:19:33,631 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/mix042.oepc.i[945,958] [2021-12-17 22:19:33,670 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 22:19:33,704 INFO L208 MainTranslator]: Completed translation [2021-12-17 22:19:33,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:19:33 WrapperNode [2021-12-17 22:19:33,705 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 22:19:33,706 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 22:19:33,706 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 22:19:33,706 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 22:19:33,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:19:33" (1/1) ... [2021-12-17 22:19:33,738 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:19:33" (1/1) ... [2021-12-17 22:19:33,762 INFO L137 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 178 [2021-12-17 22:19:33,763 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 22:19:33,763 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 22:19:33,764 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 22:19:33,764 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 22:19:33,769 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:19:33" (1/1) ... [2021-12-17 22:19:33,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:19:33" (1/1) ... [2021-12-17 22:19:33,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:19:33" (1/1) ... [2021-12-17 22:19:33,787 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:19:33" (1/1) ... [2021-12-17 22:19:33,804 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:19:33" (1/1) ... [2021-12-17 22:19:33,806 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:19:33" (1/1) ... [2021-12-17 22:19:33,808 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:19:33" (1/1) ... [2021-12-17 22:19:33,811 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 22:19:33,812 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 22:19:33,812 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 22:19:33,812 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 22:19:33,813 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:19:33" (1/1) ... [2021-12-17 22:19:33,818 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 22:19:33,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 22:19:33,838 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-17 22:19:33,855 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-17 22:19:33,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-17 22:19:33,874 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-17 22:19:33,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 22:19:33,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 22:19:33,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 22:19:33,875 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-17 22:19:33,876 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-17 22:19:33,876 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-17 22:19:33,876 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-17 22:19:33,876 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-12-17 22:19:33,877 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-12-17 22:19:33,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 22:19:33,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-17 22:19:33,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 22:19:33,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 22:19:33,878 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-17 22:19:34,019 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 22:19:34,024 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 22:19:34,343 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 22:19:34,529 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 22:19:34,530 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-17 22:19:34,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:19:34 BoogieIcfgContainer [2021-12-17 22:19:34,531 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 22:19:34,533 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 22:19:34,533 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 22:19:34,536 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 22:19:34,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 10:19:33" (1/3) ... [2021-12-17 22:19:34,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@332fd691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:19:34, skipping insertion in model container [2021-12-17 22:19:34,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:19:33" (2/3) ... [2021-12-17 22:19:34,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@332fd691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:19:34, skipping insertion in model container [2021-12-17 22:19:34,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:19:34" (3/3) ... [2021-12-17 22:19:34,540 INFO L111 eAbstractionObserver]: Analyzing ICFG mix042.oepc.i [2021-12-17 22:19:34,545 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-17 22:19:34,545 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 22:19:34,545 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-17 22:19:34,545 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-17 22:19:34,590 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,591 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,591 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,591 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,591 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,591 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,591 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,592 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,592 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,592 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,593 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,593 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,593 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,593 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,593 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,593 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,594 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,594 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,594 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,594 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,594 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,595 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,595 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,596 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,596 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,596 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,596 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,596 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,596 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,596 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,597 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,597 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,598 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,598 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,598 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,598 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,598 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,598 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,598 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,599 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,599 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,599 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,599 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,599 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,600 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,600 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,600 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,600 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,600 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,600 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,600 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,601 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,601 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,601 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,601 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,601 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,601 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,602 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,602 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,602 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,602 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,602 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,602 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,602 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,603 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,603 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,603 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,603 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,603 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,604 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,604 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,604 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,604 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,604 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,604 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,604 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,604 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,605 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,605 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,606 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,607 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,607 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,608 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,608 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,608 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,608 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,609 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,609 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,609 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,612 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,612 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,613 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,613 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,613 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,613 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,613 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,613 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,613 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,613 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,614 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,614 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,614 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,614 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,614 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,614 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,615 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,616 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,616 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,617 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,617 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,617 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,617 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,617 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,617 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,617 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,618 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,618 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,618 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,618 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,618 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,618 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,618 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,618 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,619 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,619 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,619 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,619 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,619 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,619 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,619 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,619 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,619 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,620 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,620 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,620 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,620 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,620 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,620 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,620 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,620 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,621 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,621 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,621 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,621 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,622 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,622 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,622 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,623 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,623 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,623 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,623 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,624 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,624 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,625 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,625 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,625 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,625 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,625 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,625 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,626 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,626 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,626 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,629 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,629 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,629 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,629 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,630 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,630 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,630 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,630 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,630 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,630 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,630 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,631 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,631 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,631 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,631 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,631 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,631 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,631 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,631 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,632 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,632 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,632 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,632 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,632 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,632 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,632 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,632 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,633 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,633 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,633 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,633 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,633 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,633 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,634 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,634 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,634 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,635 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,635 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,635 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,635 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,635 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,635 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,635 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,635 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,636 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,639 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,639 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,639 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,639 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,639 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,639 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,639 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,640 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,640 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,641 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:34,641 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-17 22:19:34,678 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 22:19:34,683 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-17 22:19:34,683 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-12-17 22:19:34,691 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 119 transitions, 253 flow [2021-12-17 22:19:34,732 INFO L129 PetriNetUnfolder]: 2/116 cut-off events. [2021-12-17 22:19:34,733 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-17 22:19:34,742 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2021-12-17 22:19:34,742 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 119 transitions, 253 flow [2021-12-17 22:19:34,746 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 116 transitions, 241 flow [2021-12-17 22:19:34,758 INFO L129 PetriNetUnfolder]: 0/49 cut-off events. [2021-12-17 22:19:34,758 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-17 22:19:34,758 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:19:34,758 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] [2021-12-17 22:19:34,759 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-17 22:19:34,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:19:34,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1643517879, now seen corresponding path program 1 times [2021-12-17 22:19:34,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:19:34,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136117774] [2021-12-17 22:19:34,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:19:34,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:19:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:19:34,932 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-17 22:19:34,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:19:34,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136117774] [2021-12-17 22:19:34,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136117774] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:19:34,933 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:19:34,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 22:19:34,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595582512] [2021-12-17 22:19:34,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:19:34,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 22:19:34,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:19:34,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 22:19:34,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 22:19:34,956 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 119 [2021-12-17 22:19:34,959 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 116 transitions, 241 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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-17 22:19:34,959 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:19:34,959 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 119 [2021-12-17 22:19:34,959 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:19:35,075 INFO L129 PetriNetUnfolder]: 58/326 cut-off events. [2021-12-17 22:19:35,076 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-12-17 22:19:35,077 INFO L84 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 326 events. 58/326 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1368 event pairs, 44 based on Foata normal form. 18/319 useless extension candidates. Maximal degree in co-relation 401. Up to 79 conditions per place. [2021-12-17 22:19:35,079 INFO L132 encePairwiseOnDemand]: 114/119 looper letters, 14 selfloop transitions, 2 changer transitions 0/118 dead transitions. [2021-12-17 22:19:35,079 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 118 transitions, 283 flow [2021-12-17 22:19:35,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 22:19:35,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-17 22:19:35,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2021-12-17 22:19:35,088 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9411764705882353 [2021-12-17 22:19:35,088 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 336 transitions. [2021-12-17 22:19:35,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions. [2021-12-17 22:19:35,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:19:35,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions. [2021-12-17 22:19:35,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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-17 22:19:35,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 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-17 22:19:35,097 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 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-17 22:19:35,098 INFO L186 Difference]: Start difference. First operand has 124 places, 116 transitions, 241 flow. Second operand 3 states and 336 transitions. [2021-12-17 22:19:35,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 118 transitions, 283 flow [2021-12-17 22:19:35,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 118 transitions, 278 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-12-17 22:19:35,103 INFO L242 Difference]: Finished difference. Result has 121 places, 112 transitions, 234 flow [2021-12-17 22:19:35,104 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=121, PETRI_TRANSITIONS=112} [2021-12-17 22:19:35,106 INFO L334 CegarLoopForPetriNet]: 124 programPoint places, -3 predicate places. [2021-12-17 22:19:35,106 INFO L470 AbstractCegarLoop]: Abstraction has has 121 places, 112 transitions, 234 flow [2021-12-17 22:19:35,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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-17 22:19:35,107 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:19:35,107 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] [2021-12-17 22:19:35,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 22:19:35,107 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-17 22:19:35,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:19:35,108 INFO L85 PathProgramCache]: Analyzing trace with hash -546211699, now seen corresponding path program 1 times [2021-12-17 22:19:35,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:19:35,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178607221] [2021-12-17 22:19:35,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:19:35,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:19:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:19:35,258 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-17 22:19:35,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:19:35,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178607221] [2021-12-17 22:19:35,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178607221] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:19:35,258 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:19:35,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 22:19:35,259 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939910853] [2021-12-17 22:19:35,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:19:35,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 22:19:35,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:19:35,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 22:19:35,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 22:19:35,261 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 119 [2021-12-17 22:19:35,262 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 112 transitions, 234 flow. Second operand has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 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-17 22:19:35,262 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:19:35,262 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 119 [2021-12-17 22:19:35,262 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:19:36,155 INFO L129 PetriNetUnfolder]: 2408/6039 cut-off events. [2021-12-17 22:19:36,155 INFO L130 PetriNetUnfolder]: For 285/285 co-relation queries the response was YES. [2021-12-17 22:19:36,168 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10015 conditions, 6039 events. 2408/6039 cut-off events. For 285/285 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 54086 event pairs, 493 based on Foata normal form. 0/5882 useless extension candidates. Maximal degree in co-relation 9958. Up to 1434 conditions per place. [2021-12-17 22:19:36,181 INFO L132 encePairwiseOnDemand]: 107/119 looper letters, 31 selfloop transitions, 8 changer transitions 76/192 dead transitions. [2021-12-17 22:19:36,181 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 192 transitions, 620 flow [2021-12-17 22:19:36,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 22:19:36,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-17 22:19:36,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 925 transitions. [2021-12-17 22:19:36,186 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8636788048552755 [2021-12-17 22:19:36,186 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 925 transitions. [2021-12-17 22:19:36,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 925 transitions. [2021-12-17 22:19:36,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:19:36,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 925 transitions. [2021-12-17 22:19:36,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 102.77777777777777) internal successors, (925), 9 states have internal predecessors, (925), 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-17 22:19:36,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 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-17 22:19:36,192 INFO L81 ComplementDD]: Finished complementDD. Result has 10 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-17 22:19:36,192 INFO L186 Difference]: Start difference. First operand has 121 places, 112 transitions, 234 flow. Second operand 9 states and 925 transitions. [2021-12-17 22:19:36,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 192 transitions, 620 flow [2021-12-17 22:19:36,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 192 transitions, 602 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-17 22:19:36,196 INFO L242 Difference]: Finished difference. Result has 135 places, 105 transitions, 302 flow [2021-12-17 22:19:36,196 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=302, PETRI_PLACES=135, PETRI_TRANSITIONS=105} [2021-12-17 22:19:36,197 INFO L334 CegarLoopForPetriNet]: 124 programPoint places, 11 predicate places. [2021-12-17 22:19:36,197 INFO L470 AbstractCegarLoop]: Abstraction has has 135 places, 105 transitions, 302 flow [2021-12-17 22:19:36,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 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-17 22:19:36,197 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:19:36,197 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] [2021-12-17 22:19:36,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 22:19:36,198 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-17 22:19:36,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:19:36,198 INFO L85 PathProgramCache]: Analyzing trace with hash 328406060, now seen corresponding path program 1 times [2021-12-17 22:19:36,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:19:36,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409775718] [2021-12-17 22:19:36,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:19:36,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:19:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:19:36,288 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-17 22:19:36,288 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:19:36,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409775718] [2021-12-17 22:19:36,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409775718] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:19:36,288 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:19:36,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 22:19:36,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556960754] [2021-12-17 22:19:36,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:19:36,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 22:19:36,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:19:36,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 22:19:36,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 22:19:36,290 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 119 [2021-12-17 22:19:36,291 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 105 transitions, 302 flow. Second operand has 6 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 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-17 22:19:36,291 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:19:36,291 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 119 [2021-12-17 22:19:36,291 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:19:36,783 INFO L129 PetriNetUnfolder]: 1186/2466 cut-off events. [2021-12-17 22:19:36,784 INFO L130 PetriNetUnfolder]: For 3051/3121 co-relation queries the response was YES. [2021-12-17 22:19:36,791 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6578 conditions, 2466 events. 1186/2466 cut-off events. For 3051/3121 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 17452 event pairs, 253 based on Foata normal form. 119/2478 useless extension candidates. Maximal degree in co-relation 6512. Up to 908 conditions per place. [2021-12-17 22:19:36,798 INFO L132 encePairwiseOnDemand]: 113/119 looper letters, 20 selfloop transitions, 3 changer transitions 40/149 dead transitions. [2021-12-17 22:19:36,798 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 149 transitions, 606 flow [2021-12-17 22:19:36,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 22:19:36,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-17 22:19:36,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 930 transitions. [2021-12-17 22:19:36,801 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8683473389355743 [2021-12-17 22:19:36,801 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 930 transitions. [2021-12-17 22:19:36,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 930 transitions. [2021-12-17 22:19:36,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:19:36,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 930 transitions. [2021-12-17 22:19:36,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 103.33333333333333) internal successors, (930), 9 states have internal predecessors, (930), 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-17 22:19:36,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 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-17 22:19:36,805 INFO L81 ComplementDD]: Finished complementDD. Result has 10 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-17 22:19:36,806 INFO L186 Difference]: Start difference. First operand has 135 places, 105 transitions, 302 flow. Second operand 9 states and 930 transitions. [2021-12-17 22:19:36,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 149 transitions, 606 flow [2021-12-17 22:19:36,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 149 transitions, 562 flow, removed 8 selfloop flow, removed 2 redundant places. [2021-12-17 22:19:36,820 INFO L242 Difference]: Finished difference. Result has 130 places, 105 transitions, 301 flow [2021-12-17 22:19:36,820 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=301, PETRI_PLACES=130, PETRI_TRANSITIONS=105} [2021-12-17 22:19:36,822 INFO L334 CegarLoopForPetriNet]: 124 programPoint places, 6 predicate places. [2021-12-17 22:19:36,822 INFO L470 AbstractCegarLoop]: Abstraction has has 130 places, 105 transitions, 301 flow [2021-12-17 22:19:36,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 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-17 22:19:36,822 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:19:36,823 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] [2021-12-17 22:19:36,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-17 22:19:36,823 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-17 22:19:36,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:19:36,824 INFO L85 PathProgramCache]: Analyzing trace with hash -370154997, now seen corresponding path program 1 times [2021-12-17 22:19:36,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:19:36,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173926594] [2021-12-17 22:19:36,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:19:36,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:19:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:19:36,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-17 22:19:36,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:19:36,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173926594] [2021-12-17 22:19:36,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173926594] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:19:36,943 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:19:36,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 22:19:36,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739891571] [2021-12-17 22:19:36,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:19:36,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 22:19:36,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:19:36,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 22:19:36,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 22:19:36,949 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 119 [2021-12-17 22:19:36,950 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 105 transitions, 301 flow. Second operand has 6 states, 6 states have (on average 96.83333333333333) internal successors, (581), 6 states have internal predecessors, (581), 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-17 22:19:36,950 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:19:36,950 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 119 [2021-12-17 22:19:36,950 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:19:37,662 INFO L129 PetriNetUnfolder]: 2546/5147 cut-off events. [2021-12-17 22:19:37,662 INFO L130 PetriNetUnfolder]: For 3065/4184 co-relation queries the response was YES. [2021-12-17 22:19:37,681 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11170 conditions, 5147 events. 2546/5147 cut-off events. For 3065/4184 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 40980 event pairs, 138 based on Foata normal form. 44/4932 useless extension candidates. Maximal degree in co-relation 11099. Up to 1364 conditions per place. [2021-12-17 22:19:37,733 INFO L132 encePairwiseOnDemand]: 109/119 looper letters, 78 selfloop transitions, 17 changer transitions 0/179 dead transitions. [2021-12-17 22:19:37,733 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 179 transitions, 713 flow [2021-12-17 22:19:37,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 22:19:37,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-17 22:19:37,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1039 transitions. [2021-12-17 22:19:37,736 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.873109243697479 [2021-12-17 22:19:37,736 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1039 transitions. [2021-12-17 22:19:37,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1039 transitions. [2021-12-17 22:19:37,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:19:37,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1039 transitions. [2021-12-17 22:19:37,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 103.9) internal successors, (1039), 10 states have internal predecessors, (1039), 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-17 22:19:37,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 119.0) internal successors, (1309), 11 states have internal predecessors, (1309), 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-17 22:19:37,740 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 119.0) internal successors, (1309), 11 states have internal predecessors, (1309), 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-17 22:19:37,740 INFO L186 Difference]: Start difference. First operand has 130 places, 105 transitions, 301 flow. Second operand 10 states and 1039 transitions. [2021-12-17 22:19:37,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 179 transitions, 713 flow [2021-12-17 22:19:37,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 179 transitions, 685 flow, removed 11 selfloop flow, removed 11 redundant places. [2021-12-17 22:19:37,745 INFO L242 Difference]: Finished difference. Result has 128 places, 120 transitions, 393 flow [2021-12-17 22:19:37,746 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=393, PETRI_PLACES=128, PETRI_TRANSITIONS=120} [2021-12-17 22:19:37,746 INFO L334 CegarLoopForPetriNet]: 124 programPoint places, 4 predicate places. [2021-12-17 22:19:37,746 INFO L470 AbstractCegarLoop]: Abstraction has has 128 places, 120 transitions, 393 flow [2021-12-17 22:19:37,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.83333333333333) internal successors, (581), 6 states have internal predecessors, (581), 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-17 22:19:37,747 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:19:37,747 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] [2021-12-17 22:19:37,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-17 22:19:37,747 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-17 22:19:37,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:19:37,748 INFO L85 PathProgramCache]: Analyzing trace with hash 886642944, now seen corresponding path program 1 times [2021-12-17 22:19:37,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:19:37,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481087189] [2021-12-17 22:19:37,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:19:37,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:19:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:19:37,845 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-17 22:19:37,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:19:37,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481087189] [2021-12-17 22:19:37,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481087189] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:19:37,846 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:19:37,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 22:19:37,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872878484] [2021-12-17 22:19:37,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:19:37,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 22:19:37,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:19:37,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 22:19:37,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 22:19:37,847 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 119 [2021-12-17 22:19:37,848 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 120 transitions, 393 flow. Second operand has 7 states, 7 states have (on average 97.0) internal successors, (679), 7 states have internal predecessors, (679), 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-17 22:19:37,848 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:19:37,848 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 119 [2021-12-17 22:19:37,848 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:19:38,640 INFO L129 PetriNetUnfolder]: 2312/4818 cut-off events. [2021-12-17 22:19:38,640 INFO L130 PetriNetUnfolder]: For 6237/7103 co-relation queries the response was YES. [2021-12-17 22:19:38,662 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13778 conditions, 4818 events. 2312/4818 cut-off events. For 6237/7103 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 39748 event pairs, 134 based on Foata normal form. 147/4801 useless extension candidates. Maximal degree in co-relation 13709. Up to 785 conditions per place. [2021-12-17 22:19:38,717 INFO L132 encePairwiseOnDemand]: 109/119 looper letters, 78 selfloop transitions, 32 changer transitions 24/218 dead transitions. [2021-12-17 22:19:38,717 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 218 transitions, 1117 flow [2021-12-17 22:19:38,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 22:19:38,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-17 22:19:38,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1354 transitions. [2021-12-17 22:19:38,720 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8752424046541694 [2021-12-17 22:19:38,720 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1354 transitions. [2021-12-17 22:19:38,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1354 transitions. [2021-12-17 22:19:38,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:19:38,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1354 transitions. [2021-12-17 22:19:38,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 104.15384615384616) internal successors, (1354), 13 states have internal predecessors, (1354), 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-17 22:19:38,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 119.0) internal successors, (1666), 14 states have internal predecessors, (1666), 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-17 22:19:38,725 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 119.0) internal successors, (1666), 14 states have internal predecessors, (1666), 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-17 22:19:38,725 INFO L186 Difference]: Start difference. First operand has 128 places, 120 transitions, 393 flow. Second operand 13 states and 1354 transitions. [2021-12-17 22:19:38,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 218 transitions, 1117 flow [2021-12-17 22:19:38,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 218 transitions, 1115 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-17 22:19:38,747 INFO L242 Difference]: Finished difference. Result has 143 places, 140 transitions, 634 flow [2021-12-17 22:19:38,747 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=634, PETRI_PLACES=143, PETRI_TRANSITIONS=140} [2021-12-17 22:19:38,748 INFO L334 CegarLoopForPetriNet]: 124 programPoint places, 19 predicate places. [2021-12-17 22:19:38,748 INFO L470 AbstractCegarLoop]: Abstraction has has 143 places, 140 transitions, 634 flow [2021-12-17 22:19:38,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.0) internal successors, (679), 7 states have internal predecessors, (679), 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-17 22:19:38,748 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:19:38,749 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-17 22:19:38,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-17 22:19:38,749 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-17 22:19:38,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:19:38,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1457982857, now seen corresponding path program 1 times [2021-12-17 22:19:38,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:19:38,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549505298] [2021-12-17 22:19:38,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:19:38,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:19:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:19:38,852 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-17 22:19:38,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:19:38,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549505298] [2021-12-17 22:19:38,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549505298] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:19:38,853 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:19:38,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 22:19:38,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050603508] [2021-12-17 22:19:38,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:19:38,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 22:19:38,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:19:38,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 22:19:38,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-17 22:19:38,856 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 119 [2021-12-17 22:19:38,856 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 140 transitions, 634 flow. Second operand has 8 states, 8 states have (on average 97.125) internal successors, (777), 8 states have internal predecessors, (777), 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-17 22:19:38,856 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:19:38,857 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 119 [2021-12-17 22:19:38,857 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:19:39,583 INFO L129 PetriNetUnfolder]: 2213/4604 cut-off events. [2021-12-17 22:19:39,583 INFO L130 PetriNetUnfolder]: For 10164/11042 co-relation queries the response was YES. [2021-12-17 22:19:39,597 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14998 conditions, 4604 events. 2213/4604 cut-off events. For 10164/11042 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 38374 event pairs, 134 based on Foata normal form. 104/4544 useless extension candidates. Maximal degree in co-relation 14923. Up to 718 conditions per place. [2021-12-17 22:19:39,608 INFO L132 encePairwiseOnDemand]: 109/119 looper letters, 67 selfloop transitions, 36 changer transitions 30/217 dead transitions. [2021-12-17 22:19:39,608 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 217 transitions, 1262 flow [2021-12-17 22:19:39,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-17 22:19:39,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-17 22:19:39,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1628 transitions. [2021-12-17 22:19:39,611 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8550420168067226 [2021-12-17 22:19:39,611 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1628 transitions. [2021-12-17 22:19:39,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1628 transitions. [2021-12-17 22:19:39,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:19:39,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1628 transitions. [2021-12-17 22:19:39,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 101.75) internal successors, (1628), 16 states have internal predecessors, (1628), 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-17 22:19:39,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 119.0) internal successors, (2023), 17 states have internal predecessors, (2023), 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-17 22:19:39,617 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 119.0) internal successors, (2023), 17 states have internal predecessors, (2023), 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-17 22:19:39,617 INFO L186 Difference]: Start difference. First operand has 143 places, 140 transitions, 634 flow. Second operand 16 states and 1628 transitions. [2021-12-17 22:19:39,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 217 transitions, 1262 flow [2021-12-17 22:19:39,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 217 transitions, 1105 flow, removed 64 selfloop flow, removed 7 redundant places. [2021-12-17 22:19:39,731 INFO L242 Difference]: Finished difference. Result has 158 places, 140 transitions, 627 flow [2021-12-17 22:19:39,731 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=627, PETRI_PLACES=158, PETRI_TRANSITIONS=140} [2021-12-17 22:19:39,732 INFO L334 CegarLoopForPetriNet]: 124 programPoint places, 34 predicate places. [2021-12-17 22:19:39,732 INFO L470 AbstractCegarLoop]: Abstraction has has 158 places, 140 transitions, 627 flow [2021-12-17 22:19:39,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 97.125) internal successors, (777), 8 states have internal predecessors, (777), 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-17 22:19:39,733 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:19:39,733 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] [2021-12-17 22:19:39,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-17 22:19:39,733 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-17 22:19:39,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:19:39,734 INFO L85 PathProgramCache]: Analyzing trace with hash 29550780, now seen corresponding path program 1 times [2021-12-17 22:19:39,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:19:39,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992431379] [2021-12-17 22:19:39,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:19:39,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:19:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:19:39,824 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-17 22:19:39,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:19:39,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992431379] [2021-12-17 22:19:39,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992431379] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:19:39,824 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:19:39,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 22:19:39,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102397700] [2021-12-17 22:19:39,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:19:39,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 22:19:39,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:19:39,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 22:19:39,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 22:19:39,825 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 119 [2021-12-17 22:19:39,826 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 140 transitions, 627 flow. Second operand has 7 states, 7 states have (on average 97.71428571428571) internal successors, (684), 7 states have internal predecessors, (684), 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-17 22:19:39,826 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:19:39,826 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 119 [2021-12-17 22:19:39,826 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:19:40,162 INFO L129 PetriNetUnfolder]: 647/2929 cut-off events. [2021-12-17 22:19:40,163 INFO L130 PetriNetUnfolder]: For 5183/5280 co-relation queries the response was YES. [2021-12-17 22:19:40,178 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8129 conditions, 2929 events. 647/2929 cut-off events. For 5183/5280 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 32801 event pairs, 40 based on Foata normal form. 1/2743 useless extension candidates. Maximal degree in co-relation 8048. Up to 296 conditions per place. [2021-12-17 22:19:40,183 INFO L132 encePairwiseOnDemand]: 113/119 looper letters, 25 selfloop transitions, 1 changer transitions 14/158 dead transitions. [2021-12-17 22:19:40,183 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 158 transitions, 775 flow [2021-12-17 22:19:40,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 22:19:40,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-17 22:19:40,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 701 transitions. [2021-12-17 22:19:40,185 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8415366146458584 [2021-12-17 22:19:40,185 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 701 transitions. [2021-12-17 22:19:40,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 701 transitions. [2021-12-17 22:19:40,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:19:40,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 701 transitions. [2021-12-17 22:19:40,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.14285714285714) internal successors, (701), 7 states have internal predecessors, (701), 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-17 22:19:40,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 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-17 22:19:40,188 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 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-17 22:19:40,188 INFO L186 Difference]: Start difference. First operand has 158 places, 140 transitions, 627 flow. Second operand 7 states and 701 transitions. [2021-12-17 22:19:40,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 158 transitions, 775 flow [2021-12-17 22:19:40,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 158 transitions, 682 flow, removed 22 selfloop flow, removed 14 redundant places. [2021-12-17 22:19:40,246 INFO L242 Difference]: Finished difference. Result has 152 places, 139 transitions, 563 flow [2021-12-17 22:19:40,246 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=563, PETRI_PLACES=152, PETRI_TRANSITIONS=139} [2021-12-17 22:19:40,247 INFO L334 CegarLoopForPetriNet]: 124 programPoint places, 28 predicate places. [2021-12-17 22:19:40,247 INFO L470 AbstractCegarLoop]: Abstraction has has 152 places, 139 transitions, 563 flow [2021-12-17 22:19:40,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.71428571428571) internal successors, (684), 7 states have internal predecessors, (684), 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-17 22:19:40,248 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:19:40,248 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] [2021-12-17 22:19:40,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-17 22:19:40,248 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-17 22:19:40,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:19:40,248 INFO L85 PathProgramCache]: Analyzing trace with hash 2020967260, now seen corresponding path program 2 times [2021-12-17 22:19:40,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:19:40,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229005078] [2021-12-17 22:19:40,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:19:40,249 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:19:40,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:19:40,421 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-17 22:19:40,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:19:40,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229005078] [2021-12-17 22:19:40,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229005078] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:19:40,422 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:19:40,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 22:19:40,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954020671] [2021-12-17 22:19:40,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:19:40,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 22:19:40,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:19:40,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 22:19:40,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 22:19:40,423 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 119 [2021-12-17 22:19:40,424 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 139 transitions, 563 flow. Second operand has 8 states, 8 states have (on average 90.375) internal successors, (723), 8 states have internal predecessors, (723), 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-17 22:19:40,424 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:19:40,424 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 119 [2021-12-17 22:19:40,424 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:19:40,800 INFO L129 PetriNetUnfolder]: 459/2020 cut-off events. [2021-12-17 22:19:40,801 INFO L130 PetriNetUnfolder]: For 2247/2310 co-relation queries the response was YES. [2021-12-17 22:19:40,809 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5267 conditions, 2020 events. 459/2020 cut-off events. For 2247/2310 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 21128 event pairs, 3 based on Foata normal form. 1/1920 useless extension candidates. Maximal degree in co-relation 5243. Up to 202 conditions per place. [2021-12-17 22:19:40,813 INFO L132 encePairwiseOnDemand]: 103/119 looper letters, 39 selfloop transitions, 29 changer transitions 5/181 dead transitions. [2021-12-17 22:19:40,813 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 181 transitions, 849 flow [2021-12-17 22:19:40,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 22:19:40,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-17 22:19:40,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 944 transitions. [2021-12-17 22:19:40,815 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7932773109243697 [2021-12-17 22:19:40,815 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 944 transitions. [2021-12-17 22:19:40,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 944 transitions. [2021-12-17 22:19:40,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:19:40,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 944 transitions. [2021-12-17 22:19:40,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 94.4) internal successors, (944), 10 states have internal predecessors, (944), 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-17 22:19:40,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 119.0) internal successors, (1309), 11 states have internal predecessors, (1309), 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-17 22:19:40,819 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 119.0) internal successors, (1309), 11 states have internal predecessors, (1309), 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-17 22:19:40,819 INFO L186 Difference]: Start difference. First operand has 152 places, 139 transitions, 563 flow. Second operand 10 states and 944 transitions. [2021-12-17 22:19:40,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 181 transitions, 849 flow [2021-12-17 22:19:40,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 181 transitions, 834 flow, removed 7 selfloop flow, removed 5 redundant places. [2021-12-17 22:19:40,843 INFO L242 Difference]: Finished difference. Result has 158 places, 164 transitions, 744 flow [2021-12-17 22:19:40,843 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=744, PETRI_PLACES=158, PETRI_TRANSITIONS=164} [2021-12-17 22:19:40,844 INFO L334 CegarLoopForPetriNet]: 124 programPoint places, 34 predicate places. [2021-12-17 22:19:40,844 INFO L470 AbstractCegarLoop]: Abstraction has has 158 places, 164 transitions, 744 flow [2021-12-17 22:19:40,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.375) internal successors, (723), 8 states have internal predecessors, (723), 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-17 22:19:40,844 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:19:40,845 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] [2021-12-17 22:19:40,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-17 22:19:40,845 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-17 22:19:40,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:19:40,845 INFO L85 PathProgramCache]: Analyzing trace with hash 659644810, now seen corresponding path program 3 times [2021-12-17 22:19:40,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:19:40,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73655818] [2021-12-17 22:19:40,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:19:40,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:19:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:19:41,066 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-17 22:19:41,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:19:41,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73655818] [2021-12-17 22:19:41,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73655818] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:19:41,067 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:19:41,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-17 22:19:41,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621558390] [2021-12-17 22:19:41,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:19:41,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 22:19:41,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:19:41,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 22:19:41,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-12-17 22:19:41,069 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 119 [2021-12-17 22:19:41,069 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 164 transitions, 744 flow. Second operand has 11 states, 11 states have (on average 87.63636363636364) internal successors, (964), 11 states have internal predecessors, (964), 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-17 22:19:41,069 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:19:41,070 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 119 [2021-12-17 22:19:41,070 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:19:41,543 INFO L129 PetriNetUnfolder]: 599/2679 cut-off events. [2021-12-17 22:19:41,543 INFO L130 PetriNetUnfolder]: For 3337/3427 co-relation queries the response was YES. [2021-12-17 22:19:41,556 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7210 conditions, 2679 events. 599/2679 cut-off events. For 3337/3427 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 29565 event pairs, 5 based on Foata normal form. 10/2548 useless extension candidates. Maximal degree in co-relation 7184. Up to 261 conditions per place. [2021-12-17 22:19:41,559 INFO L132 encePairwiseOnDemand]: 101/119 looper letters, 30 selfloop transitions, 19 changer transitions 46/201 dead transitions. [2021-12-17 22:19:41,559 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 201 transitions, 1110 flow [2021-12-17 22:19:41,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 22:19:41,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-17 22:19:41,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1192 transitions. [2021-12-17 22:19:41,562 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7705235940530059 [2021-12-17 22:19:41,562 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1192 transitions. [2021-12-17 22:19:41,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1192 transitions. [2021-12-17 22:19:41,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:19:41,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1192 transitions. [2021-12-17 22:19:41,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 91.6923076923077) internal successors, (1192), 13 states have internal predecessors, (1192), 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-17 22:19:41,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 119.0) internal successors, (1666), 14 states have internal predecessors, (1666), 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-17 22:19:41,566 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 119.0) internal successors, (1666), 14 states have internal predecessors, (1666), 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-17 22:19:41,566 INFO L186 Difference]: Start difference. First operand has 158 places, 164 transitions, 744 flow. Second operand 13 states and 1192 transitions. [2021-12-17 22:19:41,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 201 transitions, 1110 flow [2021-12-17 22:19:41,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 201 transitions, 1100 flow, removed 5 selfloop flow, removed 3 redundant places. [2021-12-17 22:19:41,609 INFO L242 Difference]: Finished difference. Result has 169 places, 147 transitions, 697 flow [2021-12-17 22:19:41,610 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=697, PETRI_PLACES=169, PETRI_TRANSITIONS=147} [2021-12-17 22:19:41,610 INFO L334 CegarLoopForPetriNet]: 124 programPoint places, 45 predicate places. [2021-12-17 22:19:41,610 INFO L470 AbstractCegarLoop]: Abstraction has has 169 places, 147 transitions, 697 flow [2021-12-17 22:19:41,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 87.63636363636364) internal successors, (964), 11 states have internal predecessors, (964), 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-17 22:19:41,611 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:19:41,611 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] [2021-12-17 22:19:41,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-17 22:19:41,611 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-17 22:19:41,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:19:41,611 INFO L85 PathProgramCache]: Analyzing trace with hash -288823046, now seen corresponding path program 4 times [2021-12-17 22:19:41,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:19:41,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67504707] [2021-12-17 22:19:41,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:19:41,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:19:41,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:19:41,814 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-17 22:19:41,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:19:41,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67504707] [2021-12-17 22:19:41,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67504707] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:19:41,816 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:19:41,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-17 22:19:41,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084925298] [2021-12-17 22:19:41,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:19:41,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 22:19:41,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:19:41,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 22:19:41,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-17 22:19:41,819 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 119 [2021-12-17 22:19:41,820 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 147 transitions, 697 flow. Second operand has 11 states, 11 states have (on average 93.0909090909091) internal successors, (1024), 11 states have internal predecessors, (1024), 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-17 22:19:41,820 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:19:41,820 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 119 [2021-12-17 22:19:41,820 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:19:42,142 INFO L129 PetriNetUnfolder]: 331/1557 cut-off events. [2021-12-17 22:19:42,142 INFO L130 PetriNetUnfolder]: For 2070/2089 co-relation queries the response was YES. [2021-12-17 22:19:42,149 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4282 conditions, 1557 events. 331/1557 cut-off events. For 2070/2089 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 15307 event pairs, 1 based on Foata normal form. 4/1493 useless extension candidates. Maximal degree in co-relation 4253. Up to 158 conditions per place. [2021-12-17 22:19:42,151 INFO L132 encePairwiseOnDemand]: 108/119 looper letters, 30 selfloop transitions, 9 changer transitions 6/163 dead transitions. [2021-12-17 22:19:42,151 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 163 transitions, 862 flow [2021-12-17 22:19:42,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 22:19:42,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-17 22:19:42,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1040 transitions. [2021-12-17 22:19:42,154 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7944996180290298 [2021-12-17 22:19:42,154 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1040 transitions. [2021-12-17 22:19:42,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1040 transitions. [2021-12-17 22:19:42,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:19:42,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1040 transitions. [2021-12-17 22:19:42,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 94.54545454545455) internal successors, (1040), 11 states have internal predecessors, (1040), 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-17 22:19:42,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 119.0) internal successors, (1428), 12 states have internal predecessors, (1428), 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-17 22:19:42,158 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 119.0) internal successors, (1428), 12 states have internal predecessors, (1428), 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-17 22:19:42,159 INFO L186 Difference]: Start difference. First operand has 169 places, 147 transitions, 697 flow. Second operand 11 states and 1040 transitions. [2021-12-17 22:19:42,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 163 transitions, 862 flow [2021-12-17 22:19:42,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 163 transitions, 779 flow, removed 12 selfloop flow, removed 12 redundant places. [2021-12-17 22:19:42,179 INFO L242 Difference]: Finished difference. Result has 166 places, 151 transitions, 690 flow [2021-12-17 22:19:42,179 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=690, PETRI_PLACES=166, PETRI_TRANSITIONS=151} [2021-12-17 22:19:42,180 INFO L334 CegarLoopForPetriNet]: 124 programPoint places, 42 predicate places. [2021-12-17 22:19:42,180 INFO L470 AbstractCegarLoop]: Abstraction has has 166 places, 151 transitions, 690 flow [2021-12-17 22:19:42,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 93.0909090909091) internal successors, (1024), 11 states have internal predecessors, (1024), 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-17 22:19:42,180 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:19:42,181 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] [2021-12-17 22:19:42,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-17 22:19:42,181 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-17 22:19:42,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:19:42,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1373091268, now seen corresponding path program 5 times [2021-12-17 22:19:42,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:19:42,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447082093] [2021-12-17 22:19:42,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:19:42,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:19:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:19:42,278 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-17 22:19:42,278 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:19:42,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447082093] [2021-12-17 22:19:42,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447082093] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:19:42,278 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:19:42,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 22:19:42,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518797503] [2021-12-17 22:19:42,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:19:42,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 22:19:42,279 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:19:42,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 22:19:42,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 22:19:42,280 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 119 [2021-12-17 22:19:42,280 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 151 transitions, 690 flow. Second operand has 7 states, 7 states have (on average 94.28571428571429) internal successors, (660), 7 states have internal predecessors, (660), 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-17 22:19:42,280 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:19:42,281 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 119 [2021-12-17 22:19:42,281 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:19:42,545 INFO L129 PetriNetUnfolder]: 491/2160 cut-off events. [2021-12-17 22:19:42,545 INFO L130 PetriNetUnfolder]: For 3052/3092 co-relation queries the response was YES. [2021-12-17 22:19:42,554 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6036 conditions, 2160 events. 491/2160 cut-off events. For 3052/3092 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 23174 event pairs, 10 based on Foata normal form. 1/2057 useless extension candidates. Maximal degree in co-relation 6007. Up to 245 conditions per place. [2021-12-17 22:19:42,556 INFO L132 encePairwiseOnDemand]: 109/119 looper letters, 27 selfloop transitions, 7 changer transitions 25/169 dead transitions. [2021-12-17 22:19:42,556 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 169 transitions, 906 flow [2021-12-17 22:19:42,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 22:19:42,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-17 22:19:42,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 678 transitions. [2021-12-17 22:19:42,558 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8139255702280912 [2021-12-17 22:19:42,558 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 678 transitions. [2021-12-17 22:19:42,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 678 transitions. [2021-12-17 22:19:42,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:19:42,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 678 transitions. [2021-12-17 22:19:42,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.85714285714286) internal successors, (678), 7 states have internal predecessors, (678), 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-17 22:19:42,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 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-17 22:19:42,561 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 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-17 22:19:42,561 INFO L186 Difference]: Start difference. First operand has 166 places, 151 transitions, 690 flow. Second operand 7 states and 678 transitions. [2021-12-17 22:19:42,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 169 transitions, 906 flow [2021-12-17 22:19:42,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 169 transitions, 878 flow, removed 7 selfloop flow, removed 8 redundant places. [2021-12-17 22:19:42,599 INFO L242 Difference]: Finished difference. Result has 164 places, 140 transitions, 627 flow [2021-12-17 22:19:42,600 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=627, PETRI_PLACES=164, PETRI_TRANSITIONS=140} [2021-12-17 22:19:42,600 INFO L334 CegarLoopForPetriNet]: 124 programPoint places, 40 predicate places. [2021-12-17 22:19:42,600 INFO L470 AbstractCegarLoop]: Abstraction has has 164 places, 140 transitions, 627 flow [2021-12-17 22:19:42,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.28571428571429) internal successors, (660), 7 states have internal predecessors, (660), 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-17 22:19:42,601 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:19:42,601 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] [2021-12-17 22:19:42,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-17 22:19:42,601 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-17 22:19:42,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:19:42,601 INFO L85 PathProgramCache]: Analyzing trace with hash -985418476, now seen corresponding path program 6 times [2021-12-17 22:19:42,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:19:42,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409471930] [2021-12-17 22:19:42,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:19:42,602 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:19:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 22:19:42,636 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-17 22:19:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 22:19:42,690 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-17 22:19:42,690 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-17 22:19:42,691 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2021-12-17 22:19:42,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2021-12-17 22:19:42,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2021-12-17 22:19:42,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2021-12-17 22:19:42,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2021-12-17 22:19:42,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2021-12-17 22:19:42,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-17 22:19:42,694 INFO L732 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1] [2021-12-17 22:19:42,697 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-17 22:19:42,698 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 22:19:42,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 10:19:42 BasicIcfg [2021-12-17 22:19:42,792 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 22:19:42,793 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 22:19:42,793 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 22:19:42,793 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 22:19:42,793 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:19:34" (3/4) ... [2021-12-17 22:19:42,794 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-17 22:19:42,876 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 22:19:42,876 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 22:19:42,876 INFO L158 Benchmark]: Toolchain (without parser) took 9675.76ms. Allocated memory was 81.8MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 45.5MB in the beginning and 914.2MB in the end (delta: -868.7MB). Peak memory consumption was 458.6MB. Max. memory is 16.1GB. [2021-12-17 22:19:42,876 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 81.8MB. Free memory was 63.8MB in the beginning and 63.7MB in the end (delta: 75.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 22:19:42,876 INFO L158 Benchmark]: CACSL2BoogieTranslator took 502.58ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 45.3MB in the beginning and 61.3MB in the end (delta: -16.0MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2021-12-17 22:19:42,877 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.13ms. Allocated memory is still 98.6MB. Free memory was 61.3MB in the beginning and 58.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 22:19:42,877 INFO L158 Benchmark]: Boogie Preprocessor took 47.76ms. Allocated memory is still 98.6MB. Free memory was 58.6MB in the beginning and 56.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 22:19:42,877 INFO L158 Benchmark]: RCFGBuilder took 719.79ms. Allocated memory is still 98.6MB. Free memory was 56.5MB in the beginning and 56.8MB in the end (delta: -325.7kB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2021-12-17 22:19:42,877 INFO L158 Benchmark]: TraceAbstraction took 8259.40ms. Allocated memory was 98.6MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 56.8MB in the beginning and 954.1MB in the end (delta: -897.3MB). Peak memory consumption was 411.9MB. Max. memory is 16.1GB. [2021-12-17 22:19:42,877 INFO L158 Benchmark]: Witness Printer took 83.17ms. Allocated memory is still 1.4GB. Free memory was 954.1MB in the beginning and 914.2MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2021-12-17 22:19:42,879 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.16ms. Allocated memory is still 81.8MB. Free memory was 63.8MB in the beginning and 63.7MB in the end (delta: 75.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 502.58ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 45.3MB in the beginning and 61.3MB in the end (delta: -16.0MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.13ms. Allocated memory is still 98.6MB. Free memory was 61.3MB in the beginning and 58.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.76ms. Allocated memory is still 98.6MB. Free memory was 58.6MB in the beginning and 56.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 719.79ms. Allocated memory is still 98.6MB. Free memory was 56.5MB in the beginning and 56.8MB in the end (delta: -325.7kB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8259.40ms. Allocated memory was 98.6MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 56.8MB in the beginning and 954.1MB in the end (delta: -897.3MB). Peak memory consumption was 411.9MB. Max. memory is 16.1GB. * Witness Printer took 83.17ms. Allocated memory is still 1.4GB. Free memory was 954.1MB in the beginning and 914.2MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. 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: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L715] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L717] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L718] 0 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0] [L719] 0 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L720] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L721] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L722] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L723] 0 _Bool a$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0] [L724] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0] [L725] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L726] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L727] 0 _Bool a$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0] [L728] 0 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0] [L729] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L730] 0 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L731] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L732] 0 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L733] 0 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L734] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L735] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L737] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L739] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L741] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L742] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L743] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L843] 0 pthread_t t1105; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t1105={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t1105, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1105, ((void *)0), P0, ((void *)0))=-2, t1105={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L845] 0 pthread_t t1106; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t1105={5:0}, t1106={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L846] FCALL, FORK 0 pthread_create(&t1106, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1106, ((void *)0), P1, ((void *)0))=-1, t1105={5:0}, t1106={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L847] 0 pthread_t t1107; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1105={5:0}, t1106={6:0}, t1107={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L848] FCALL, FORK 0 pthread_create(&t1107, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1107, ((void *)0), P2, ((void *)0))=0, t1105={5:0}, t1106={6:0}, t1107={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L747] 1 a$w_buff1 = a$w_buff0 [L748] 1 a$w_buff0 = 1 [L749] 1 a$w_buff1_used = a$w_buff0_used [L750] 1 a$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L752] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L753] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L754] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L755] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, y=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, y=0, z=0] [L776] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L779] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L782] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L782] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L782] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L782] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L783] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L784] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L785] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L786] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L796] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, y=2, z=0] [L799] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, y=2, z=1] [L802] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, y=2, z=1] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 a$flush_delayed = weak$$choice2 [L808] 3 a$mem_tmp = a [L809] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L809] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L810] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L810] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0) [L810] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L810] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L811] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L811] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1) [L811] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L811] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L812] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L812] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used) [L812] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L812] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L813] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L813] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L814] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3) [L814] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L814] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L815] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L815] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = a [L817] EXPR 3 a$flush_delayed ? a$mem_tmp : a [L817] 3 a = a$flush_delayed ? a$mem_tmp : a [L818] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1] [L821] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L821] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L821] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L821] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L822] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L822] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L823] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L823] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L824] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L824] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L825] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L825] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L762] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L762] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L763] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L764] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L765] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L766] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=49, weak$$choice2=0, x=1, y=2, z=1] [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1] [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1105={5:0}, t1106={6:0}, t1107={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1] [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=49, weak$$choice2=0, x=1, y=2, z=1] [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L854] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L854] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L854] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L855] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L855] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L856] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L856] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L857] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L857] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L858] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L858] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L861] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1105={5:0}, t1106={6:0}, t1107={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1] [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=0, x=1, y=2, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=0, x=1, y=2, 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: 844]: 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: 846]: 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: 848]: 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 7 procedures, 148 locations, 6 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: 8.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 587 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 587 mSDsluCounter, 740 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1200 mSDsCounter, 141 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1519 IncrementalHoareTripleChecker+Invalid, 1660 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 141 mSolverCounterUnsat, 145 mSDtfsCounter, 1519 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 139 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=744occurred in iteration=8, InterpolantAutomatonStates: 108, 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.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1010 NumberOfCodeBlocks, 1010 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 906 ConstructedInterpolants, 0 QuantifiedInterpolants, 4298 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-17 22:19:42,921 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