./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2bbc774c97831725ad05d6c2dc910981cb4ce0a2559ec0561efc45418b96b7a4 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 10:09:22,920 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 10:09:22,931 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 10:09:22,972 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 10:09:22,972 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 10:09:22,973 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 10:09:22,974 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 10:09:22,976 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 10:09:22,977 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 10:09:22,978 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 10:09:22,978 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 10:09:22,979 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 10:09:22,979 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 10:09:22,980 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 10:09:22,981 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 10:09:22,981 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 10:09:22,982 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 10:09:22,983 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 10:09:22,984 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 10:09:22,985 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 10:09:22,986 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 10:09:23,000 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 10:09:23,001 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 10:09:23,001 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 10:09:23,002 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 10:09:23,004 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 10:09:23,004 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 10:09:23,004 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 10:09:23,005 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 10:09:23,005 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 10:09:23,006 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 10:09:23,006 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 10:09:23,007 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 10:09:23,007 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 10:09:23,008 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 10:09:23,008 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 10:09:23,008 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 10:09:23,009 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 10:09:23,009 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 10:09:23,009 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 10:09:23,010 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 10:09:23,011 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 10:09:23,011 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 10:09:23,029 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 10:09:23,032 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 10:09:23,032 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 10:09:23,032 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 10:09:23,033 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 10:09:23,033 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 10:09:23,034 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 10:09:23,034 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 10:09:23,034 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 10:09:23,035 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 10:09:23,035 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 10:09:23,035 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 10:09:23,035 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 10:09:23,035 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 10:09:23,035 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 10:09:23,035 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 10:09:23,036 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 10:09:23,036 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 10:09:23,036 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 10:09:23,036 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 10:09:23,036 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 10:09:23,036 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 10:09:23,037 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 10:09:23,037 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 10:09:23,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:09:23,037 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 10:09:23,037 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 10:09:23,037 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 10:09:23,037 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 10:09:23,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 10:09:23,038 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 10:09:23,038 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 10:09:23,038 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 10:09:23,038 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 -> 2bbc774c97831725ad05d6c2dc910981cb4ce0a2559ec0561efc45418b96b7a4 [2022-07-12 10:09:23,380 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 10:09:23,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 10:09:23,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 10:09:23,414 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 10:09:23,419 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 10:09:23,420 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-07-12 10:09:23,494 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d316f185/ba38bafe84f443ee810ed05ad0432bd1/FLAG89e1796fe [2022-07-12 10:09:24,062 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 10:09:24,062 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-07-12 10:09:24,120 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d316f185/ba38bafe84f443ee810ed05ad0432bd1/FLAG89e1796fe [2022-07-12 10:09:24,442 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d316f185/ba38bafe84f443ee810ed05ad0432bd1 [2022-07-12 10:09:24,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 10:09:24,445 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 10:09:24,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 10:09:24,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 10:09:24,450 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 10:09:24,450 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:09:24" (1/1) ... [2022-07-12 10:09:24,451 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7773068a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:24, skipping insertion in model container [2022-07-12 10:09:24,451 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:09:24" (1/1) ... [2022-07-12 10:09:24,460 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 10:09:24,496 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 10:09:24,617 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/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2022-07-12 10:09:24,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:09:24,750 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 10:09:24,757 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/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2022-07-12 10:09:24,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:09:24,807 INFO L208 MainTranslator]: Completed translation [2022-07-12 10:09:24,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:24 WrapperNode [2022-07-12 10:09:24,807 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 10:09:24,808 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 10:09:24,808 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 10:09:24,808 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 10:09:24,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:24" (1/1) ... [2022-07-12 10:09:24,846 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:24" (1/1) ... [2022-07-12 10:09:24,897 INFO L137 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 274 [2022-07-12 10:09:24,911 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 10:09:24,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 10:09:24,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 10:09:24,913 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 10:09:24,919 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:24" (1/1) ... [2022-07-12 10:09:24,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:24" (1/1) ... [2022-07-12 10:09:24,936 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:24" (1/1) ... [2022-07-12 10:09:24,939 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:24" (1/1) ... [2022-07-12 10:09:24,945 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:24" (1/1) ... [2022-07-12 10:09:24,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:24" (1/1) ... [2022-07-12 10:09:24,966 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:24" (1/1) ... [2022-07-12 10:09:24,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 10:09:24,981 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 10:09:24,981 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 10:09:24,982 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 10:09:24,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:24" (1/1) ... [2022-07-12 10:09:25,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:09:25,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:09:25,057 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) [2022-07-12 10:09:25,095 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 [2022-07-12 10:09:25,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 10:09:25,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-12 10:09:25,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 10:09:25,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 10:09:25,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 10:09:25,122 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-12 10:09:25,122 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-12 10:09:25,123 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-12 10:09:25,123 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-12 10:09:25,123 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-07-12 10:09:25,123 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-07-12 10:09:25,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 10:09:25,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-12 10:09:25,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 10:09:25,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 10:09:25,124 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-12 10:09:25,324 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 10:09:25,325 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 10:09:25,701 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 10:09:25,965 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 10:09:25,966 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 10:09:25,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:09:25 BoogieIcfgContainer [2022-07-12 10:09:25,968 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 10:09:25,970 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 10:09:25,970 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 10:09:25,973 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 10:09:25,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 10:09:24" (1/3) ... [2022-07-12 10:09:25,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354eebe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:09:25, skipping insertion in model container [2022-07-12 10:09:25,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:24" (2/3) ... [2022-07-12 10:09:25,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354eebe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:09:25, skipping insertion in model container [2022-07-12 10:09:25,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:09:25" (3/3) ... [2022-07-12 10:09:25,975 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-07-12 10:09:25,978 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-12 10:09:25,984 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 10:09:25,985 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-12 10:09:25,985 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-12 10:09:26,032 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-12 10:09:26,072 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2022-07-12 10:09:26,128 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2022-07-12 10:09:26,128 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-12 10:09:26,133 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-07-12 10:09:26,133 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2022-07-12 10:09:26,136 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2022-07-12 10:09:26,142 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:09:26,150 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2a70abc6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@79aed6c3 [2022-07-12 10:09:26,152 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-07-12 10:09:26,166 INFO L129 PetriNetUnfolder]: 0/45 cut-off events. [2022-07-12 10:09:26,169 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-12 10:09:26,169 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:26,170 INFO L200 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] [2022-07-12 10:09:26,170 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:26,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:26,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1654950207, now seen corresponding path program 1 times [2022-07-12 10:09:26,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:26,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792180798] [2022-07-12 10:09:26,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:26,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:26,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:09:26,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:26,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792180798] [2022-07-12 10:09:26,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792180798] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:26,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:26,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 10:09:26,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285532526] [2022-07-12 10:09:26,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:26,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:09:26,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:26,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:09:26,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:09:26,431 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 114 [2022-07-12 10:09:26,434 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 111 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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) [2022-07-12 10:09:26,434 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:26,434 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 114 [2022-07-12 10:09:26,435 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:26,515 INFO L129 PetriNetUnfolder]: 58/326 cut-off events. [2022-07-12 10:09:26,515 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-07-12 10:09:26,517 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 20. Compared 1339 event pairs, 10 based on Foata normal form. 12/321 useless extension candidates. Maximal degree in co-relation 404. Up to 79 conditions per place. [2022-07-12 10:09:26,521 INFO L132 encePairwiseOnDemand]: 109/114 looper letters, 14 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2022-07-12 10:09:26,521 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 113 transitions, 273 flow [2022-07-12 10:09:26,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:09:26,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 10:09:26,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-07-12 10:09:26,538 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9385964912280702 [2022-07-12 10:09:26,538 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2022-07-12 10:09:26,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2022-07-12 10:09:26,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:26,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2022-07-12 10:09:26,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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) [2022-07-12 10:09:26,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 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) [2022-07-12 10:09:26,555 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 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) [2022-07-12 10:09:26,556 INFO L186 Difference]: Start difference. First operand has 119 places, 111 transitions, 231 flow. Second operand 3 states and 321 transitions. [2022-07-12 10:09:26,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 113 transitions, 273 flow [2022-07-12 10:09:26,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 113 transitions, 268 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-12 10:09:26,562 INFO L242 Difference]: Finished difference. Result has 116 places, 107 transitions, 224 flow [2022-07-12 10:09:26,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=116, PETRI_TRANSITIONS=107} [2022-07-12 10:09:26,566 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, -3 predicate places. [2022-07-12 10:09:26,583 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 107 transitions, 224 flow [2022-07-12 10:09:26,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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) [2022-07-12 10:09:26,583 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:26,583 INFO L200 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] [2022-07-12 10:09:26,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 10:09:26,584 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:26,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:26,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1969702196, now seen corresponding path program 1 times [2022-07-12 10:09:26,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:26,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54461530] [2022-07-12 10:09:26,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:26,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:26,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:09:26,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:26,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54461530] [2022-07-12 10:09:26,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54461530] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:26,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:26,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:09:26,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911673449] [2022-07-12 10:09:26,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:26,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:09:26,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:26,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:09:26,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:09:26,744 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 114 [2022-07-12 10:09:26,745 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 107 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 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) [2022-07-12 10:09:26,745 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:26,745 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 114 [2022-07-12 10:09:26,745 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:27,003 INFO L129 PetriNetUnfolder]: 331/1079 cut-off events. [2022-07-12 10:09:27,003 INFO L130 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2022-07-12 10:09:27,006 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1712 conditions, 1079 events. 331/1079 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7268 event pairs, 54 based on Foata normal form. 0/1046 useless extension candidates. Maximal degree in co-relation 1661. Up to 257 conditions per place. [2022-07-12 10:09:27,008 INFO L132 encePairwiseOnDemand]: 108/114 looper letters, 18 selfloop transitions, 2 changer transitions 45/144 dead transitions. [2022-07-12 10:09:27,009 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 144 transitions, 420 flow [2022-07-12 10:09:27,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:09:27,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-12 10:09:27,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 893 transitions. [2022-07-12 10:09:27,011 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8703703703703703 [2022-07-12 10:09:27,011 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 893 transitions. [2022-07-12 10:09:27,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 893 transitions. [2022-07-12 10:09:27,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:27,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 893 transitions. [2022-07-12 10:09:27,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 99.22222222222223) internal successors, (893), 9 states have internal predecessors, (893), 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) [2022-07-12 10:09:27,017 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 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) [2022-07-12 10:09:27,017 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 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) [2022-07-12 10:09:27,017 INFO L186 Difference]: Start difference. First operand has 116 places, 107 transitions, 224 flow. Second operand 9 states and 893 transitions. [2022-07-12 10:09:27,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 144 transitions, 420 flow [2022-07-12 10:09:27,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 144 transitions, 402 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-12 10:09:27,021 INFO L242 Difference]: Finished difference. Result has 129 places, 95 transitions, 216 flow [2022-07-12 10:09:27,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=216, PETRI_PLACES=129, PETRI_TRANSITIONS=95} [2022-07-12 10:09:27,023 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 10 predicate places. [2022-07-12 10:09:27,023 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 95 transitions, 216 flow [2022-07-12 10:09:27,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 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) [2022-07-12 10:09:27,023 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:27,023 INFO L200 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] [2022-07-12 10:09:27,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 10:09:27,024 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:27,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:27,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1559926167, now seen corresponding path program 1 times [2022-07-12 10:09:27,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:27,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748249082] [2022-07-12 10:09:27,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:27,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:27,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:27,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:09:27,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:27,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748249082] [2022-07-12 10:09:27,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748249082] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:27,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:27,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:09:27,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486600095] [2022-07-12 10:09:27,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:27,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:09:27,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:27,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:09:27,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:09:27,188 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 114 [2022-07-12 10:09:27,189 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 95 transitions, 216 flow. Second operand has 7 states, 7 states have (on average 92.85714285714286) internal successors, (650), 7 states have internal predecessors, (650), 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) [2022-07-12 10:09:27,190 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:27,190 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 114 [2022-07-12 10:09:27,190 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:27,480 INFO L129 PetriNetUnfolder]: 356/838 cut-off events. [2022-07-12 10:09:27,481 INFO L130 PetriNetUnfolder]: For 192/192 co-relation queries the response was YES. [2022-07-12 10:09:27,483 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1666 conditions, 838 events. 356/838 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4677 event pairs, 50 based on Foata normal form. 18/819 useless extension candidates. Maximal degree in co-relation 1607. Up to 225 conditions per place. [2022-07-12 10:09:27,486 INFO L132 encePairwiseOnDemand]: 106/114 looper letters, 22 selfloop transitions, 4 changer transitions 35/138 dead transitions. [2022-07-12 10:09:27,486 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 138 transitions, 449 flow [2022-07-12 10:09:27,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 10:09:27,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-12 10:09:27,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 973 transitions. [2022-07-12 10:09:27,489 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8535087719298246 [2022-07-12 10:09:27,489 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 973 transitions. [2022-07-12 10:09:27,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 973 transitions. [2022-07-12 10:09:27,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:27,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 973 transitions. [2022-07-12 10:09:27,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.3) internal successors, (973), 10 states have internal predecessors, (973), 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) [2022-07-12 10:09:27,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 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) [2022-07-12 10:09:27,495 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 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) [2022-07-12 10:09:27,495 INFO L186 Difference]: Start difference. First operand has 129 places, 95 transitions, 216 flow. Second operand 10 states and 973 transitions. [2022-07-12 10:09:27,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 138 transitions, 449 flow [2022-07-12 10:09:27,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 138 transitions, 415 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-07-12 10:09:27,503 INFO L242 Difference]: Finished difference. Result has 120 places, 95 transitions, 230 flow [2022-07-12 10:09:27,503 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=230, PETRI_PLACES=120, PETRI_TRANSITIONS=95} [2022-07-12 10:09:27,505 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 1 predicate places. [2022-07-12 10:09:27,505 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 95 transitions, 230 flow [2022-07-12 10:09:27,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.85714285714286) internal successors, (650), 7 states have internal predecessors, (650), 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) [2022-07-12 10:09:27,505 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:27,506 INFO L200 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] [2022-07-12 10:09:27,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 10:09:27,506 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:27,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:27,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1076595015, now seen corresponding path program 1 times [2022-07-12 10:09:27,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:27,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6771043] [2022-07-12 10:09:27,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:27,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:27,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:09:27,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:27,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6771043] [2022-07-12 10:09:27,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6771043] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:27,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:27,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 10:09:27,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294966762] [2022-07-12 10:09:27,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:27,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 10:09:27,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:27,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 10:09:27,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-12 10:09:27,762 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-07-12 10:09:27,763 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 95 transitions, 230 flow. Second operand has 10 states, 10 states have (on average 91.4) internal successors, (914), 10 states have internal predecessors, (914), 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) [2022-07-12 10:09:27,764 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:27,764 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-07-12 10:09:27,764 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:28,111 INFO L129 PetriNetUnfolder]: 309/769 cut-off events. [2022-07-12 10:09:28,112 INFO L130 PetriNetUnfolder]: For 264/267 co-relation queries the response was YES. [2022-07-12 10:09:28,113 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1558 conditions, 769 events. 309/769 cut-off events. For 264/267 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3889 event pairs, 85 based on Foata normal form. 18/769 useless extension candidates. Maximal degree in co-relation 1493. Up to 309 conditions per place. [2022-07-12 10:09:28,116 INFO L132 encePairwiseOnDemand]: 102/114 looper letters, 21 selfloop transitions, 10 changer transitions 44/151 dead transitions. [2022-07-12 10:09:28,116 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 151 transitions, 536 flow [2022-07-12 10:09:28,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 10:09:28,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-07-12 10:09:28,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1428 transitions. [2022-07-12 10:09:28,119 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8350877192982457 [2022-07-12 10:09:28,119 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1428 transitions. [2022-07-12 10:09:28,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1428 transitions. [2022-07-12 10:09:28,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:28,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1428 transitions. [2022-07-12 10:09:28,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 95.2) internal successors, (1428), 15 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) [2022-07-12 10:09:28,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 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) [2022-07-12 10:09:28,125 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 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) [2022-07-12 10:09:28,125 INFO L186 Difference]: Start difference. First operand has 120 places, 95 transitions, 230 flow. Second operand 15 states and 1428 transitions. [2022-07-12 10:09:28,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 151 transitions, 536 flow [2022-07-12 10:09:28,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 151 transitions, 478 flow, removed 24 selfloop flow, removed 10 redundant places. [2022-07-12 10:09:28,129 INFO L242 Difference]: Finished difference. Result has 129 places, 101 transitions, 288 flow [2022-07-12 10:09:28,130 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=288, PETRI_PLACES=129, PETRI_TRANSITIONS=101} [2022-07-12 10:09:28,130 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 10 predicate places. [2022-07-12 10:09:28,130 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 101 transitions, 288 flow [2022-07-12 10:09:28,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 91.4) internal successors, (914), 10 states have internal predecessors, (914), 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) [2022-07-12 10:09:28,131 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:28,131 INFO L200 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] [2022-07-12 10:09:28,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 10:09:28,132 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:28,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:28,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1269116501, now seen corresponding path program 1 times [2022-07-12 10:09:28,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:28,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144981022] [2022-07-12 10:09:28,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:28,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:28,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:28,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:09:28,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:28,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144981022] [2022-07-12 10:09:28,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144981022] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:28,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:28,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 10:09:28,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813537800] [2022-07-12 10:09:28,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:28,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 10:09:28,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:28,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 10:09:28,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-07-12 10:09:28,386 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114 [2022-07-12 10:09:28,387 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 101 transitions, 288 flow. Second operand has 13 states, 13 states have (on average 89.3076923076923) internal successors, (1161), 13 states have internal predecessors, (1161), 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) [2022-07-12 10:09:28,387 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:28,387 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114 [2022-07-12 10:09:28,388 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:28,768 INFO L129 PetriNetUnfolder]: 228/613 cut-off events. [2022-07-12 10:09:28,768 INFO L130 PetriNetUnfolder]: For 1191/1201 co-relation queries the response was YES. [2022-07-12 10:09:28,770 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1794 conditions, 613 events. 228/613 cut-off events. For 1191/1201 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2933 event pairs, 83 based on Foata normal form. 13/606 useless extension candidates. Maximal degree in co-relation 1721. Up to 291 conditions per place. [2022-07-12 10:09:28,772 INFO L132 encePairwiseOnDemand]: 100/114 looper letters, 22 selfloop transitions, 15 changer transitions 35/146 dead transitions. [2022-07-12 10:09:28,772 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 146 transitions, 712 flow [2022-07-12 10:09:28,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 10:09:28,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-07-12 10:09:28,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1655 transitions. [2022-07-12 10:09:28,775 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8065302144249513 [2022-07-12 10:09:28,776 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1655 transitions. [2022-07-12 10:09:28,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1655 transitions. [2022-07-12 10:09:28,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:28,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1655 transitions. [2022-07-12 10:09:28,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 91.94444444444444) internal successors, (1655), 18 states have internal predecessors, (1655), 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) [2022-07-12 10:09:28,781 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 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) [2022-07-12 10:09:28,783 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 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) [2022-07-12 10:09:28,783 INFO L186 Difference]: Start difference. First operand has 129 places, 101 transitions, 288 flow. Second operand 18 states and 1655 transitions. [2022-07-12 10:09:28,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 146 transitions, 712 flow [2022-07-12 10:09:28,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 146 transitions, 690 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-07-12 10:09:28,787 INFO L242 Difference]: Finished difference. Result has 143 places, 105 transitions, 388 flow [2022-07-12 10:09:28,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=388, PETRI_PLACES=143, PETRI_TRANSITIONS=105} [2022-07-12 10:09:28,789 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 24 predicate places. [2022-07-12 10:09:28,789 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 105 transitions, 388 flow [2022-07-12 10:09:28,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 89.3076923076923) internal successors, (1161), 13 states have internal predecessors, (1161), 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) [2022-07-12 10:09:28,789 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:28,789 INFO L200 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] [2022-07-12 10:09:28,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 10:09:28,790 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:28,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:28,791 INFO L85 PathProgramCache]: Analyzing trace with hash 22833625, now seen corresponding path program 1 times [2022-07-12 10:09:28,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:28,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697010205] [2022-07-12 10:09:28,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:28,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:28,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:28,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:09:28,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:28,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697010205] [2022-07-12 10:09:28,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697010205] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:28,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:28,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 10:09:28,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24687305] [2022-07-12 10:09:28,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:28,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 10:09:28,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:28,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 10:09:28,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-12 10:09:28,987 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2022-07-12 10:09:28,988 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 105 transitions, 388 flow. Second operand has 11 states, 11 states have (on average 90.45454545454545) internal successors, (995), 11 states have internal predecessors, (995), 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) [2022-07-12 10:09:28,988 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:28,988 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2022-07-12 10:09:28,988 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:29,387 INFO L129 PetriNetUnfolder]: 252/629 cut-off events. [2022-07-12 10:09:29,387 INFO L130 PetriNetUnfolder]: For 3977/3999 co-relation queries the response was YES. [2022-07-12 10:09:29,389 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2522 conditions, 629 events. 252/629 cut-off events. For 3977/3999 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3007 event pairs, 56 based on Foata normal form. 23/633 useless extension candidates. Maximal degree in co-relation 2437. Up to 234 conditions per place. [2022-07-12 10:09:29,392 INFO L132 encePairwiseOnDemand]: 101/114 looper letters, 28 selfloop transitions, 12 changer transitions 38/153 dead transitions. [2022-07-12 10:09:29,392 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 153 transitions, 906 flow [2022-07-12 10:09:29,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 10:09:29,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-07-12 10:09:29,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1587 transitions. [2022-07-12 10:09:29,396 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8188854489164087 [2022-07-12 10:09:29,396 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1587 transitions. [2022-07-12 10:09:29,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1587 transitions. [2022-07-12 10:09:29,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:29,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1587 transitions. [2022-07-12 10:09:29,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 93.3529411764706) internal successors, (1587), 17 states have internal predecessors, (1587), 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) [2022-07-12 10:09:29,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 114.0) internal successors, (2052), 18 states have internal predecessors, (2052), 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) [2022-07-12 10:09:29,403 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 114.0) internal successors, (2052), 18 states have internal predecessors, (2052), 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) [2022-07-12 10:09:29,403 INFO L186 Difference]: Start difference. First operand has 143 places, 105 transitions, 388 flow. Second operand 17 states and 1587 transitions. [2022-07-12 10:09:29,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 153 transitions, 906 flow [2022-07-12 10:09:29,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 153 transitions, 750 flow, removed 73 selfloop flow, removed 14 redundant places. [2022-07-12 10:09:29,410 INFO L242 Difference]: Finished difference. Result has 147 places, 108 transitions, 429 flow [2022-07-12 10:09:29,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=429, PETRI_PLACES=147, PETRI_TRANSITIONS=108} [2022-07-12 10:09:29,412 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 28 predicate places. [2022-07-12 10:09:29,412 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 108 transitions, 429 flow [2022-07-12 10:09:29,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 90.45454545454545) internal successors, (995), 11 states have internal predecessors, (995), 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) [2022-07-12 10:09:29,412 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:29,413 INFO L200 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] [2022-07-12 10:09:29,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 10:09:29,413 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:29,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:29,413 INFO L85 PathProgramCache]: Analyzing trace with hash 477739969, now seen corresponding path program 1 times [2022-07-12 10:09:29,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:29,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015962718] [2022-07-12 10:09:29,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:29,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:29,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:29,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:09:29,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:29,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015962718] [2022-07-12 10:09:29,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015962718] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:29,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:29,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 10:09:29,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688020618] [2022-07-12 10:09:29,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:29,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 10:09:29,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:29,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 10:09:29,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-12 10:09:29,571 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 114 [2022-07-12 10:09:29,572 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 108 transitions, 429 flow. Second operand has 11 states, 11 states have (on average 88.72727272727273) internal successors, (976), 11 states have internal predecessors, (976), 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) [2022-07-12 10:09:29,572 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:29,572 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 114 [2022-07-12 10:09:29,572 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:30,091 INFO L129 PetriNetUnfolder]: 190/562 cut-off events. [2022-07-12 10:09:30,091 INFO L130 PetriNetUnfolder]: For 3638/3654 co-relation queries the response was YES. [2022-07-12 10:09:30,093 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2431 conditions, 562 events. 190/562 cut-off events. For 3638/3654 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2661 event pairs, 48 based on Foata normal form. 15/555 useless extension candidates. Maximal degree in co-relation 2342. Up to 206 conditions per place. [2022-07-12 10:09:30,096 INFO L132 encePairwiseOnDemand]: 102/114 looper letters, 31 selfloop transitions, 16 changer transitions 38/158 dead transitions. [2022-07-12 10:09:30,096 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 158 transitions, 1147 flow [2022-07-12 10:09:30,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 10:09:30,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-07-12 10:09:30,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1558 transitions. [2022-07-12 10:09:30,100 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.803921568627451 [2022-07-12 10:09:30,100 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1558 transitions. [2022-07-12 10:09:30,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1558 transitions. [2022-07-12 10:09:30,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:30,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1558 transitions. [2022-07-12 10:09:30,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 91.6470588235294) internal successors, (1558), 17 states have internal predecessors, (1558), 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) [2022-07-12 10:09:30,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 114.0) internal successors, (2052), 18 states have internal predecessors, (2052), 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) [2022-07-12 10:09:30,106 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 114.0) internal successors, (2052), 18 states have internal predecessors, (2052), 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) [2022-07-12 10:09:30,106 INFO L186 Difference]: Start difference. First operand has 147 places, 108 transitions, 429 flow. Second operand 17 states and 1558 transitions. [2022-07-12 10:09:30,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 158 transitions, 1147 flow [2022-07-12 10:09:30,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 158 transitions, 1056 flow, removed 37 selfloop flow, removed 14 redundant places. [2022-07-12 10:09:30,113 INFO L242 Difference]: Finished difference. Result has 151 places, 112 transitions, 515 flow [2022-07-12 10:09:30,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=515, PETRI_PLACES=151, PETRI_TRANSITIONS=112} [2022-07-12 10:09:30,114 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 32 predicate places. [2022-07-12 10:09:30,114 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 112 transitions, 515 flow [2022-07-12 10:09:30,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 88.72727272727273) internal successors, (976), 11 states have internal predecessors, (976), 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) [2022-07-12 10:09:30,115 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:30,115 INFO L200 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] [2022-07-12 10:09:30,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 10:09:30,115 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:30,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:30,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1501758538, now seen corresponding path program 1 times [2022-07-12 10:09:30,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:30,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874291265] [2022-07-12 10:09:30,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:30,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:30,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:09:30,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:30,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874291265] [2022-07-12 10:09:30,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874291265] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:30,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:30,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:09:30,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329770339] [2022-07-12 10:09:30,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:30,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:09:30,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:30,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:09:30,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:09:30,204 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-07-12 10:09:30,205 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 112 transitions, 515 flow. Second operand has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 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) [2022-07-12 10:09:30,205 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:30,205 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-07-12 10:09:30,205 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:30,559 INFO L129 PetriNetUnfolder]: 1213/2372 cut-off events. [2022-07-12 10:09:30,559 INFO L130 PetriNetUnfolder]: For 19529/19564 co-relation queries the response was YES. [2022-07-12 10:09:30,567 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9697 conditions, 2372 events. 1213/2372 cut-off events. For 19529/19564 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 15207 event pairs, 73 based on Foata normal form. 20/2313 useless extension candidates. Maximal degree in co-relation 9612. Up to 691 conditions per place. [2022-07-12 10:09:30,574 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 64 selfloop transitions, 7 changer transitions 85/236 dead transitions. [2022-07-12 10:09:30,574 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 236 transitions, 2019 flow [2022-07-12 10:09:30,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 10:09:30,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-12 10:09:30,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 982 transitions. [2022-07-12 10:09:30,577 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8614035087719298 [2022-07-12 10:09:30,577 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 982 transitions. [2022-07-12 10:09:30,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 982 transitions. [2022-07-12 10:09:30,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:30,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 982 transitions. [2022-07-12 10:09:30,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 98.2) internal successors, (982), 10 states have internal predecessors, (982), 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) [2022-07-12 10:09:30,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 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) [2022-07-12 10:09:30,582 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 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) [2022-07-12 10:09:30,582 INFO L186 Difference]: Start difference. First operand has 151 places, 112 transitions, 515 flow. Second operand 10 states and 982 transitions. [2022-07-12 10:09:30,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 236 transitions, 2019 flow [2022-07-12 10:09:30,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 236 transitions, 1693 flow, removed 153 selfloop flow, removed 13 redundant places. [2022-07-12 10:09:30,630 INFO L242 Difference]: Finished difference. Result has 144 places, 116 transitions, 512 flow [2022-07-12 10:09:30,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=512, PETRI_PLACES=144, PETRI_TRANSITIONS=116} [2022-07-12 10:09:30,632 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 25 predicate places. [2022-07-12 10:09:30,632 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 116 transitions, 512 flow [2022-07-12 10:09:30,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 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) [2022-07-12 10:09:30,632 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:30,632 INFO L200 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] [2022-07-12 10:09:30,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 10:09:30,633 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:30,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:30,633 INFO L85 PathProgramCache]: Analyzing trace with hash -531485674, now seen corresponding path program 1 times [2022-07-12 10:09:30,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:30,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581675817] [2022-07-12 10:09:30,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:30,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:30,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:09:30,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:30,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581675817] [2022-07-12 10:09:30,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581675817] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:30,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:30,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:09:30,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563126294] [2022-07-12 10:09:30,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:30,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:09:30,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:30,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:09:30,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:09:30,718 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-07-12 10:09:30,719 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 116 transitions, 512 flow. Second operand has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 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) [2022-07-12 10:09:30,719 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:30,719 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-07-12 10:09:30,719 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:31,060 INFO L129 PetriNetUnfolder]: 527/1291 cut-off events. [2022-07-12 10:09:31,061 INFO L130 PetriNetUnfolder]: For 5749/5773 co-relation queries the response was YES. [2022-07-12 10:09:31,064 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5062 conditions, 1291 events. 527/1291 cut-off events. For 5749/5773 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8036 event pairs, 47 based on Foata normal form. 41/1312 useless extension candidates. Maximal degree in co-relation 4981. Up to 302 conditions per place. [2022-07-12 10:09:31,067 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 62 selfloop transitions, 12 changer transitions 56/210 dead transitions. [2022-07-12 10:09:31,067 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 210 transitions, 1582 flow [2022-07-12 10:09:31,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 10:09:31,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-12 10:09:31,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1081 transitions. [2022-07-12 10:09:31,071 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8620414673046252 [2022-07-12 10:09:31,071 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1081 transitions. [2022-07-12 10:09:31,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1081 transitions. [2022-07-12 10:09:31,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:31,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1081 transitions. [2022-07-12 10:09:31,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 98.27272727272727) internal successors, (1081), 11 states have internal predecessors, (1081), 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) [2022-07-12 10:09:31,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 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) [2022-07-12 10:09:31,077 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 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) [2022-07-12 10:09:31,077 INFO L186 Difference]: Start difference. First operand has 144 places, 116 transitions, 512 flow. Second operand 11 states and 1081 transitions. [2022-07-12 10:09:31,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 210 transitions, 1582 flow [2022-07-12 10:09:31,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 210 transitions, 1554 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-07-12 10:09:31,085 INFO L242 Difference]: Finished difference. Result has 152 places, 123 transitions, 610 flow [2022-07-12 10:09:31,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=610, PETRI_PLACES=152, PETRI_TRANSITIONS=123} [2022-07-12 10:09:31,086 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 33 predicate places. [2022-07-12 10:09:31,086 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 123 transitions, 610 flow [2022-07-12 10:09:31,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 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) [2022-07-12 10:09:31,087 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:31,087 INFO L200 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] [2022-07-12 10:09:31,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 10:09:31,088 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:31,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:31,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1617209921, now seen corresponding path program 1 times [2022-07-12 10:09:31,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:31,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174359962] [2022-07-12 10:09:31,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:31,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:31,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:31,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:09:31,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:31,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174359962] [2022-07-12 10:09:31,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174359962] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:31,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:31,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 10:09:31,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107234594] [2022-07-12 10:09:31,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:31,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:09:31,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:31,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:09:31,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:09:31,180 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-07-12 10:09:31,181 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 123 transitions, 610 flow. Second operand has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 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) [2022-07-12 10:09:31,181 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:31,181 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-07-12 10:09:31,181 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:31,487 INFO L129 PetriNetUnfolder]: 399/1004 cut-off events. [2022-07-12 10:09:31,487 INFO L130 PetriNetUnfolder]: For 5654/5688 co-relation queries the response was YES. [2022-07-12 10:09:31,491 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4349 conditions, 1004 events. 399/1004 cut-off events. For 5654/5688 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 6582 event pairs, 31 based on Foata normal form. 26/1010 useless extension candidates. Maximal degree in co-relation 4290. Up to 273 conditions per place. [2022-07-12 10:09:31,493 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 51 selfloop transitions, 14 changer transitions 48/193 dead transitions. [2022-07-12 10:09:31,493 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 193 transitions, 1480 flow [2022-07-12 10:09:31,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 10:09:31,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-07-12 10:09:31,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1336 transitions. [2022-07-12 10:09:31,496 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8370927318295739 [2022-07-12 10:09:31,496 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1336 transitions. [2022-07-12 10:09:31,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1336 transitions. [2022-07-12 10:09:31,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:31,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1336 transitions. [2022-07-12 10:09:31,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 95.42857142857143) internal successors, (1336), 14 states have internal predecessors, (1336), 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) [2022-07-12 10:09:31,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 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) [2022-07-12 10:09:31,501 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 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) [2022-07-12 10:09:31,501 INFO L186 Difference]: Start difference. First operand has 152 places, 123 transitions, 610 flow. Second operand 14 states and 1336 transitions. [2022-07-12 10:09:31,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 193 transitions, 1480 flow [2022-07-12 10:09:31,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 193 transitions, 1401 flow, removed 31 selfloop flow, removed 9 redundant places. [2022-07-12 10:09:31,516 INFO L242 Difference]: Finished difference. Result has 160 places, 122 transitions, 585 flow [2022-07-12 10:09:31,517 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=585, PETRI_PLACES=160, PETRI_TRANSITIONS=122} [2022-07-12 10:09:31,518 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 41 predicate places. [2022-07-12 10:09:31,518 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 122 transitions, 585 flow [2022-07-12 10:09:31,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 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) [2022-07-12 10:09:31,519 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:31,519 INFO L200 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] [2022-07-12 10:09:31,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 10:09:31,519 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:31,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:31,520 INFO L85 PathProgramCache]: Analyzing trace with hash 771880350, now seen corresponding path program 1 times [2022-07-12 10:09:31,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:31,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624884587] [2022-07-12 10:09:31,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:31,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:31,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:31,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:09:31,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:31,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624884587] [2022-07-12 10:09:31,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624884587] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:31,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:31,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-12 10:09:31,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312731278] [2022-07-12 10:09:31,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:31,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 10:09:31,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:31,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 10:09:31,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-07-12 10:09:31,794 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 114 [2022-07-12 10:09:31,795 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 122 transitions, 585 flow. Second operand has 14 states, 14 states have (on average 87.64285714285714) internal successors, (1227), 14 states have internal predecessors, (1227), 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) [2022-07-12 10:09:31,795 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:31,796 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 114 [2022-07-12 10:09:31,796 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:32,086 INFO L129 PetriNetUnfolder]: 75/519 cut-off events. [2022-07-12 10:09:32,087 INFO L130 PetriNetUnfolder]: For 1489/1598 co-relation queries the response was YES. [2022-07-12 10:09:32,089 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1583 conditions, 519 events. 75/519 cut-off events. For 1489/1598 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3395 event pairs, 1 based on Foata normal form. 17/500 useless extension candidates. Maximal degree in co-relation 1516. Up to 98 conditions per place. [2022-07-12 10:09:32,091 INFO L132 encePairwiseOnDemand]: 103/114 looper letters, 36 selfloop transitions, 12 changer transitions 7/137 dead transitions. [2022-07-12 10:09:32,091 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 137 transitions, 793 flow [2022-07-12 10:09:32,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 10:09:32,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-12 10:09:32,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 987 transitions. [2022-07-12 10:09:32,093 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7870813397129187 [2022-07-12 10:09:32,093 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 987 transitions. [2022-07-12 10:09:32,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 987 transitions. [2022-07-12 10:09:32,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:32,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 987 transitions. [2022-07-12 10:09:32,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 89.72727272727273) internal successors, (987), 11 states have internal predecessors, (987), 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) [2022-07-12 10:09:32,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 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) [2022-07-12 10:09:32,096 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 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) [2022-07-12 10:09:32,096 INFO L186 Difference]: Start difference. First operand has 160 places, 122 transitions, 585 flow. Second operand 11 states and 987 transitions. [2022-07-12 10:09:32,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 137 transitions, 793 flow [2022-07-12 10:09:32,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 137 transitions, 638 flow, removed 61 selfloop flow, removed 18 redundant places. [2022-07-12 10:09:32,104 INFO L242 Difference]: Finished difference. Result has 150 places, 121 transitions, 489 flow [2022-07-12 10:09:32,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=489, PETRI_PLACES=150, PETRI_TRANSITIONS=121} [2022-07-12 10:09:32,105 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 31 predicate places. [2022-07-12 10:09:32,105 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 121 transitions, 489 flow [2022-07-12 10:09:32,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 87.64285714285714) internal successors, (1227), 14 states have internal predecessors, (1227), 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) [2022-07-12 10:09:32,106 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:32,106 INFO L200 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] [2022-07-12 10:09:32,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 10:09:32,106 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:32,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:32,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1412078344, now seen corresponding path program 2 times [2022-07-12 10:09:32,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:32,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698308908] [2022-07-12 10:09:32,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:32,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:32,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:09:32,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:32,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698308908] [2022-07-12 10:09:32,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698308908] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:32,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:32,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-12 10:09:32,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146087285] [2022-07-12 10:09:32,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:32,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 10:09:32,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:32,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 10:09:32,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-07-12 10:09:32,356 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 114 [2022-07-12 10:09:32,357 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 121 transitions, 489 flow. Second operand has 14 states, 14 states have (on average 87.64285714285714) internal successors, (1227), 14 states have internal predecessors, (1227), 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) [2022-07-12 10:09:32,357 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:32,357 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 114 [2022-07-12 10:09:32,357 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:32,831 INFO L129 PetriNetUnfolder]: 107/756 cut-off events. [2022-07-12 10:09:32,831 INFO L130 PetriNetUnfolder]: For 676/748 co-relation queries the response was YES. [2022-07-12 10:09:32,834 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1779 conditions, 756 events. 107/756 cut-off events. For 676/748 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 6033 event pairs, 2 based on Foata normal form. 18/720 useless extension candidates. Maximal degree in co-relation 1749. Up to 137 conditions per place. [2022-07-12 10:09:32,836 INFO L132 encePairwiseOnDemand]: 102/114 looper letters, 38 selfloop transitions, 16 changer transitions 13/149 dead transitions. [2022-07-12 10:09:32,836 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 149 transitions, 768 flow [2022-07-12 10:09:32,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 10:09:32,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-12 10:09:32,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1174 transitions. [2022-07-12 10:09:32,847 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7921727395411606 [2022-07-12 10:09:32,847 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1174 transitions. [2022-07-12 10:09:32,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1174 transitions. [2022-07-12 10:09:32,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:32,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1174 transitions. [2022-07-12 10:09:32,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 90.3076923076923) internal successors, (1174), 13 states have internal predecessors, (1174), 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) [2022-07-12 10:09:32,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 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) [2022-07-12 10:09:32,851 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 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) [2022-07-12 10:09:32,851 INFO L186 Difference]: Start difference. First operand has 150 places, 121 transitions, 489 flow. Second operand 13 states and 1174 transitions. [2022-07-12 10:09:32,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 149 transitions, 768 flow [2022-07-12 10:09:32,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 149 transitions, 707 flow, removed 12 selfloop flow, removed 11 redundant places. [2022-07-12 10:09:32,855 INFO L242 Difference]: Finished difference. Result has 155 places, 123 transitions, 523 flow [2022-07-12 10:09:32,856 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=523, PETRI_PLACES=155, PETRI_TRANSITIONS=123} [2022-07-12 10:09:32,856 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 36 predicate places. [2022-07-12 10:09:32,856 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 123 transitions, 523 flow [2022-07-12 10:09:32,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 87.64285714285714) internal successors, (1227), 14 states have internal predecessors, (1227), 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) [2022-07-12 10:09:32,857 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:32,857 INFO L200 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] [2022-07-12 10:09:32,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 10:09:32,857 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:32,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:32,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1019538144, now seen corresponding path program 3 times [2022-07-12 10:09:32,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:32,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321892685] [2022-07-12 10:09:32,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:32,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:32,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:09:32,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:32,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321892685] [2022-07-12 10:09:32,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321892685] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:32,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:32,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:09:32,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960204714] [2022-07-12 10:09:32,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:32,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:09:32,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:32,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:09:32,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:09:32,933 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114 [2022-07-12 10:09:32,934 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 123 transitions, 523 flow. Second operand has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 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) [2022-07-12 10:09:32,934 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:32,934 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114 [2022-07-12 10:09:32,934 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:33,079 INFO L129 PetriNetUnfolder]: 135/860 cut-off events. [2022-07-12 10:09:33,080 INFO L130 PetriNetUnfolder]: For 861/885 co-relation queries the response was YES. [2022-07-12 10:09:33,083 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2143 conditions, 860 events. 135/860 cut-off events. For 861/885 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 7218 event pairs, 12 based on Foata normal form. 7/810 useless extension candidates. Maximal degree in co-relation 2112. Up to 145 conditions per place. [2022-07-12 10:09:33,084 INFO L132 encePairwiseOnDemand]: 108/114 looper letters, 23 selfloop transitions, 2 changer transitions 29/143 dead transitions. [2022-07-12 10:09:33,084 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 143 transitions, 762 flow [2022-07-12 10:09:33,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 10:09:33,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-07-12 10:09:33,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 581 transitions. [2022-07-12 10:09:33,086 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8494152046783626 [2022-07-12 10:09:33,086 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 581 transitions. [2022-07-12 10:09:33,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 581 transitions. [2022-07-12 10:09:33,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:33,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 581 transitions. [2022-07-12 10:09:33,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 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) [2022-07-12 10:09:33,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 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) [2022-07-12 10:09:33,088 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 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) [2022-07-12 10:09:33,088 INFO L186 Difference]: Start difference. First operand has 155 places, 123 transitions, 523 flow. Second operand 6 states and 581 transitions. [2022-07-12 10:09:33,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 143 transitions, 762 flow [2022-07-12 10:09:33,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 143 transitions, 717 flow, removed 19 selfloop flow, removed 9 redundant places. [2022-07-12 10:09:33,092 INFO L242 Difference]: Finished difference. Result has 149 places, 112 transitions, 421 flow [2022-07-12 10:09:33,092 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=421, PETRI_PLACES=149, PETRI_TRANSITIONS=112} [2022-07-12 10:09:33,093 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 30 predicate places. [2022-07-12 10:09:33,093 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 112 transitions, 421 flow [2022-07-12 10:09:33,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 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) [2022-07-12 10:09:33,093 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:33,093 INFO L200 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] [2022-07-12 10:09:33,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 10:09:33,094 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:33,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:33,094 INFO L85 PathProgramCache]: Analyzing trace with hash 891944986, now seen corresponding path program 4 times [2022-07-12 10:09:33,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:33,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065699741] [2022-07-12 10:09:33,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:33,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 10:09:33,126 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 10:09:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 10:09:33,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 10:09:33,179 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 10:09:33,179 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-07-12 10:09:33,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-07-12 10:09:33,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-07-12 10:09:33,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-07-12 10:09:33,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-07-12 10:09:33,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-07-12 10:09:33,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 10:09:33,182 INFO L356 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:33,186 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-12 10:09:33,186 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 10:09:33,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 10:09:33 BasicIcfg [2022-07-12 10:09:33,271 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 10:09:33,271 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 10:09:33,271 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 10:09:33,271 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 10:09:33,272 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:09:25" (3/4) ... [2022-07-12 10:09:33,273 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 10:09:33,341 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 10:09:33,341 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 10:09:33,342 INFO L158 Benchmark]: Toolchain (without parser) took 8896.72ms. Allocated memory was 92.3MB in the beginning and 373.3MB in the end (delta: 281.0MB). Free memory was 49.6MB in the beginning and 311.2MB in the end (delta: -261.6MB). Peak memory consumption was 232.1MB. Max. memory is 16.1GB. [2022-07-12 10:09:33,342 INFO L158 Benchmark]: CDTParser took 0.60ms. Allocated memory is still 92.3MB. Free memory is still 68.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 10:09:33,342 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.30ms. Allocated memory is still 92.3MB. Free memory was 49.4MB in the beginning and 54.0MB in the end (delta: -4.6MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. [2022-07-12 10:09:33,342 INFO L158 Benchmark]: Boogie Procedure Inliner took 103.45ms. Allocated memory is still 92.3MB. Free memory was 53.8MB in the beginning and 50.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 10:09:33,343 INFO L158 Benchmark]: Boogie Preprocessor took 67.90ms. Allocated memory is still 92.3MB. Free memory was 50.9MB in the beginning and 48.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 10:09:33,343 INFO L158 Benchmark]: RCFGBuilder took 986.84ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 48.7MB in the beginning and 55.8MB in the end (delta: -7.1MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. [2022-07-12 10:09:33,343 INFO L158 Benchmark]: TraceAbstraction took 7300.83ms. Allocated memory was 111.1MB in the beginning and 373.3MB in the end (delta: 262.1MB). Free memory was 55.2MB in the beginning and 118.8MB in the end (delta: -63.6MB). Peak memory consumption was 202.7MB. Max. memory is 16.1GB. [2022-07-12 10:09:33,343 INFO L158 Benchmark]: Witness Printer took 70.25ms. Allocated memory is still 373.3MB. Free memory was 118.8MB in the beginning and 311.2MB in the end (delta: -192.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-12 10:09:33,344 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.60ms. Allocated memory is still 92.3MB. Free memory is still 68.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.30ms. Allocated memory is still 92.3MB. Free memory was 49.4MB in the beginning and 54.0MB in the end (delta: -4.6MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 103.45ms. Allocated memory is still 92.3MB. Free memory was 53.8MB in the beginning and 50.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.90ms. Allocated memory is still 92.3MB. Free memory was 50.9MB in the beginning and 48.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 986.84ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 48.7MB in the beginning and 55.8MB in the end (delta: -7.1MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7300.83ms. Allocated memory was 111.1MB in the beginning and 373.3MB in the end (delta: 262.1MB). Free memory was 55.2MB in the beginning and 118.8MB in the end (delta: -63.6MB). Peak memory consumption was 202.7MB. Max. memory is 16.1GB. * Witness Printer took 70.25ms. Allocated memory is still 373.3MB. Free memory was 118.8MB in the beginning and 311.2MB in the end (delta: -192.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L719] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L720] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L721] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L722] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L723] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L724] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L725] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L726] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L727] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L728] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L729] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L730] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L731] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L732] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L733] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L734] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L735] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 pthread_t t2025; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2025={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] FCALL, FORK 0 pthread_create(&t2025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2025, ((void *)0), P0, ((void *)0))=-2, t2025={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2026; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L821] FCALL, FORK 0 pthread_create(&t2026, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2026, ((void *)0), P1, ((void *)0))=-1, t2025={5:0}, t2026={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L822] 0 pthread_t t2027; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] FCALL, FORK 0 pthread_create(&t2027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2027, ((void *)0), P2, ((void *)0))=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L831] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L841] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L841] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L842] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L842] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L843] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L843] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L844] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L845] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L845] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 823]: 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: 821]: 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: 819]: 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, 141 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: 7.1s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 705 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 705 mSDsluCounter, 652 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1112 mSDsCounter, 254 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1786 IncrementalHoareTripleChecker+Invalid, 2040 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 254 mSolverCounterUnsat, 115 mSDtfsCounter, 1786 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 198 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=610occurred in iteration=9, InterpolantAutomatonStates: 154, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1111 NumberOfCodeBlocks, 1111 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1010 ConstructedInterpolants, 0 QuantifiedInterpolants, 6173 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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! [2022-07-12 10:09:33,391 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