./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/rfi004.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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/rfi004.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 131a5c0bb00c7f6e11a814871ba4a0d65133507ca6f79e4b87c2742dbe2c5590 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 21:25:14,684 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 21:25:14,686 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 21:25:14,713 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 21:25:14,715 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 21:25:14,716 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 21:25:14,720 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 21:25:14,725 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 21:25:14,726 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 21:25:14,731 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 21:25:14,732 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 21:25:14,734 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 21:25:14,734 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 21:25:14,735 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 21:25:14,737 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 21:25:14,738 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 21:25:14,739 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 21:25:14,740 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 21:25:14,742 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 21:25:14,747 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 21:25:14,748 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 21:25:14,749 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 21:25:14,749 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 21:25:14,750 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 21:25:14,752 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 21:25:14,757 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 21:25:14,757 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 21:25:14,758 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 21:25:14,759 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 21:25:14,759 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 21:25:14,760 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 21:25:14,761 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 21:25:14,762 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 21:25:14,762 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 21:25:14,763 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 21:25:14,764 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 21:25:14,764 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 21:25:14,765 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 21:25:14,765 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 21:25:14,765 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 21:25:14,765 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 21:25:14,767 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 21:25:14,768 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 21:25:14,795 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 21:25:14,796 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 21:25:14,796 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 21:25:14,796 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 21:25:14,797 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 21:25:14,797 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 21:25:14,798 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 21:25:14,798 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 21:25:14,798 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 21:25:14,799 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 21:25:14,799 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 21:25:14,799 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 21:25:14,799 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 21:25:14,799 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 21:25:14,800 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 21:25:14,800 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 21:25:14,800 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 21:25:14,800 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 21:25:14,800 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 21:25:14,800 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 21:25:14,800 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 21:25:14,801 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 21:25:14,801 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 21:25:14,801 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 21:25:14,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 21:25:14,801 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 21:25:14,801 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 21:25:14,802 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 21:25:14,802 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 21:25:14,802 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 21:25:14,802 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 21:25:14,802 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 21:25:14,802 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 21:25:14,803 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 -> 131a5c0bb00c7f6e11a814871ba4a0d65133507ca6f79e4b87c2742dbe2c5590 [2022-07-22 21:25:14,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 21:25:14,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 21:25:14,998 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 21:25:14,999 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 21:25:15,000 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 21:25:15,001 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi004.i [2022-07-22 21:25:15,055 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c49a74ed/0cf1ccdc4f784a099eb7c08298c487ea/FLAGeb2d9aa24 [2022-07-22 21:25:15,464 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 21:25:15,464 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi004.i [2022-07-22 21:25:15,489 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c49a74ed/0cf1ccdc4f784a099eb7c08298c487ea/FLAGeb2d9aa24 [2022-07-22 21:25:15,799 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c49a74ed/0cf1ccdc4f784a099eb7c08298c487ea [2022-07-22 21:25:15,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 21:25:15,802 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 21:25:15,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 21:25:15,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 21:25:15,805 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 21:25:15,806 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:25:15" (1/1) ... [2022-07-22 21:25:15,807 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@707955d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:25:15, skipping insertion in model container [2022-07-22 21:25:15,807 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:25:15" (1/1) ... [2022-07-22 21:25:15,811 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 21:25:15,842 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 21:25:15,994 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/rfi004.i[983,996] [2022-07-22 21:25:16,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 21:25:16,183 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 21:25:16,192 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/rfi004.i[983,996] [2022-07-22 21:25:16,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 21:25:16,280 INFO L208 MainTranslator]: Completed translation [2022-07-22 21:25:16,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:25:16 WrapperNode [2022-07-22 21:25:16,281 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 21:25:16,282 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 21:25:16,282 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 21:25:16,282 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 21:25:16,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:25:16" (1/1) ... [2022-07-22 21:25:16,314 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:25:16" (1/1) ... [2022-07-22 21:25:16,338 INFO L137 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 169 [2022-07-22 21:25:16,338 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 21:25:16,339 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 21:25:16,339 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 21:25:16,339 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 21:25:16,345 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:25:16" (1/1) ... [2022-07-22 21:25:16,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:25:16" (1/1) ... [2022-07-22 21:25:16,360 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:25:16" (1/1) ... [2022-07-22 21:25:16,361 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:25:16" (1/1) ... [2022-07-22 21:25:16,366 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:25:16" (1/1) ... [2022-07-22 21:25:16,378 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:25:16" (1/1) ... [2022-07-22 21:25:16,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:25:16" (1/1) ... [2022-07-22 21:25:16,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 21:25:16,387 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 21:25:16,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 21:25:16,387 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 21:25:16,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:25:16" (1/1) ... [2022-07-22 21:25:16,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 21:25:16,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:25:16,437 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-22 21:25:16,457 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-22 21:25:16,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 21:25:16,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 21:25:16,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 21:25:16,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 21:25:16,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 21:25:16,473 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-22 21:25:16,473 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-22 21:25:16,473 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-22 21:25:16,473 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-22 21:25:16,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 21:25:16,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 21:25:16,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 21:25:16,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 21:25:16,475 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-22 21:25:16,567 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 21:25:16,568 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 21:25:16,936 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 21:25:17,127 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 21:25:17,127 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-22 21:25:17,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:25:17 BoogieIcfgContainer [2022-07-22 21:25:17,129 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 21:25:17,130 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 21:25:17,130 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 21:25:17,145 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 21:25:17,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 09:25:15" (1/3) ... [2022-07-22 21:25:17,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e877dae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:25:17, skipping insertion in model container [2022-07-22 21:25:17,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:25:16" (2/3) ... [2022-07-22 21:25:17,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e877dae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:25:17, skipping insertion in model container [2022-07-22 21:25:17,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:25:17" (3/3) ... [2022-07-22 21:25:17,147 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi004.i [2022-07-22 21:25:17,150 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-22 21:25:17,156 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 21:25:17,156 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-22 21:25:17,156 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-22 21:25:17,197 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-22 21:25:17,234 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 103 places, 98 transitions, 206 flow [2022-07-22 21:25:17,268 INFO L129 PetriNetUnfolder]: 2/96 cut-off events. [2022-07-22 21:25:17,268 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-22 21:25:17,270 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-22 21:25:17,271 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 98 transitions, 206 flow [2022-07-22 21:25:17,273 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 96 transitions, 198 flow [2022-07-22 21:25:17,286 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 21:25:17,290 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@288ab79a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@31f42a08 [2022-07-22 21:25:17,291 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-07-22 21:25:17,302 INFO L129 PetriNetUnfolder]: 0/59 cut-off events. [2022-07-22 21:25:17,303 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-22 21:25:17,303 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:25:17,303 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-22 21:25:17,304 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-22 21:25:17,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:25:17,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1407643271, now seen corresponding path program 1 times [2022-07-22 21:25:17,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:25:17,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700741110] [2022-07-22 21:25:17,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:25:17,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:25:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:25:17,613 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-22 21:25:17,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:25:17,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700741110] [2022-07-22 21:25:17,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700741110] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:25:17,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:25:17,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 21:25:17,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903308006] [2022-07-22 21:25:17,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:25:17,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 21:25:17,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:25:17,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 21:25:17,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 21:25:17,653 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 98 [2022-07-22 21:25:17,656 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 96 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 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-22 21:25:17,657 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:25:17,657 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 98 [2022-07-22 21:25:17,658 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:25:17,736 INFO L129 PetriNetUnfolder]: 10/162 cut-off events. [2022-07-22 21:25:17,737 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-22 21:25:17,738 INFO L84 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 162 events. 10/162 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 343 event pairs, 4 based on Foata normal form. 6/159 useless extension candidates. Maximal degree in co-relation 147. Up to 17 conditions per place. [2022-07-22 21:25:17,740 INFO L132 encePairwiseOnDemand]: 93/98 looper letters, 7 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2022-07-22 21:25:17,740 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 94 transitions, 212 flow [2022-07-22 21:25:17,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 21:25:17,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-22 21:25:17,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 275 transitions. [2022-07-22 21:25:17,757 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.935374149659864 [2022-07-22 21:25:17,758 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 275 transitions. [2022-07-22 21:25:17,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 275 transitions. [2022-07-22 21:25:17,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:25:17,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 275 transitions. [2022-07-22 21:25:17,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 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-22 21:25:17,776 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-22 21:25:17,776 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-22 21:25:17,778 INFO L186 Difference]: Start difference. First operand has 101 places, 96 transitions, 198 flow. Second operand 3 states and 275 transitions. [2022-07-22 21:25:17,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 94 transitions, 212 flow [2022-07-22 21:25:17,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 94 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-22 21:25:17,785 INFO L242 Difference]: Finished difference. Result has 99 places, 92 transitions, 192 flow [2022-07-22 21:25:17,786 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-22 21:25:17,789 INFO L279 CegarLoopForPetriNet]: 101 programPoint places, -2 predicate places. [2022-07-22 21:25:17,790 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 92 transitions, 192 flow [2022-07-22 21:25:17,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 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-22 21:25:17,791 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:25:17,791 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-22 21:25:17,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 21:25:17,792 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-22 21:25:17,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:25:17,792 INFO L85 PathProgramCache]: Analyzing trace with hash 434890909, now seen corresponding path program 1 times [2022-07-22 21:25:17,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:25:17,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580663831] [2022-07-22 21:25:17,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:25:17,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:25:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:25:17,986 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-22 21:25:17,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:25:17,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580663831] [2022-07-22 21:25:17,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580663831] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:25:17,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:25:17,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 21:25:17,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123104086] [2022-07-22 21:25:17,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:25:17,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 21:25:17,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:25:17,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 21:25:17,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 21:25:17,995 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 98 [2022-07-22 21:25:17,996 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 92 transitions, 192 flow. Second operand has 6 states, 6 states have (on average 80.66666666666667) internal successors, (484), 6 states have internal predecessors, (484), 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-22 21:25:17,996 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:25:17,996 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 98 [2022-07-22 21:25:17,996 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:25:18,310 INFO L129 PetriNetUnfolder]: 84/381 cut-off events. [2022-07-22 21:25:18,311 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-07-22 21:25:18,314 INFO L84 FinitePrefix]: Finished finitePrefix Result has 573 conditions, 381 events. 84/381 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1850 event pairs, 18 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 522. Up to 65 conditions per place. [2022-07-22 21:25:18,315 INFO L132 encePairwiseOnDemand]: 92/98 looper letters, 14 selfloop transitions, 2 changer transitions 34/118 dead transitions. [2022-07-22 21:25:18,315 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 118 transitions, 332 flow [2022-07-22 21:25:18,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 21:25:18,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-22 21:25:18,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 754 transitions. [2022-07-22 21:25:18,318 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.854875283446712 [2022-07-22 21:25:18,318 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 754 transitions. [2022-07-22 21:25:18,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 754 transitions. [2022-07-22 21:25:18,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:25:18,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 754 transitions. [2022-07-22 21:25:18,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 83.77777777777777) internal successors, (754), 9 states have internal predecessors, (754), 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-22 21:25:18,323 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-22 21:25:18,324 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-22 21:25:18,324 INFO L186 Difference]: Start difference. First operand has 99 places, 92 transitions, 192 flow. Second operand 9 states and 754 transitions. [2022-07-22 21:25:18,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 118 transitions, 332 flow [2022-07-22 21:25:18,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 118 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-22 21:25:18,328 INFO L242 Difference]: Finished difference. Result has 112 places, 82 transitions, 188 flow [2022-07-22 21:25:18,328 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-22 21:25:18,329 INFO L279 CegarLoopForPetriNet]: 101 programPoint places, 11 predicate places. [2022-07-22 21:25:18,329 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 82 transitions, 188 flow [2022-07-22 21:25:18,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.66666666666667) internal successors, (484), 6 states have internal predecessors, (484), 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-22 21:25:18,330 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:25:18,330 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] [2022-07-22 21:25:18,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 21:25:18,330 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-22 21:25:18,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:25:18,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1273998362, now seen corresponding path program 1 times [2022-07-22 21:25:18,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:25:18,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077452082] [2022-07-22 21:25:18,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:25:18,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:25:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:25:18,481 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-22 21:25:18,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:25:18,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077452082] [2022-07-22 21:25:18,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077452082] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:25:18,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:25:18,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 21:25:18,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743601241] [2022-07-22 21:25:18,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:25:18,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 21:25:18,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:25:18,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 21:25:18,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 21:25:18,486 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 98 [2022-07-22 21:25:18,487 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 82 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 79.83333333333333) internal successors, (479), 6 states have internal predecessors, (479), 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-22 21:25:18,487 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:25:18,487 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 98 [2022-07-22 21:25:18,488 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:25:18,651 INFO L129 PetriNetUnfolder]: 122/390 cut-off events. [2022-07-22 21:25:18,651 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-07-22 21:25:18,652 INFO L84 FinitePrefix]: Finished finitePrefix Result has 691 conditions, 390 events. 122/390 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1831 event pairs, 10 based on Foata normal form. 0/382 useless extension candidates. Maximal degree in co-relation 661. Up to 67 conditions per place. [2022-07-22 21:25:18,653 INFO L132 encePairwiseOnDemand]: 89/98 looper letters, 21 selfloop transitions, 5 changer transitions 35/127 dead transitions. [2022-07-22 21:25:18,653 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 127 transitions, 402 flow [2022-07-22 21:25:18,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 21:25:18,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-22 21:25:18,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 843 transitions. [2022-07-22 21:25:18,656 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.860204081632653 [2022-07-22 21:25:18,656 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 843 transitions. [2022-07-22 21:25:18,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 843 transitions. [2022-07-22 21:25:18,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:25:18,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 843 transitions. [2022-07-22 21:25:18,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 84.3) internal successors, (843), 10 states have internal predecessors, (843), 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-22 21:25:18,659 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-22 21:25:18,660 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-22 21:25:18,660 INFO L186 Difference]: Start difference. First operand has 112 places, 82 transitions, 188 flow. Second operand 10 states and 843 transitions. [2022-07-22 21:25:18,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 127 transitions, 402 flow [2022-07-22 21:25:18,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 127 transitions, 386 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-07-22 21:25:18,663 INFO L242 Difference]: Finished difference. Result has 103 places, 83 transitions, 214 flow [2022-07-22 21:25:18,663 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=214, PETRI_PLACES=103, PETRI_TRANSITIONS=83} [2022-07-22 21:25:18,664 INFO L279 CegarLoopForPetriNet]: 101 programPoint places, 2 predicate places. [2022-07-22 21:25:18,664 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 83 transitions, 214 flow [2022-07-22 21:25:18,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.83333333333333) internal successors, (479), 6 states have internal predecessors, (479), 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-22 21:25:18,665 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:25:18,665 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:25:18,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 21:25:18,665 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-22 21:25:18,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:25:18,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1742874355, now seen corresponding path program 1 times [2022-07-22 21:25:18,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:25:18,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020465044] [2022-07-22 21:25:18,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:25:18,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:25:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:25:18,774 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-22 21:25:18,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:25:18,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020465044] [2022-07-22 21:25:18,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020465044] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:25:18,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:25:18,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 21:25:18,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758212887] [2022-07-22 21:25:18,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:25:18,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:25:18,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:25:18,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:25:18,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 21:25:18,777 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 98 [2022-07-22 21:25:18,778 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 83 transitions, 214 flow. Second operand has 7 states, 7 states have (on average 79.85714285714286) internal successors, (559), 7 states have internal predecessors, (559), 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-22 21:25:18,778 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:25:18,778 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 98 [2022-07-22 21:25:18,778 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:25:18,917 INFO L129 PetriNetUnfolder]: 27/163 cut-off events. [2022-07-22 21:25:18,918 INFO L130 PetriNetUnfolder]: For 88/88 co-relation queries the response was YES. [2022-07-22 21:25:18,918 INFO L84 FinitePrefix]: Finished finitePrefix Result has 343 conditions, 163 events. 27/163 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 406 event pairs, 3 based on Foata normal form. 6/167 useless extension candidates. Maximal degree in co-relation 318. Up to 24 conditions per place. [2022-07-22 21:25:18,919 INFO L132 encePairwiseOnDemand]: 90/98 looper letters, 14 selfloop transitions, 7 changer transitions 17/104 dead transitions. [2022-07-22 21:25:18,919 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 104 transitions, 377 flow [2022-07-22 21:25:18,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 21:25:18,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-22 21:25:18,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 820 transitions. [2022-07-22 21:25:18,921 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8367346938775511 [2022-07-22 21:25:18,921 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 820 transitions. [2022-07-22 21:25:18,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 820 transitions. [2022-07-22 21:25:18,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:25:18,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 820 transitions. [2022-07-22 21:25:18,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 82.0) internal successors, (820), 10 states have internal predecessors, (820), 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-22 21:25:18,925 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-22 21:25:18,925 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-22 21:25:18,925 INFO L186 Difference]: Start difference. First operand has 103 places, 83 transitions, 214 flow. Second operand 10 states and 820 transitions. [2022-07-22 21:25:18,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 104 transitions, 377 flow [2022-07-22 21:25:18,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 104 transitions, 338 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-07-22 21:25:18,928 INFO L242 Difference]: Finished difference. Result has 106 places, 83 transitions, 226 flow [2022-07-22 21:25:18,928 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-22 21:25:18,929 INFO L279 CegarLoopForPetriNet]: 101 programPoint places, 5 predicate places. [2022-07-22 21:25:18,929 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 83 transitions, 226 flow [2022-07-22 21:25:18,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 79.85714285714286) internal successors, (559), 7 states have internal predecessors, (559), 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-22 21:25:18,930 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:25:18,930 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-22 21:25:18,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 21:25:18,930 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-22 21:25:18,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:25:18,931 INFO L85 PathProgramCache]: Analyzing trace with hash -616385355, now seen corresponding path program 1 times [2022-07-22 21:25:18,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:25:18,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735308641] [2022-07-22 21:25:18,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:25:18,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:25:18,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:25:19,170 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-22 21:25:19,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:25:19,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735308641] [2022-07-22 21:25:19,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735308641] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:25:19,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:25:19,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-22 21:25:19,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753189207] [2022-07-22 21:25:19,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:25:19,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 21:25:19,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:25:19,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 21:25:19,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-22 21:25:19,173 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 98 [2022-07-22 21:25:19,174 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 83 transitions, 226 flow. Second operand has 10 states, 10 states have (on average 75.9) internal successors, (759), 10 states have internal predecessors, (759), 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-22 21:25:19,174 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:25:19,174 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 98 [2022-07-22 21:25:19,174 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:25:19,353 INFO L129 PetriNetUnfolder]: 4/120 cut-off events. [2022-07-22 21:25:19,353 INFO L130 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2022-07-22 21:25:19,354 INFO L84 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 120 events. 4/120 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 132 event pairs, 1 based on Foata normal form. 1/120 useless extension candidates. Maximal degree in co-relation 177. Up to 12 conditions per place. [2022-07-22 21:25:19,354 INFO L132 encePairwiseOnDemand]: 89/98 looper letters, 16 selfloop transitions, 4 changer transitions 6/90 dead transitions. [2022-07-22 21:25:19,354 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 90 transitions, 292 flow [2022-07-22 21:25:19,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 21:25:19,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-22 21:25:19,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 767 transitions. [2022-07-22 21:25:19,364 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7826530612244897 [2022-07-22 21:25:19,364 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 767 transitions. [2022-07-22 21:25:19,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 767 transitions. [2022-07-22 21:25:19,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:25:19,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 767 transitions. [2022-07-22 21:25:19,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 76.7) internal successors, (767), 10 states have internal predecessors, (767), 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-22 21:25:19,367 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-22 21:25:19,369 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-22 21:25:19,369 INFO L186 Difference]: Start difference. First operand has 106 places, 83 transitions, 226 flow. Second operand 10 states and 767 transitions. [2022-07-22 21:25:19,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 90 transitions, 292 flow [2022-07-22 21:25:19,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 90 transitions, 246 flow, removed 13 selfloop flow, removed 13 redundant places. [2022-07-22 21:25:19,372 INFO L242 Difference]: Finished difference. Result has 103 places, 83 transitions, 199 flow [2022-07-22 21:25:19,373 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=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=199, PETRI_PLACES=103, PETRI_TRANSITIONS=83} [2022-07-22 21:25:19,375 INFO L279 CegarLoopForPetriNet]: 101 programPoint places, 2 predicate places. [2022-07-22 21:25:19,375 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 83 transitions, 199 flow [2022-07-22 21:25:19,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 75.9) internal successors, (759), 10 states have internal predecessors, (759), 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-22 21:25:19,376 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:25:19,376 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-22 21:25:19,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 21:25:19,377 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-22 21:25:19,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:25:19,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1909828917, now seen corresponding path program 2 times [2022-07-22 21:25:19,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:25:19,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464158767] [2022-07-22 21:25:19,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:25:19,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:25:19,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:25:19,517 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-22 21:25:19,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:25:19,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464158767] [2022-07-22 21:25:19,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464158767] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:25:19,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:25:19,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 21:25:19,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108736955] [2022-07-22 21:25:19,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:25:19,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:25:19,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:25:19,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:25:19,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 21:25:19,520 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 98 [2022-07-22 21:25:19,521 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 83 transitions, 199 flow. Second operand has 7 states, 7 states have (on average 79.28571428571429) internal successors, (555), 7 states have internal predecessors, (555), 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-22 21:25:19,521 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:25:19,521 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 98 [2022-07-22 21:25:19,521 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:25:19,616 INFO L129 PetriNetUnfolder]: 8/143 cut-off events. [2022-07-22 21:25:19,616 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-07-22 21:25:19,617 INFO L84 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 143 events. 8/143 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 253 event pairs, 2 based on Foata normal form. 1/141 useless extension candidates. Maximal degree in co-relation 221. Up to 21 conditions per place. [2022-07-22 21:25:19,617 INFO L132 encePairwiseOnDemand]: 92/98 looper letters, 15 selfloop transitions, 1 changer transitions 11/94 dead transitions. [2022-07-22 21:25:19,617 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 94 transitions, 293 flow [2022-07-22 21:25:19,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 21:25:19,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-22 21:25:19,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 567 transitions. [2022-07-22 21:25:19,619 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.826530612244898 [2022-07-22 21:25:19,619 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 567 transitions. [2022-07-22 21:25:19,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 567 transitions. [2022-07-22 21:25:19,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:25:19,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 567 transitions. [2022-07-22 21:25:19,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 81.0) internal successors, (567), 7 states have internal predecessors, (567), 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-22 21:25:19,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 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-22 21:25:19,623 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 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-22 21:25:19,623 INFO L186 Difference]: Start difference. First operand has 103 places, 83 transitions, 199 flow. Second operand 7 states and 567 transitions. [2022-07-22 21:25:19,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 94 transitions, 293 flow [2022-07-22 21:25:19,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 94 transitions, 268 flow, removed 7 selfloop flow, removed 8 redundant places. [2022-07-22 21:25:19,625 INFO L242 Difference]: Finished difference. Result has 102 places, 83 transitions, 197 flow [2022-07-22 21:25:19,625 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=197, PETRI_PLACES=102, PETRI_TRANSITIONS=83} [2022-07-22 21:25:19,627 INFO L279 CegarLoopForPetriNet]: 101 programPoint places, 1 predicate places. [2022-07-22 21:25:19,627 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 83 transitions, 197 flow [2022-07-22 21:25:19,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 79.28571428571429) internal successors, (555), 7 states have internal predecessors, (555), 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-22 21:25:19,628 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:25:19,628 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-22 21:25:19,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 21:25:19,628 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-22 21:25:19,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:25:19,629 INFO L85 PathProgramCache]: Analyzing trace with hash 6329727, now seen corresponding path program 3 times [2022-07-22 21:25:19,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:25:19,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467446999] [2022-07-22 21:25:19,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:25:19,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:25:19,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 21:25:19,671 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 21:25:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 21:25:19,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 21:25:19,759 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 21:25:19,759 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-07-22 21:25:19,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-07-22 21:25:19,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-07-22 21:25:19,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-07-22 21:25:19,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-07-22 21:25:19,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 21:25:19,765 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2022-07-22 21:25:19,770 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-22 21:25:19,770 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 21:25:19,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 09:25:19 BasicIcfg [2022-07-22 21:25:19,845 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 21:25:19,846 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 21:25:19,846 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 21:25:19,846 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 21:25:19,846 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:25:17" (3/4) ... [2022-07-22 21:25:19,855 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-22 21:25:19,965 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 21:25:19,972 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 21:25:19,973 INFO L158 Benchmark]: Toolchain (without parser) took 4170.76ms. Allocated memory was 94.4MB in the beginning and 190.8MB in the end (delta: 96.5MB). Free memory was 61.6MB in the beginning and 109.4MB in the end (delta: -47.8MB). Peak memory consumption was 47.0MB. Max. memory is 16.1GB. [2022-07-22 21:25:19,973 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 94.4MB. Free memory was 53.2MB in the beginning and 53.2MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 21:25:19,973 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.02ms. Allocated memory is still 94.4MB. Free memory was 61.4MB in the beginning and 56.6MB in the end (delta: 4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-22 21:25:19,973 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.84ms. Allocated memory is still 94.4MB. Free memory was 56.6MB in the beginning and 54.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 21:25:19,974 INFO L158 Benchmark]: Boogie Preprocessor took 46.99ms. Allocated memory is still 94.4MB. Free memory was 54.2MB in the beginning and 52.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 21:25:19,974 INFO L158 Benchmark]: RCFGBuilder took 742.47ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 52.1MB in the beginning and 70.3MB in the end (delta: -18.2MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2022-07-22 21:25:19,974 INFO L158 Benchmark]: TraceAbstraction took 2715.10ms. Allocated memory was 113.2MB in the beginning and 190.8MB in the end (delta: 77.6MB). Free memory was 69.7MB in the beginning and 130.3MB in the end (delta: -60.7MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2022-07-22 21:25:19,974 INFO L158 Benchmark]: Witness Printer took 126.56ms. Allocated memory is still 190.8MB. Free memory was 130.3MB in the beginning and 109.4MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-07-22 21:25:19,976 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.21ms. Allocated memory is still 94.4MB. Free memory was 53.2MB in the beginning and 53.2MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 478.02ms. Allocated memory is still 94.4MB. Free memory was 61.4MB in the beginning and 56.6MB in the end (delta: 4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.84ms. Allocated memory is still 94.4MB. Free memory was 56.6MB in the beginning and 54.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.99ms. Allocated memory is still 94.4MB. Free memory was 54.2MB in the beginning and 52.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 742.47ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 52.1MB in the beginning and 70.3MB in the end (delta: -18.2MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2715.10ms. Allocated memory was 113.2MB in the beginning and 190.8MB in the end (delta: 77.6MB). Free memory was 69.7MB in the beginning and 130.3MB in the end (delta: -60.7MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * Witness Printer took 126.56ms. Allocated memory is still 190.8MB. Free memory was 130.3MB in the beginning and 109.4MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. 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_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L715] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L716] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L717] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L719] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L721] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L722] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L723] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L724] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L725] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L726] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L727] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L728] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L729] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L730] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L731] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}] [L732] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L733] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L734] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L735] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L737] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, z=0] [L738] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, z=0] [L739] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, z=0] [L815] 0 pthread_t t1649; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1649={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, z=0] [L816] FCALL, FORK 0 pthread_create(&t1649, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1649, ((void *)0), P0, ((void *)0))=-1, t1649={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, z=0] [L817] 0 pthread_t t1650; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1649={5:0}, t1650={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, z=0] [L818] FCALL, FORK 0 pthread_create(&t1650, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1650, ((void *)0), P1, ((void *)0))=0, t1649={5:0}, t1650={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, z=0] [L773] 2 y$w_buff1 = y$w_buff0 [L774] 2 y$w_buff0 = 1 [L775] 2 y$w_buff1_used = y$w_buff0_used [L776] 2 y$w_buff0_used = (_Bool)1 [L777] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L777] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L778] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L779] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L780] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L781] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, z=0] [L784] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, z=1] [L787] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=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, z=1] [L790] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=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, z=1] [L743] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, weak$$choice2=0, 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, z=1] [L748] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L749] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L750] 1 y$flush_delayed = weak$$choice2 [L751] 1 y$mem_tmp = y [L752] 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) [L752] 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) [L753] 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)) [L753] EXPR 1 !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) [L753] 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)) [L753] 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)) [L754] 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)) [L754] EXPR 1 !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) [L754] 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)) [L754] 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)) [L755] 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)) [L755] EXPR 1 !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) [L755] 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)) [L755] 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)) [L756] 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)) [L756] EXPR 1 !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) [L756] 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)) [L756] 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)) [L757] 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)) [L757] EXPR 1 !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) [L757] 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)) [L757] 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)) [L758] 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)) [L758] EXPR 1 !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) [L758] 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)) [L758] 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)) [L759] 1 __unbuffered_p0_EAX = y [L760] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L760] 1 y = y$flush_delayed ? y$mem_tmp : y [L761] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=49, weak$$choice2=0, 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, z=1] [L793] 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) [L793] 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) [L794] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L794] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L795] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L795] 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 [L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L796] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L797] 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 [L766] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=49, weak$$choice2=0, 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, z=1] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=49, weak$$choice2=0, 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, z=1] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1649={5:0}, t1650={3:0}, weak$$choice0=49, weak$$choice2=0, 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, z=1] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=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=49, weak$$choice2=0, 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, z=1] [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 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) [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L824] 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) [L824] 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) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] 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 [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 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 [L831] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1649={5:0}, t1650={3:0}, weak$$choice0=49, weak$$choice2=0, 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, z=1] [L833] 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=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=49, weak$$choice2=0, 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, z=1] [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=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=49, weak$$choice2=0, 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, z=1] - 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: 818]: 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: 816]: 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: 2.5s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 177 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 177 mSDsluCounter, 178 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 290 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 404 IncrementalHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 38 mSDtfsCounter, 404 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=226occurred in iteration=4, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 491 NumberOfCodeBlocks, 491 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 408 ConstructedInterpolants, 0 QuantifiedInterpolants, 1257 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-22 21:25:20,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE