./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/rfi008.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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/rfi008.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 0d082f4414248fc35e1fa616a9787901263e0e45c6e6a28545f00aa25d14032e --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 21:10:28,648 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 21:10:28,650 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 21:10:28,687 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 21:10:28,687 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 21:10:28,689 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 21:10:28,690 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 21:10:28,692 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 21:10:28,693 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 21:10:28,697 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 21:10:28,698 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 21:10:28,699 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 21:10:28,699 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 21:10:28,701 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 21:10:28,702 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 21:10:28,705 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 21:10:28,705 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 21:10:28,707 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 21:10:28,708 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 21:10:28,712 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 21:10:28,714 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 21:10:28,715 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 21:10:28,715 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 21:10:28,716 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 21:10:28,717 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 21:10:28,722 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 21:10:28,723 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 21:10:28,723 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 21:10:28,724 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 21:10:28,724 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 21:10:28,725 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 21:10:28,725 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 21:10:28,727 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 21:10:28,727 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 21:10:28,727 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 21:10:28,729 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 21:10:28,729 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 21:10:28,729 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 21:10:28,730 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 21:10:28,730 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 21:10:28,731 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 21:10:28,732 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 21:10:28,733 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 21:10:28,761 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 21:10:28,761 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 21:10:28,762 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 21:10:28,762 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 21:10:28,762 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 21:10:28,762 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 21:10:28,763 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 21:10:28,763 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 21:10:28,763 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 21:10:28,764 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 21:10:28,764 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 21:10:28,764 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 21:10:28,765 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 21:10:28,765 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 21:10:28,765 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 21:10:28,765 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 21:10:28,765 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 21:10:28,765 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 21:10:28,765 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 21:10:28,767 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 21:10:28,767 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 21:10:28,767 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 21:10:28,767 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 21:10:28,767 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 21:10:28,767 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 21:10:28,767 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 21:10:28,768 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 21:10:28,768 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 21:10:28,768 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 21:10:28,768 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 21:10:28,768 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 21:10:28,768 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 21:10:28,769 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 21:10:28,769 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 -> 0d082f4414248fc35e1fa616a9787901263e0e45c6e6a28545f00aa25d14032e [2022-07-19 21:10:28,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 21:10:28,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 21:10:28,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 21:10:28,964 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 21:10:28,965 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 21:10:28,966 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi008.opt.i [2022-07-19 21:10:29,040 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9601ca665/d28f352dbb6c49f6860195a70a7a66a1/FLAGcaa93bd30 [2022-07-19 21:10:29,441 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 21:10:29,441 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi008.opt.i [2022-07-19 21:10:29,450 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9601ca665/d28f352dbb6c49f6860195a70a7a66a1/FLAGcaa93bd30 [2022-07-19 21:10:29,458 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9601ca665/d28f352dbb6c49f6860195a70a7a66a1 [2022-07-19 21:10:29,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 21:10:29,461 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 21:10:29,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 21:10:29,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 21:10:29,465 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 21:10:29,465 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:10:29" (1/1) ... [2022-07-19 21:10:29,466 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@268760bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:10:29, skipping insertion in model container [2022-07-19 21:10:29,466 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:10:29" (1/1) ... [2022-07-19 21:10:29,471 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 21:10:29,500 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 21:10:29,630 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/rfi008.opt.i[987,1000] [2022-07-19 21:10:29,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 21:10:29,752 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 21:10:29,761 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/rfi008.opt.i[987,1000] [2022-07-19 21:10:29,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 21:10:29,814 INFO L208 MainTranslator]: Completed translation [2022-07-19 21:10:29,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:10:29 WrapperNode [2022-07-19 21:10:29,815 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 21:10:29,816 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 21:10:29,816 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 21:10:29,816 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 21:10:29,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:10:29" (1/1) ... [2022-07-19 21:10:29,845 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:10:29" (1/1) ... [2022-07-19 21:10:29,874 INFO L137 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 265 [2022-07-19 21:10:29,876 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 21:10:29,877 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 21:10:29,877 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 21:10:29,877 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 21:10:29,883 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:10:29" (1/1) ... [2022-07-19 21:10:29,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:10:29" (1/1) ... [2022-07-19 21:10:29,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:10:29" (1/1) ... [2022-07-19 21:10:29,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:10:29" (1/1) ... [2022-07-19 21:10:29,906 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:10:29" (1/1) ... [2022-07-19 21:10:29,921 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:10:29" (1/1) ... [2022-07-19 21:10:29,923 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:10:29" (1/1) ... [2022-07-19 21:10:29,926 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 21:10:29,928 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 21:10:29,931 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 21:10:29,931 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 21:10:29,934 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:10:29" (1/1) ... [2022-07-19 21:10:29,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 21:10:29,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:10:29,959 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-19 21:10:29,961 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-19 21:10:29,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 21:10:29,993 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-19 21:10:29,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 21:10:29,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 21:10:29,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 21:10:29,994 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-19 21:10:29,994 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-19 21:10:29,994 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-19 21:10:29,994 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-19 21:10:29,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 21:10:29,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-19 21:10:29,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 21:10:29,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 21:10:29,996 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-19 21:10:30,090 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 21:10:30,092 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 21:10:30,463 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 21:10:30,713 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 21:10:30,714 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-19 21:10:30,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:10:30 BoogieIcfgContainer [2022-07-19 21:10:30,716 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 21:10:30,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 21:10:30,718 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 21:10:30,720 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 21:10:30,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 09:10:29" (1/3) ... [2022-07-19 21:10:30,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ff3204a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:10:30, skipping insertion in model container [2022-07-19 21:10:30,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:10:29" (2/3) ... [2022-07-19 21:10:30,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ff3204a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:10:30, skipping insertion in model container [2022-07-19 21:10:30,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:10:30" (3/3) ... [2022-07-19 21:10:30,722 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi008.opt.i [2022-07-19 21:10:30,726 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-19 21:10:30,732 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 21:10:30,732 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-19 21:10:30,733 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-19 21:10:30,793 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-19 21:10:30,829 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 103 places, 98 transitions, 206 flow [2022-07-19 21:10:30,863 INFO L129 PetriNetUnfolder]: 2/96 cut-off events. [2022-07-19 21:10:30,864 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-19 21:10:30,866 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2022-07-19 21:10:30,866 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 98 transitions, 206 flow [2022-07-19 21:10:30,869 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 96 transitions, 198 flow [2022-07-19 21:10:30,882 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 21:10:30,888 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@2c1eb3c8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5eb432b7 [2022-07-19 21:10:30,888 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-07-19 21:10:30,899 INFO L129 PetriNetUnfolder]: 0/58 cut-off events. [2022-07-19 21:10:30,901 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-19 21:10:30,902 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:10:30,902 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] [2022-07-19 21:10:30,903 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-19 21:10:30,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:10:30,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1117316809, now seen corresponding path program 1 times [2022-07-19 21:10:30,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:10:30,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542099263] [2022-07-19 21:10:30,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:10:30,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:10:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:10:31,173 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-19 21:10:31,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:10:31,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542099263] [2022-07-19 21:10:31,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542099263] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:10:31,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:10:31,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 21:10:31,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448015978] [2022-07-19 21:10:31,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:10:31,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 21:10:31,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:10:31,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 21:10:31,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 21:10:31,212 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 98 [2022-07-19 21:10:31,216 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 96 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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-19 21:10:31,216 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:10:31,216 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 98 [2022-07-19 21:10:31,217 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:10:31,320 INFO L129 PetriNetUnfolder]: 14/169 cut-off events. [2022-07-19 21:10:31,322 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-19 21:10:31,323 INFO L84 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 169 events. 14/169 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 413 event pairs, 6 based on Foata normal form. 6/164 useless extension candidates. Maximal degree in co-relation 162. Up to 25 conditions per place. [2022-07-19 21:10:31,325 INFO L132 encePairwiseOnDemand]: 93/98 looper letters, 8 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2022-07-19 21:10:31,326 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 94 transitions, 214 flow [2022-07-19 21:10:31,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 21:10:31,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-19 21:10:31,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2022-07-19 21:10:31,348 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9285714285714286 [2022-07-19 21:10:31,349 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 273 transitions. [2022-07-19 21:10:31,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 273 transitions. [2022-07-19 21:10:31,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:10:31,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 273 transitions. [2022-07-19 21:10:31,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 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-19 21:10:31,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 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-19 21:10:31,364 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 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-19 21:10:31,365 INFO L186 Difference]: Start difference. First operand has 101 places, 96 transitions, 198 flow. Second operand 3 states and 273 transitions. [2022-07-19 21:10:31,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 94 transitions, 214 flow [2022-07-19 21:10:31,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 94 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-19 21:10:31,372 INFO L242 Difference]: Finished difference. Result has 99 places, 92 transitions, 192 flow [2022-07-19 21:10:31,373 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=99, PETRI_TRANSITIONS=92} [2022-07-19 21:10:31,376 INFO L279 CegarLoopForPetriNet]: 101 programPoint places, -2 predicate places. [2022-07-19 21:10:31,376 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 92 transitions, 192 flow [2022-07-19 21:10:31,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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-19 21:10:31,377 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:10:31,377 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] [2022-07-19 21:10:31,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 21:10:31,378 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-19 21:10:31,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:10:31,378 INFO L85 PathProgramCache]: Analyzing trace with hash -392497808, now seen corresponding path program 1 times [2022-07-19 21:10:31,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:10:31,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038473278] [2022-07-19 21:10:31,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:10:31,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:10:31,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:10:31,593 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-19 21:10:31,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:10:31,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038473278] [2022-07-19 21:10:31,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038473278] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:10:31,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:10:31,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 21:10:31,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434970758] [2022-07-19 21:10:31,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:10:31,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 21:10:31,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:10:31,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 21:10:31,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 21:10:31,597 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 98 [2022-07-19 21:10:31,598 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 92 transitions, 192 flow. Second operand has 7 states, 7 states have (on average 75.85714285714286) internal successors, (531), 7 states have internal predecessors, (531), 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-19 21:10:31,598 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:10:31,598 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 98 [2022-07-19 21:10:31,598 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:10:31,860 INFO L129 PetriNetUnfolder]: 210/742 cut-off events. [2022-07-19 21:10:31,860 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-07-19 21:10:31,862 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1170 conditions, 742 events. 210/742 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4295 event pairs, 34 based on Foata normal form. 0/717 useless extension candidates. Maximal degree in co-relation 1116. Up to 189 conditions per place. [2022-07-19 21:10:31,864 INFO L132 encePairwiseOnDemand]: 92/98 looper letters, 23 selfloop transitions, 2 changer transitions 49/137 dead transitions. [2022-07-19 21:10:31,864 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 137 transitions, 428 flow [2022-07-19 21:10:31,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:10:31,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-19 21:10:31,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 733 transitions. [2022-07-19 21:10:31,867 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8310657596371882 [2022-07-19 21:10:31,867 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 733 transitions. [2022-07-19 21:10:31,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 733 transitions. [2022-07-19 21:10:31,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:10:31,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 733 transitions. [2022-07-19 21:10:31,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 81.44444444444444) internal successors, (733), 9 states have internal predecessors, (733), 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-19 21:10:31,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 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-19 21:10:31,871 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 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-19 21:10:31,871 INFO L186 Difference]: Start difference. First operand has 99 places, 92 transitions, 192 flow. Second operand 9 states and 733 transitions. [2022-07-19 21:10:31,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 137 transitions, 428 flow [2022-07-19 21:10:31,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 137 transitions, 410 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-19 21:10:31,874 INFO L242 Difference]: Finished difference. Result has 112 places, 82 transitions, 188 flow [2022-07-19 21:10:31,874 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=188, PETRI_PLACES=112, PETRI_TRANSITIONS=82} [2022-07-19 21:10:31,875 INFO L279 CegarLoopForPetriNet]: 101 programPoint places, 11 predicate places. [2022-07-19 21:10:31,875 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 82 transitions, 188 flow [2022-07-19 21:10:31,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 75.85714285714286) internal successors, (531), 7 states have internal predecessors, (531), 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-19 21:10:31,876 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:10:31,876 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] [2022-07-19 21:10:31,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 21:10:31,876 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-19 21:10:31,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:10:31,877 INFO L85 PathProgramCache]: Analyzing trace with hash -492284146, now seen corresponding path program 1 times [2022-07-19 21:10:31,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:10:31,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693767225] [2022-07-19 21:10:31,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:10:31,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:10:31,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:10:31,977 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-19 21:10:31,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:10:31,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693767225] [2022-07-19 21:10:31,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693767225] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:10:31,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:10:31,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 21:10:31,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097267484] [2022-07-19 21:10:31,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:10:31,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 21:10:31,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:10:31,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 21:10:31,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 21:10:31,981 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 98 [2022-07-19 21:10:31,981 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 82 transitions, 188 flow. Second operand has 7 states, 7 states have (on average 76.0) internal successors, (532), 7 states have internal predecessors, (532), 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-19 21:10:31,981 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:10:31,982 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 98 [2022-07-19 21:10:31,982 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:10:32,189 INFO L129 PetriNetUnfolder]: 113/346 cut-off events. [2022-07-19 21:10:32,190 INFO L130 PetriNetUnfolder]: For 127/127 co-relation queries the response was YES. [2022-07-19 21:10:32,191 INFO L84 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 346 events. 113/346 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1299 event pairs, 31 based on Foata normal form. 10/340 useless extension candidates. Maximal degree in co-relation 640. Up to 106 conditions per place. [2022-07-19 21:10:32,192 INFO L132 encePairwiseOnDemand]: 90/98 looper letters, 18 selfloop transitions, 4 changer transitions 25/110 dead transitions. [2022-07-19 21:10:32,192 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 110 transitions, 359 flow [2022-07-19 21:10:32,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 21:10:32,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-19 21:10:32,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 789 transitions. [2022-07-19 21:10:32,194 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8051020408163265 [2022-07-19 21:10:32,194 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 789 transitions. [2022-07-19 21:10:32,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 789 transitions. [2022-07-19 21:10:32,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:10:32,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 789 transitions. [2022-07-19 21:10:32,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 78.9) internal successors, (789), 10 states have internal predecessors, (789), 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-19 21:10:32,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 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-19 21:10:32,198 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 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-19 21:10:32,199 INFO L186 Difference]: Start difference. First operand has 112 places, 82 transitions, 188 flow. Second operand 10 states and 789 transitions. [2022-07-19 21:10:32,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 110 transitions, 359 flow [2022-07-19 21:10:32,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 110 transitions, 325 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-07-19 21:10:32,203 INFO L242 Difference]: Finished difference. Result has 104 places, 82 transitions, 196 flow [2022-07-19 21:10:32,203 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=196, PETRI_PLACES=104, PETRI_TRANSITIONS=82} [2022-07-19 21:10:32,203 INFO L279 CegarLoopForPetriNet]: 101 programPoint places, 3 predicate places. [2022-07-19 21:10:32,204 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 82 transitions, 196 flow [2022-07-19 21:10:32,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 76.0) internal successors, (532), 7 states have internal predecessors, (532), 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-19 21:10:32,204 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:10:32,204 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] [2022-07-19 21:10:32,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 21:10:32,205 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-19 21:10:32,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:10:32,205 INFO L85 PathProgramCache]: Analyzing trace with hash 396581961, now seen corresponding path program 1 times [2022-07-19 21:10:32,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:10:32,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237665316] [2022-07-19 21:10:32,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:10:32,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:10:32,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:10:32,310 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-19 21:10:32,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:10:32,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237665316] [2022-07-19 21:10:32,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237665316] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:10:32,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:10:32,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 21:10:32,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896600477] [2022-07-19 21:10:32,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:10:32,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 21:10:32,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:10:32,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 21:10:32,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:10:32,313 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 98 [2022-07-19 21:10:32,313 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 82 transitions, 196 flow. Second operand has 6 states, 6 states have (on average 79.0) internal successors, (474), 6 states have internal predecessors, (474), 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-19 21:10:32,313 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:10:32,314 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 98 [2022-07-19 21:10:32,314 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:10:32,500 INFO L129 PetriNetUnfolder]: 155/450 cut-off events. [2022-07-19 21:10:32,501 INFO L130 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2022-07-19 21:10:32,502 INFO L84 FinitePrefix]: Finished finitePrefix Result has 862 conditions, 450 events. 155/450 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2162 event pairs, 14 based on Foata normal form. 0/441 useless extension candidates. Maximal degree in co-relation 831. Up to 79 conditions per place. [2022-07-19 21:10:32,503 INFO L132 encePairwiseOnDemand]: 89/98 looper letters, 24 selfloop transitions, 5 changer transitions 40/134 dead transitions. [2022-07-19 21:10:32,503 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 134 transitions, 461 flow [2022-07-19 21:10:32,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 21:10:32,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-19 21:10:32,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 841 transitions. [2022-07-19 21:10:32,505 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8581632653061224 [2022-07-19 21:10:32,505 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 841 transitions. [2022-07-19 21:10:32,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 841 transitions. [2022-07-19 21:10:32,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:10:32,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 841 transitions. [2022-07-19 21:10:32,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 84.1) internal successors, (841), 10 states have internal predecessors, (841), 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-19 21:10:32,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 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-19 21:10:32,509 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 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-19 21:10:32,509 INFO L186 Difference]: Start difference. First operand has 104 places, 82 transitions, 196 flow. Second operand 10 states and 841 transitions. [2022-07-19 21:10:32,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 134 transitions, 461 flow [2022-07-19 21:10:32,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 134 transitions, 427 flow, removed 6 selfloop flow, removed 9 redundant places. [2022-07-19 21:10:32,512 INFO L242 Difference]: Finished difference. Result has 104 places, 83 transitions, 218 flow [2022-07-19 21:10:32,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=218, PETRI_PLACES=104, PETRI_TRANSITIONS=83} [2022-07-19 21:10:32,513 INFO L279 CegarLoopForPetriNet]: 101 programPoint places, 3 predicate places. [2022-07-19 21:10:32,513 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 83 transitions, 218 flow [2022-07-19 21:10:32,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.0) internal successors, (474), 6 states have internal predecessors, (474), 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-19 21:10:32,514 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:10:32,514 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] [2022-07-19 21:10:32,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 21:10:32,514 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-19 21:10:32,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:10:32,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1163297030, now seen corresponding path program 1 times [2022-07-19 21:10:32,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:10:32,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440303312] [2022-07-19 21:10:32,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:10:32,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:10:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:10:32,629 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-19 21:10:32,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:10:32,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440303312] [2022-07-19 21:10:32,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440303312] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:10:32,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:10:32,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 21:10:32,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667665973] [2022-07-19 21:10:32,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:10:32,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 21:10:32,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:10:32,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 21:10:32,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 21:10:32,632 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 98 [2022-07-19 21:10:32,633 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 83 transitions, 218 flow. Second operand has 7 states, 7 states have (on average 79.0) internal successors, (553), 7 states have internal predecessors, (553), 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-19 21:10:32,633 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:10:32,633 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 98 [2022-07-19 21:10:32,633 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:10:32,781 INFO L129 PetriNetUnfolder]: 33/173 cut-off events. [2022-07-19 21:10:32,781 INFO L130 PetriNetUnfolder]: For 98/98 co-relation queries the response was YES. [2022-07-19 21:10:32,782 INFO L84 FinitePrefix]: Finished finitePrefix Result has 383 conditions, 173 events. 33/173 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 433 event pairs, 7 based on Foata normal form. 7/178 useless extension candidates. Maximal degree in co-relation 356. Up to 26 conditions per place. [2022-07-19 21:10:32,782 INFO L132 encePairwiseOnDemand]: 90/98 looper letters, 16 selfloop transitions, 7 changer transitions 19/107 dead transitions. [2022-07-19 21:10:32,782 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 107 transitions, 398 flow [2022-07-19 21:10:32,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 21:10:32,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-19 21:10:32,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 814 transitions. [2022-07-19 21:10:32,785 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8306122448979592 [2022-07-19 21:10:32,785 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 814 transitions. [2022-07-19 21:10:32,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 814 transitions. [2022-07-19 21:10:32,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:10:32,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 814 transitions. [2022-07-19 21:10:32,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 81.4) internal successors, (814), 10 states have internal predecessors, (814), 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-19 21:10:32,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 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-19 21:10:32,788 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 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-19 21:10:32,788 INFO L186 Difference]: Start difference. First operand has 104 places, 83 transitions, 218 flow. Second operand 10 states and 814 transitions. [2022-07-19 21:10:32,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 107 transitions, 398 flow [2022-07-19 21:10:32,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 107 transitions, 352 flow, removed 15 selfloop flow, removed 7 redundant places. [2022-07-19 21:10:32,791 INFO L242 Difference]: Finished difference. Result has 106 places, 83 transitions, 226 flow [2022-07-19 21:10:32,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=226, PETRI_PLACES=106, PETRI_TRANSITIONS=83} [2022-07-19 21:10:32,792 INFO L279 CegarLoopForPetriNet]: 101 programPoint places, 5 predicate places. [2022-07-19 21:10:32,792 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 83 transitions, 226 flow [2022-07-19 21:10:32,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 79.0) internal successors, (553), 7 states have internal predecessors, (553), 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-19 21:10:32,793 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:10:32,793 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] [2022-07-19 21:10:32,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 21:10:32,793 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-19 21:10:32,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:10:32,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1607326295, now seen corresponding path program 1 times [2022-07-19 21:10:32,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:10:32,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107681] [2022-07-19 21:10:32,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:10:32,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:10:32,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:10:32,976 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-19 21:10:32,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:10:32,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107681] [2022-07-19 21:10:32,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107681] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:10:32,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:10:32,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 21:10:32,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223109398] [2022-07-19 21:10:32,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:10:32,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 21:10:32,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:10:32,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 21:10:32,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-19 21:10:32,979 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 98 [2022-07-19 21:10:32,980 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 83 transitions, 226 flow. Second operand has 10 states, 10 states have (on average 72.3) internal successors, (723), 10 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:10:32,980 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:10:32,980 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 98 [2022-07-19 21:10:32,980 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:10:33,300 INFO L129 PetriNetUnfolder]: 25/242 cut-off events. [2022-07-19 21:10:33,300 INFO L130 PetriNetUnfolder]: For 125/125 co-relation queries the response was YES. [2022-07-19 21:10:33,301 INFO L84 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 242 events. 25/242 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 859 event pairs, 2 based on Foata normal form. 2/241 useless extension candidates. Maximal degree in co-relation 421. Up to 37 conditions per place. [2022-07-19 21:10:33,302 INFO L132 encePairwiseOnDemand]: 84/98 looper letters, 33 selfloop transitions, 13 changer transitions 12/118 dead transitions. [2022-07-19 21:10:33,302 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 118 transitions, 414 flow [2022-07-19 21:10:33,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 21:10:33,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-07-19 21:10:33,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1040 transitions. [2022-07-19 21:10:33,304 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7580174927113703 [2022-07-19 21:10:33,304 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1040 transitions. [2022-07-19 21:10:33,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1040 transitions. [2022-07-19 21:10:33,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:10:33,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1040 transitions. [2022-07-19 21:10:33,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 74.28571428571429) internal successors, (1040), 14 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:10:33,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 98.0) internal successors, (1470), 15 states have internal predecessors, (1470), 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-19 21:10:33,310 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 98.0) internal successors, (1470), 15 states have internal predecessors, (1470), 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-19 21:10:33,310 INFO L186 Difference]: Start difference. First operand has 106 places, 83 transitions, 226 flow. Second operand 14 states and 1040 transitions. [2022-07-19 21:10:33,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 118 transitions, 414 flow [2022-07-19 21:10:33,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 118 transitions, 368 flow, removed 13 selfloop flow, removed 13 redundant places. [2022-07-19 21:10:33,314 INFO L242 Difference]: Finished difference. Result has 112 places, 91 transitions, 267 flow [2022-07-19 21:10:33,315 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=267, PETRI_PLACES=112, PETRI_TRANSITIONS=91} [2022-07-19 21:10:33,316 INFO L279 CegarLoopForPetriNet]: 101 programPoint places, 11 predicate places. [2022-07-19 21:10:33,317 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 91 transitions, 267 flow [2022-07-19 21:10:33,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 72.3) internal successors, (723), 10 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:10:33,317 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:10:33,317 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] [2022-07-19 21:10:33,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 21:10:33,318 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-19 21:10:33,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:10:33,318 INFO L85 PathProgramCache]: Analyzing trace with hash -671371529, now seen corresponding path program 2 times [2022-07-19 21:10:33,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:10:33,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895616896] [2022-07-19 21:10:33,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:10:33,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:10:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:10:33,670 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-19 21:10:33,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:10:33,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895616896] [2022-07-19 21:10:33,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895616896] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:10:33,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:10:33,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-19 21:10:33,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147862686] [2022-07-19 21:10:33,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:10:33,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 21:10:33,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:10:33,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 21:10:33,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-19 21:10:33,678 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 98 [2022-07-19 21:10:33,679 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 91 transitions, 267 flow. Second operand has 12 states, 12 states have (on average 72.83333333333333) internal successors, (874), 12 states have internal predecessors, (874), 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-19 21:10:33,679 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:10:33,679 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 98 [2022-07-19 21:10:33,680 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:10:34,050 INFO L129 PetriNetUnfolder]: 14/242 cut-off events. [2022-07-19 21:10:34,050 INFO L130 PetriNetUnfolder]: For 64/70 co-relation queries the response was YES. [2022-07-19 21:10:34,051 INFO L84 FinitePrefix]: Finished finitePrefix Result has 457 conditions, 242 events. 14/242 cut-off events. For 64/70 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 960 event pairs, 1 based on Foata normal form. 2/242 useless extension candidates. Maximal degree in co-relation 434. Up to 23 conditions per place. [2022-07-19 21:10:34,053 INFO L132 encePairwiseOnDemand]: 87/98 looper letters, 18 selfloop transitions, 8 changer transitions 10/101 dead transitions. [2022-07-19 21:10:34,053 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 101 transitions, 396 flow [2022-07-19 21:10:34,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 21:10:34,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-07-19 21:10:34,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 883 transitions. [2022-07-19 21:10:34,056 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7508503401360545 [2022-07-19 21:10:34,056 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 883 transitions. [2022-07-19 21:10:34,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 883 transitions. [2022-07-19 21:10:34,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:10:34,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 883 transitions. [2022-07-19 21:10:34,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 73.58333333333333) internal successors, (883), 12 states have internal predecessors, (883), 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-19 21:10:34,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 98.0) internal successors, (1274), 13 states have internal predecessors, (1274), 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-19 21:10:34,060 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 98.0) internal successors, (1274), 13 states have internal predecessors, (1274), 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-19 21:10:34,060 INFO L186 Difference]: Start difference. First operand has 112 places, 91 transitions, 267 flow. Second operand 12 states and 883 transitions. [2022-07-19 21:10:34,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 101 transitions, 396 flow [2022-07-19 21:10:34,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 101 transitions, 372 flow, removed 10 selfloop flow, removed 7 redundant places. [2022-07-19 21:10:34,064 INFO L242 Difference]: Finished difference. Result has 115 places, 91 transitions, 282 flow [2022-07-19 21:10:34,064 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=282, PETRI_PLACES=115, PETRI_TRANSITIONS=91} [2022-07-19 21:10:34,065 INFO L279 CegarLoopForPetriNet]: 101 programPoint places, 14 predicate places. [2022-07-19 21:10:34,065 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 91 transitions, 282 flow [2022-07-19 21:10:34,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 72.83333333333333) internal successors, (874), 12 states have internal predecessors, (874), 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-19 21:10:34,066 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:10:34,066 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] [2022-07-19 21:10:34,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 21:10:34,066 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-19 21:10:34,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:10:34,067 INFO L85 PathProgramCache]: Analyzing trace with hash 363677201, now seen corresponding path program 3 times [2022-07-19 21:10:34,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:10:34,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038512615] [2022-07-19 21:10:34,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:10:34,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:10:34,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:10:34,213 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-19 21:10:34,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:10:34,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038512615] [2022-07-19 21:10:34,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038512615] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:10:34,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:10:34,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 21:10:34,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343811524] [2022-07-19 21:10:34,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:10:34,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 21:10:34,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:10:34,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 21:10:34,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-19 21:10:34,216 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 98 [2022-07-19 21:10:34,216 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 91 transitions, 282 flow. Second operand has 8 states, 8 states have (on average 74.625) internal successors, (597), 8 states have internal predecessors, (597), 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-19 21:10:34,217 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:10:34,217 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 98 [2022-07-19 21:10:34,217 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:10:34,347 INFO L129 PetriNetUnfolder]: 20/247 cut-off events. [2022-07-19 21:10:34,348 INFO L130 PetriNetUnfolder]: For 109/109 co-relation queries the response was YES. [2022-07-19 21:10:34,348 INFO L84 FinitePrefix]: Finished finitePrefix Result has 529 conditions, 247 events. 20/247 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 965 event pairs, 5 based on Foata normal form. 2/247 useless extension candidates. Maximal degree in co-relation 512. Up to 41 conditions per place. [2022-07-19 21:10:34,349 INFO L132 encePairwiseOnDemand]: 88/98 looper letters, 16 selfloop transitions, 5 changer transitions 18/101 dead transitions. [2022-07-19 21:10:34,349 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 101 transitions, 410 flow [2022-07-19 21:10:34,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 21:10:34,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-19 21:10:34,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 611 transitions. [2022-07-19 21:10:34,351 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7793367346938775 [2022-07-19 21:10:34,351 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 611 transitions. [2022-07-19 21:10:34,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 611 transitions. [2022-07-19 21:10:34,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:10:34,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 611 transitions. [2022-07-19 21:10:34,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 76.375) internal successors, (611), 8 states have internal predecessors, (611), 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-19 21:10:34,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 98.0) internal successors, (882), 9 states have internal predecessors, (882), 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-19 21:10:34,354 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 98.0) internal successors, (882), 9 states have internal predecessors, (882), 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-19 21:10:34,354 INFO L186 Difference]: Start difference. First operand has 115 places, 91 transitions, 282 flow. Second operand 8 states and 611 transitions. [2022-07-19 21:10:34,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 101 transitions, 410 flow [2022-07-19 21:10:34,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 101 transitions, 377 flow, removed 7 selfloop flow, removed 10 redundant places. [2022-07-19 21:10:34,356 INFO L242 Difference]: Finished difference. Result has 112 places, 83 transitions, 229 flow [2022-07-19 21:10:34,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=229, PETRI_PLACES=112, PETRI_TRANSITIONS=83} [2022-07-19 21:10:34,357 INFO L279 CegarLoopForPetriNet]: 101 programPoint places, 11 predicate places. [2022-07-19 21:10:34,357 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 83 transitions, 229 flow [2022-07-19 21:10:34,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 74.625) internal successors, (597), 8 states have internal predecessors, (597), 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-19 21:10:34,358 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:10:34,358 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] [2022-07-19 21:10:34,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 21:10:34,358 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-19 21:10:34,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:10:34,359 INFO L85 PathProgramCache]: Analyzing trace with hash 976104011, now seen corresponding path program 4 times [2022-07-19 21:10:34,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:10:34,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413789602] [2022-07-19 21:10:34,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:10:34,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:10:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 21:10:34,400 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 21:10:34,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 21:10:34,473 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 21:10:34,473 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 21:10:34,474 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-07-19 21:10:34,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-07-19 21:10:34,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-07-19 21:10:34,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-07-19 21:10:34,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-07-19 21:10:34,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 21:10:34,476 INFO L356 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2022-07-19 21:10:34,480 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-19 21:10:34,480 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 21:10:34,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 09:10:34 BasicIcfg [2022-07-19 21:10:34,555 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 21:10:34,555 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 21:10:34,555 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 21:10:34,556 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 21:10:34,556 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:10:30" (3/4) ... [2022-07-19 21:10:34,557 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-19 21:10:34,618 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 21:10:34,618 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 21:10:34,619 INFO L158 Benchmark]: Toolchain (without parser) took 5157.53ms. Allocated memory was 96.5MB in the beginning and 224.4MB in the end (delta: 127.9MB). Free memory was 61.1MB in the beginning and 132.1MB in the end (delta: -71.0MB). Peak memory consumption was 57.0MB. Max. memory is 16.1GB. [2022-07-19 21:10:34,619 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 75.5MB. Free memory is still 38.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 21:10:34,619 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.08ms. Allocated memory is still 96.5MB. Free memory was 60.9MB in the beginning and 58.1MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 21:10:34,619 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.69ms. Allocated memory is still 96.5MB. Free memory was 58.1MB in the beginning and 55.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 21:10:34,620 INFO L158 Benchmark]: Boogie Preprocessor took 50.65ms. Allocated memory is still 96.5MB. Free memory was 55.2MB in the beginning and 52.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 21:10:34,620 INFO L158 Benchmark]: RCFGBuilder took 787.54ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 52.7MB in the beginning and 82.8MB in the end (delta: -30.1MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. [2022-07-19 21:10:34,620 INFO L158 Benchmark]: TraceAbstraction took 3837.44ms. Allocated memory was 117.4MB in the beginning and 224.4MB in the end (delta: 107.0MB). Free memory was 81.8MB in the beginning and 159.5MB in the end (delta: -77.6MB). Peak memory consumption was 126.6MB. Max. memory is 16.1GB. [2022-07-19 21:10:34,620 INFO L158 Benchmark]: Witness Printer took 62.87ms. Allocated memory is still 224.4MB. Free memory was 159.5MB in the beginning and 132.1MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-07-19 21:10:34,621 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.22ms. Allocated memory is still 75.5MB. Free memory is still 38.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.08ms. Allocated memory is still 96.5MB. Free memory was 60.9MB in the beginning and 58.1MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.69ms. Allocated memory is still 96.5MB. Free memory was 58.1MB in the beginning and 55.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.65ms. Allocated memory is still 96.5MB. Free memory was 55.2MB in the beginning and 52.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 787.54ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 52.7MB in the beginning and 82.8MB in the end (delta: -30.1MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3837.44ms. Allocated memory was 117.4MB in the beginning and 224.4MB in the end (delta: 107.0MB). Free memory was 81.8MB in the beginning and 159.5MB in the end (delta: -77.6MB). Peak memory consumption was 126.6MB. Max. memory is 16.1GB. * Witness Printer took 62.87ms. Allocated memory is still 224.4MB. Free memory was 159.5MB in the beginning and 132.1MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L715] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L717] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L718] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L719] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L721] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L723] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L724] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L725] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L726] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L727] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L728] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L729] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L730] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L731] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L732] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L733] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L734] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L735] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L736] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L737] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L826] 0 pthread_t t1723; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1723={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t1723, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1723, ((void *)0), P0, ((void *)0))=-1, t1723={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L828] 0 pthread_t t1724; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1723={5:0}, t1724={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t1724, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1724, ((void *)0), P1, ((void *)0))=0, t1723={5:0}, t1724={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff1 = y$w_buff0 [L775] 2 y$w_buff0 = 1 [L776] 2 y$w_buff1_used = y$w_buff0_used [L777] 2 y$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L785] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 2 y$flush_delayed = weak$$choice2 [L788] 2 y$mem_tmp = y [L789] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L789] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 [L789] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L789] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L790] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L790] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L791] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L791] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L792] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L792] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L793] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L794] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L794] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L795] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L795] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L796] 2 __unbuffered_p1_EAX = y [L797] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L797] 2 y = y$flush_delayed ? y$mem_tmp : y [L798] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L801] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 y$flush_delayed = weak$$choice2 [L752] 1 y$mem_tmp = y [L753] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L753] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L754] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L754] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L755] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L755] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L756] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L756] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L757] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L758] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L759] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = y [L761] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L761] 1 y = y$flush_delayed ? y$mem_tmp : y [L762] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L804] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L804] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L805] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L805] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L806] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L806] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L807] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L807] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L808] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L808] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L811] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1723={5:0}, t1724={3:0}, weak$$choice0=2, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L833] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L833] RET 0 assume_abort_if_not(main$tmp_guard0) [L835] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L835] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L835] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L835] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L837] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L839] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L839] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L842] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1723={5:0}, t1724={3:0}, weak$$choice0=2, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 19]: 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: 827]: 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: 829]: 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 5 procedures, 117 locations, 5 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: 3.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 315 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 315 mSDsluCounter, 386 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 598 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 803 IncrementalHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 78 mSDtfsCounter, 803 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=282occurred in iteration=7, InterpolantAutomatonStates: 76, 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.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 640 NumberOfCodeBlocks, 640 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 555 ConstructedInterpolants, 0 QuantifiedInterpolants, 2842 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-19 21:10:34,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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