./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ae007674 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/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e73cda23545f4a54d3eef0093038f0fb79909f0b7b9d845db14abda8dd1f5281 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 02:50:51,932 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 02:50:51,934 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 02:50:51,954 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 02:50:51,954 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 02:50:51,955 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 02:50:51,956 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 02:50:51,958 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 02:50:51,959 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 02:50:51,959 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 02:50:51,960 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 02:50:51,961 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 02:50:51,961 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 02:50:51,962 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 02:50:51,963 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 02:50:51,963 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 02:50:51,964 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 02:50:51,964 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 02:50:51,966 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 02:50:51,967 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 02:50:51,968 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 02:50:51,969 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 02:50:51,969 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 02:50:51,970 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 02:50:51,971 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 02:50:51,972 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 02:50:51,972 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 02:50:51,973 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 02:50:51,973 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 02:50:51,973 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 02:50:51,974 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 02:50:51,974 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 02:50:51,976 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 02:50:51,977 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 02:50:51,977 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 02:50:51,977 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 02:50:51,978 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 02:50:51,978 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 02:50:51,978 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 02:50:51,979 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 02:50:51,979 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 02:50:51,980 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-28 02:50:51,994 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 02:50:51,994 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 02:50:51,995 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 02:50:51,995 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 02:50:51,995 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 02:50:51,996 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 02:50:51,996 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 02:50:51,996 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 02:50:51,996 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 02:50:51,996 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 02:50:51,997 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 02:50:51,997 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 02:50:51,997 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 02:50:51,997 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 02:50:51,997 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-28 02:50:51,997 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 02:50:51,997 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-28 02:50:51,998 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 02:50:51,998 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 02:50:51,998 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 02:50:51,998 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-28 02:50:51,998 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 02:50:51,998 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 02:50:51,998 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 02:50:51,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 02:50:51,999 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 02:50:51,999 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 02:50:52,003 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-28 02:50:52,003 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 02:50:52,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 02:50:52,004 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-28 02:50:52,004 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-28 02:50:52,004 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-28 02:50:52,004 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 -> e73cda23545f4a54d3eef0093038f0fb79909f0b7b9d845db14abda8dd1f5281 [2021-12-28 02:50:52,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 02:50:52,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 02:50:52,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 02:50:52,303 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 02:50:52,311 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 02:50:52,313 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2021-12-28 02:50:52,388 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3754b03b8/e33b487aceb642cb8959da34012c8d31/FLAG2712f301b [2021-12-28 02:50:52,905 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 02:50:52,906 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2021-12-28 02:50:52,923 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3754b03b8/e33b487aceb642cb8959da34012c8d31/FLAG2712f301b [2021-12-28 02:50:53,415 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3754b03b8/e33b487aceb642cb8959da34012c8d31 [2021-12-28 02:50:53,418 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 02:50:53,421 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 02:50:53,422 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 02:50:53,422 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 02:50:53,425 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 02:50:53,426 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 02:50:53" (1/1) ... [2021-12-28 02:50:53,426 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71a901f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:50:53, skipping insertion in model container [2021-12-28 02:50:53,433 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 02:50:53" (1/1) ... [2021-12-28 02:50:53,447 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 02:50:53,531 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 02:50:53,757 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2021-12-28 02:50:54,008 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 02:50:54,014 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 02:50:54,026 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/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2021-12-28 02:50:54,106 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 02:50:54,158 INFO L208 MainTranslator]: Completed translation [2021-12-28 02:50:54,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:50:54 WrapperNode [2021-12-28 02:50:54,159 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 02:50:54,160 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 02:50:54,160 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 02:50:54,160 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 02:50:54,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:50:54" (1/1) ... [2021-12-28 02:50:54,189 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:50:54" (1/1) ... [2021-12-28 02:50:54,222 INFO L137 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 275 [2021-12-28 02:50:54,223 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 02:50:54,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 02:50:54,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 02:50:54,224 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 02:50:54,229 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:50:54" (1/1) ... [2021-12-28 02:50:54,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:50:54" (1/1) ... [2021-12-28 02:50:54,242 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:50:54" (1/1) ... [2021-12-28 02:50:54,244 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:50:54" (1/1) ... [2021-12-28 02:50:54,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:50:54" (1/1) ... [2021-12-28 02:50:54,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:50:54" (1/1) ... [2021-12-28 02:50:54,265 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:50:54" (1/1) ... [2021-12-28 02:50:54,270 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 02:50:54,273 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 02:50:54,273 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 02:50:54,273 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 02:50:54,274 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:50:54" (1/1) ... [2021-12-28 02:50:54,292 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 02:50:54,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 02:50:54,369 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-28 02:50:54,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-28 02:50:54,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-28 02:50:54,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-28 02:50:54,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 02:50:54,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-28 02:50:54,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 02:50:54,398 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-28 02:50:54,398 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-28 02:50:54,398 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-28 02:50:54,398 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-28 02:50:54,399 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-12-28 02:50:54,399 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-12-28 02:50:54,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 02:50:54,399 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-28 02:50:54,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 02:50:54,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 02:50:54,401 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-28 02:50:54,547 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 02:50:54,548 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 02:50:54,889 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 02:50:55,315 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 02:50:55,315 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-28 02:50:55,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:50:55 BoogieIcfgContainer [2021-12-28 02:50:55,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 02:50:55,318 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 02:50:55,318 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 02:50:55,320 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 02:50:55,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 02:50:53" (1/3) ... [2021-12-28 02:50:55,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ad3db6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 02:50:55, skipping insertion in model container [2021-12-28 02:50:55,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:50:54" (2/3) ... [2021-12-28 02:50:55,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ad3db6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 02:50:55, skipping insertion in model container [2021-12-28 02:50:55,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:50:55" (3/3) ... [2021-12-28 02:50:55,322 INFO L111 eAbstractionObserver]: Analyzing ICFG safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2021-12-28 02:50:55,326 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-28 02:50:55,326 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 02:50:55,326 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-28 02:50:55,326 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-28 02:50:55,353 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,353 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,353 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,354 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,354 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,354 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,354 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,354 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,354 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,355 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,355 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,355 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,355 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,355 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,356 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,356 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,356 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,356 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,356 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,357 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,357 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,357 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,357 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,358 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,358 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,358 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,358 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,358 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,358 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,359 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,359 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,359 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,360 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,360 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,360 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,360 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,360 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,360 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,361 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,361 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,361 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,361 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,361 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,361 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,362 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,362 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,362 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,362 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,362 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,363 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,363 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,363 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,363 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,363 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,363 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,364 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,364 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,364 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,364 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,365 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,365 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,365 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,365 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,365 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,365 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,366 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,366 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,366 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,366 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,366 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,366 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,366 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,367 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,367 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,367 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,367 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,367 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,368 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,368 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,368 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,368 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,368 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,369 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,369 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,369 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,369 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,371 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,371 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,372 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,372 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,372 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,372 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,372 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,372 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,373 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,373 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,373 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,373 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,374 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,374 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,374 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,374 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,374 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,374 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,374 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,375 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,375 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,375 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,375 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,375 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,376 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,376 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,376 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,376 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,376 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,376 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,376 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,377 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:50:55,377 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-28 02:50:55,405 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 02:50:55,409 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-28 02:50:55,409 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-12-28 02:50:55,416 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2021-12-28 02:50:55,450 INFO L129 PetriNetUnfolder]: 2/112 cut-off events. [2021-12-28 02:50:55,451 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-28 02:50:55,453 INFO L84 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2021-12-28 02:50:55,453 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow [2021-12-28 02:50:55,456 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2021-12-28 02:50:55,462 INFO L129 PetriNetUnfolder]: 0/45 cut-off events. [2021-12-28 02:50:55,462 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-28 02:50:55,463 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:50:55,463 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:50:55,463 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-28 02:50:55,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:50:55,467 INFO L85 PathProgramCache]: Analyzing trace with hash 368334670, now seen corresponding path program 1 times [2021-12-28 02:50:55,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:50:55,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111268861] [2021-12-28 02:50:55,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:50:55,474 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:50:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:50:55,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:50:55,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:50:55,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111268861] [2021-12-28 02:50:55,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111268861] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:50:55,627 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:50:55,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 02:50:55,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604283755] [2021-12-28 02:50:55,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:50:55,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 02:50:55,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:50:55,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 02:50:55,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 02:50:55,652 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 115 [2021-12-28 02:50:55,654 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 112 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:55,654 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:50:55,654 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 115 [2021-12-28 02:50:55,655 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:50:55,746 INFO L129 PetriNetUnfolder]: 58/327 cut-off events. [2021-12-28 02:50:55,747 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-12-28 02:50:55,748 INFO L84 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 327 events. 58/327 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1349 event pairs, 10 based on Foata normal form. 12/322 useless extension candidates. Maximal degree in co-relation 404. Up to 79 conditions per place. [2021-12-28 02:50:55,751 INFO L132 encePairwiseOnDemand]: 110/115 looper letters, 14 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2021-12-28 02:50:55,751 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 114 transitions, 275 flow [2021-12-28 02:50:55,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 02:50:55,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-28 02:50:55,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2021-12-28 02:50:55,760 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9391304347826087 [2021-12-28 02:50:55,761 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 324 transitions. [2021-12-28 02:50:55,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 324 transitions. [2021-12-28 02:50:55,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:50:55,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 324 transitions. [2021-12-28 02:50:55,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:55,769 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:55,770 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:55,771 INFO L186 Difference]: Start difference. First operand has 120 places, 112 transitions, 233 flow. Second operand 3 states and 324 transitions. [2021-12-28 02:50:55,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 114 transitions, 275 flow [2021-12-28 02:50:55,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 114 transitions, 270 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-12-28 02:50:55,776 INFO L242 Difference]: Finished difference. Result has 117 places, 108 transitions, 226 flow [2021-12-28 02:50:55,777 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=117, PETRI_TRANSITIONS=108} [2021-12-28 02:50:55,779 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, -3 predicate places. [2021-12-28 02:50:55,779 INFO L470 AbstractCegarLoop]: Abstraction has has 117 places, 108 transitions, 226 flow [2021-12-28 02:50:55,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:55,780 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:50:55,780 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:50:55,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 02:50:55,781 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-28 02:50:55,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:50:55,781 INFO L85 PathProgramCache]: Analyzing trace with hash 916552258, now seen corresponding path program 1 times [2021-12-28 02:50:55,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:50:55,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250713042] [2021-12-28 02:50:55,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:50:55,782 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:50:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:50:55,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:50:55,944 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:50:55,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250713042] [2021-12-28 02:50:55,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250713042] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:50:55,947 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:50:55,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 02:50:55,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116671599] [2021-12-28 02:50:55,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:50:55,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 02:50:55,949 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:50:55,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 02:50:55,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 02:50:55,950 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 115 [2021-12-28 02:50:55,951 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 108 transitions, 226 flow. Second operand has 6 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:55,951 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:50:55,951 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 115 [2021-12-28 02:50:55,952 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:50:56,230 INFO L129 PetriNetUnfolder]: 331/1074 cut-off events. [2021-12-28 02:50:56,231 INFO L130 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2021-12-28 02:50:56,234 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1707 conditions, 1074 events. 331/1074 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 7187 event pairs, 60 based on Foata normal form. 0/1041 useless extension candidates. Maximal degree in co-relation 1655. Up to 257 conditions per place. [2021-12-28 02:50:56,236 INFO L132 encePairwiseOnDemand]: 109/115 looper letters, 18 selfloop transitions, 2 changer transitions 45/145 dead transitions. [2021-12-28 02:50:56,236 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 145 transitions, 422 flow [2021-12-28 02:50:56,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 02:50:56,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-28 02:50:56,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 902 transitions. [2021-12-28 02:50:56,241 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8714975845410629 [2021-12-28 02:50:56,241 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 902 transitions. [2021-12-28 02:50:56,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 902 transitions. [2021-12-28 02:50:56,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:50:56,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 902 transitions. [2021-12-28 02:50:56,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 100.22222222222223) internal successors, (902), 9 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:56,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:56,247 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:56,247 INFO L186 Difference]: Start difference. First operand has 117 places, 108 transitions, 226 flow. Second operand 9 states and 902 transitions. [2021-12-28 02:50:56,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 145 transitions, 422 flow [2021-12-28 02:50:56,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 145 transitions, 404 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-28 02:50:56,250 INFO L242 Difference]: Finished difference. Result has 130 places, 96 transitions, 218 flow [2021-12-28 02:50:56,250 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=218, PETRI_PLACES=130, PETRI_TRANSITIONS=96} [2021-12-28 02:50:56,251 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 10 predicate places. [2021-12-28 02:50:56,251 INFO L470 AbstractCegarLoop]: Abstraction has has 130 places, 96 transitions, 218 flow [2021-12-28 02:50:56,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:56,252 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:50:56,252 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:50:56,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 02:50:56,252 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-28 02:50:56,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:50:56,253 INFO L85 PathProgramCache]: Analyzing trace with hash -950691551, now seen corresponding path program 1 times [2021-12-28 02:50:56,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:50:56,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423417503] [2021-12-28 02:50:56,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:50:56,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:50:56,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:50:56,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:50:56,371 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:50:56,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423417503] [2021-12-28 02:50:56,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423417503] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:50:56,371 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:50:56,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 02:50:56,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360716668] [2021-12-28 02:50:56,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:50:56,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 02:50:56,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:50:56,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 02:50:56,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 02:50:56,374 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 115 [2021-12-28 02:50:56,374 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 96 transitions, 218 flow. Second operand has 6 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:56,374 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:50:56,374 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 115 [2021-12-28 02:50:56,375 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:50:56,604 INFO L129 PetriNetUnfolder]: 283/723 cut-off events. [2021-12-28 02:50:56,604 INFO L130 PetriNetUnfolder]: For 165/165 co-relation queries the response was YES. [2021-12-28 02:50:56,606 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1395 conditions, 723 events. 283/723 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3753 event pairs, 91 based on Foata normal form. 18/711 useless extension candidates. Maximal degree in co-relation 1336. Up to 241 conditions per place. [2021-12-28 02:50:56,608 INFO L132 encePairwiseOnDemand]: 109/115 looper letters, 19 selfloop transitions, 2 changer transitions 31/132 dead transitions. [2021-12-28 02:50:56,608 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 132 transitions, 414 flow [2021-12-28 02:50:56,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 02:50:56,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-28 02:50:56,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 900 transitions. [2021-12-28 02:50:56,610 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8695652173913043 [2021-12-28 02:50:56,610 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 900 transitions. [2021-12-28 02:50:56,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 900 transitions. [2021-12-28 02:50:56,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:50:56,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 900 transitions. [2021-12-28 02:50:56,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 100.0) internal successors, (900), 9 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:56,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:56,615 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:56,615 INFO L186 Difference]: Start difference. First operand has 130 places, 96 transitions, 218 flow. Second operand 9 states and 900 transitions. [2021-12-28 02:50:56,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 132 transitions, 414 flow [2021-12-28 02:50:56,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 132 transitions, 382 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-12-28 02:50:56,620 INFO L242 Difference]: Finished difference. Result has 119 places, 96 transitions, 222 flow [2021-12-28 02:50:56,620 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=222, PETRI_PLACES=119, PETRI_TRANSITIONS=96} [2021-12-28 02:50:56,621 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, -1 predicate places. [2021-12-28 02:50:56,621 INFO L470 AbstractCegarLoop]: Abstraction has has 119 places, 96 transitions, 222 flow [2021-12-28 02:50:56,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:56,621 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:50:56,621 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:50:56,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 02:50:56,622 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-28 02:50:56,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:50:56,622 INFO L85 PathProgramCache]: Analyzing trace with hash 595503234, now seen corresponding path program 1 times [2021-12-28 02:50:56,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:50:56,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357267666] [2021-12-28 02:50:56,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:50:56,623 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:50:56,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:50:56,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:50:56,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:50:56,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357267666] [2021-12-28 02:50:56,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357267666] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:50:56,729 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:50:56,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 02:50:56,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814422449] [2021-12-28 02:50:56,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:50:56,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 02:50:56,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:50:56,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 02:50:56,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 02:50:56,731 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 115 [2021-12-28 02:50:56,732 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 96 transitions, 222 flow. Second operand has 7 states, 7 states have (on average 93.85714285714286) internal successors, (657), 7 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:56,732 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:50:56,732 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 115 [2021-12-28 02:50:56,732 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:50:57,023 INFO L129 PetriNetUnfolder]: 356/872 cut-off events. [2021-12-28 02:50:57,023 INFO L130 PetriNetUnfolder]: For 212/212 co-relation queries the response was YES. [2021-12-28 02:50:57,025 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1715 conditions, 872 events. 356/872 cut-off events. For 212/212 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4822 event pairs, 62 based on Foata normal form. 18/848 useless extension candidates. Maximal degree in co-relation 1654. Up to 225 conditions per place. [2021-12-28 02:50:57,027 INFO L132 encePairwiseOnDemand]: 107/115 looper letters, 22 selfloop transitions, 4 changer transitions 35/139 dead transitions. [2021-12-28 02:50:57,027 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 139 transitions, 457 flow [2021-12-28 02:50:57,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 02:50:57,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-28 02:50:57,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 983 transitions. [2021-12-28 02:50:57,030 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8547826086956521 [2021-12-28 02:50:57,030 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 983 transitions. [2021-12-28 02:50:57,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 983 transitions. [2021-12-28 02:50:57,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:50:57,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 983 transitions. [2021-12-28 02:50:57,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 98.3) internal successors, (983), 10 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:57,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:57,035 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:57,035 INFO L186 Difference]: Start difference. First operand has 119 places, 96 transitions, 222 flow. Second operand 10 states and 983 transitions. [2021-12-28 02:50:57,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 139 transitions, 457 flow [2021-12-28 02:50:57,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 139 transitions, 425 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-12-28 02:50:57,039 INFO L242 Difference]: Finished difference. Result has 122 places, 96 transitions, 236 flow [2021-12-28 02:50:57,039 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=236, PETRI_PLACES=122, PETRI_TRANSITIONS=96} [2021-12-28 02:50:57,040 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 2 predicate places. [2021-12-28 02:50:57,040 INFO L470 AbstractCegarLoop]: Abstraction has has 122 places, 96 transitions, 236 flow [2021-12-28 02:50:57,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.85714285714286) internal successors, (657), 7 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:57,041 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:50:57,041 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:50:57,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 02:50:57,041 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-28 02:50:57,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:50:57,042 INFO L85 PathProgramCache]: Analyzing trace with hash -193007379, now seen corresponding path program 1 times [2021-12-28 02:50:57,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:50:57,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589163094] [2021-12-28 02:50:57,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:50:57,043 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:50:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:50:57,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:50:57,139 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:50:57,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589163094] [2021-12-28 02:50:57,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589163094] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:50:57,140 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:50:57,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 02:50:57,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500206517] [2021-12-28 02:50:57,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:50:57,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 02:50:57,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:50:57,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 02:50:57,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 02:50:57,142 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 115 [2021-12-28 02:50:57,142 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 96 transitions, 236 flow. Second operand has 7 states, 7 states have (on average 93.85714285714286) internal successors, (657), 7 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:57,142 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:50:57,142 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 115 [2021-12-28 02:50:57,143 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:50:57,388 INFO L129 PetriNetUnfolder]: 263/765 cut-off events. [2021-12-28 02:50:57,389 INFO L130 PetriNetUnfolder]: For 332/334 co-relation queries the response was YES. [2021-12-28 02:50:57,391 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1544 conditions, 765 events. 263/765 cut-off events. For 332/334 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4210 event pairs, 88 based on Foata normal form. 16/727 useless extension candidates. Maximal degree in co-relation 1479. Up to 147 conditions per place. [2021-12-28 02:50:57,392 INFO L132 encePairwiseOnDemand]: 107/115 looper letters, 20 selfloop transitions, 4 changer transitions 34/136 dead transitions. [2021-12-28 02:50:57,392 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 136 transitions, 471 flow [2021-12-28 02:50:57,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 02:50:57,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-28 02:50:57,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 980 transitions. [2021-12-28 02:50:57,395 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8521739130434782 [2021-12-28 02:50:57,395 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 980 transitions. [2021-12-28 02:50:57,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 980 transitions. [2021-12-28 02:50:57,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:50:57,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 980 transitions. [2021-12-28 02:50:57,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 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) [2021-12-28 02:50:57,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:57,399 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:57,399 INFO L186 Difference]: Start difference. First operand has 122 places, 96 transitions, 236 flow. Second operand 10 states and 980 transitions. [2021-12-28 02:50:57,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 136 transitions, 471 flow [2021-12-28 02:50:57,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 136 transitions, 421 flow, removed 20 selfloop flow, removed 10 redundant places. [2021-12-28 02:50:57,402 INFO L242 Difference]: Finished difference. Result has 123 places, 96 transitions, 240 flow [2021-12-28 02:50:57,402 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=240, PETRI_PLACES=123, PETRI_TRANSITIONS=96} [2021-12-28 02:50:57,403 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 3 predicate places. [2021-12-28 02:50:57,403 INFO L470 AbstractCegarLoop]: Abstraction has has 123 places, 96 transitions, 240 flow [2021-12-28 02:50:57,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.85714285714286) internal successors, (657), 7 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:57,404 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:50:57,404 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:50:57,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-28 02:50:57,404 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-28 02:50:57,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:50:57,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1758612861, now seen corresponding path program 1 times [2021-12-28 02:50:57,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:50:57,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227953259] [2021-12-28 02:50:57,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:50:57,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:50:57,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:50:57,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:50:57,596 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:50:57,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227953259] [2021-12-28 02:50:57,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227953259] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:50:57,597 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:50:57,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-28 02:50:57,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299315612] [2021-12-28 02:50:57,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:50:57,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-28 02:50:57,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:50:57,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-28 02:50:57,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-12-28 02:50:57,599 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 115 [2021-12-28 02:50:57,600 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 96 transitions, 240 flow. Second operand has 11 states, 11 states have (on average 90.54545454545455) internal successors, (996), 11 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:57,600 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:50:57,600 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 115 [2021-12-28 02:50:57,600 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:50:57,835 INFO L129 PetriNetUnfolder]: 191/524 cut-off events. [2021-12-28 02:50:57,835 INFO L130 PetriNetUnfolder]: For 236/237 co-relation queries the response was YES. [2021-12-28 02:50:57,836 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1063 conditions, 524 events. 191/524 cut-off events. For 236/237 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2150 event pairs, 57 based on Foata normal form. 12/521 useless extension candidates. Maximal degree in co-relation 993. Up to 202 conditions per place. [2021-12-28 02:50:57,838 INFO L132 encePairwiseOnDemand]: 101/115 looper letters, 20 selfloop transitions, 10 changer transitions 28/133 dead transitions. [2021-12-28 02:50:57,838 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 133 transitions, 462 flow [2021-12-28 02:50:57,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-28 02:50:57,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-12-28 02:50:57,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1395 transitions. [2021-12-28 02:50:57,841 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.808695652173913 [2021-12-28 02:50:57,841 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1395 transitions. [2021-12-28 02:50:57,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1395 transitions. [2021-12-28 02:50:57,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:50:57,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1395 transitions. [2021-12-28 02:50:57,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 93.0) internal successors, (1395), 15 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:57,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 115.0) internal successors, (1840), 16 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:57,847 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 115.0) internal successors, (1840), 16 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:57,847 INFO L186 Difference]: Start difference. First operand has 123 places, 96 transitions, 240 flow. Second operand 15 states and 1395 transitions. [2021-12-28 02:50:57,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 133 transitions, 462 flow [2021-12-28 02:50:57,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 133 transitions, 416 flow, removed 18 selfloop flow, removed 10 redundant places. [2021-12-28 02:50:57,851 INFO L242 Difference]: Finished difference. Result has 128 places, 99 transitions, 282 flow [2021-12-28 02:50:57,851 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=282, PETRI_PLACES=128, PETRI_TRANSITIONS=99} [2021-12-28 02:50:57,853 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 8 predicate places. [2021-12-28 02:50:57,853 INFO L470 AbstractCegarLoop]: Abstraction has has 128 places, 99 transitions, 282 flow [2021-12-28 02:50:57,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 90.54545454545455) internal successors, (996), 11 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:57,854 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:50:57,854 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:50:57,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-28 02:50:57,855 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-28 02:50:57,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:50:57,857 INFO L85 PathProgramCache]: Analyzing trace with hash 790007066, now seen corresponding path program 1 times [2021-12-28 02:50:57,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:50:57,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999583339] [2021-12-28 02:50:57,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:50:57,858 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:50:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:50:57,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:50:57,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:50:57,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999583339] [2021-12-28 02:50:57,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999583339] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:50:57,997 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:50:57,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 02:50:57,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821237644] [2021-12-28 02:50:57,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:50:57,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 02:50:58,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:50:58,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 02:50:58,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 02:50:58,002 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2021-12-28 02:50:58,003 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 99 transitions, 282 flow. Second operand has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:58,003 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:50:58,004 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2021-12-28 02:50:58,004 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:50:58,292 INFO L129 PetriNetUnfolder]: 708/1527 cut-off events. [2021-12-28 02:50:58,293 INFO L130 PetriNetUnfolder]: For 2873/2931 co-relation queries the response was YES. [2021-12-28 02:50:58,296 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4152 conditions, 1527 events. 708/1527 cut-off events. For 2873/2931 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8717 event pairs, 41 based on Foata normal form. 3/1473 useless extension candidates. Maximal degree in co-relation 4084. Up to 439 conditions per place. [2021-12-28 02:50:58,301 INFO L132 encePairwiseOnDemand]: 105/115 looper letters, 34 selfloop transitions, 7 changer transitions 40/158 dead transitions. [2021-12-28 02:50:58,301 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 158 transitions, 696 flow [2021-12-28 02:50:58,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 02:50:58,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-28 02:50:58,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 987 transitions. [2021-12-28 02:50:58,306 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8582608695652174 [2021-12-28 02:50:58,306 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 987 transitions. [2021-12-28 02:50:58,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 987 transitions. [2021-12-28 02:50:58,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:50:58,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 987 transitions. [2021-12-28 02:50:58,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 98.7) internal successors, (987), 10 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:58,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:58,310 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:58,310 INFO L186 Difference]: Start difference. First operand has 128 places, 99 transitions, 282 flow. Second operand 10 states and 987 transitions. [2021-12-28 02:50:58,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 158 transitions, 696 flow [2021-12-28 02:50:58,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 158 transitions, 668 flow, removed 3 selfloop flow, removed 10 redundant places. [2021-12-28 02:50:58,315 INFO L242 Difference]: Finished difference. Result has 127 places, 103 transitions, 322 flow [2021-12-28 02:50:58,315 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=322, PETRI_PLACES=127, PETRI_TRANSITIONS=103} [2021-12-28 02:50:58,315 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 7 predicate places. [2021-12-28 02:50:58,316 INFO L470 AbstractCegarLoop]: Abstraction has has 127 places, 103 transitions, 322 flow [2021-12-28 02:50:58,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:58,316 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:50:58,317 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:50:58,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-28 02:50:58,317 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-28 02:50:58,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:50:58,317 INFO L85 PathProgramCache]: Analyzing trace with hash 460481006, now seen corresponding path program 1 times [2021-12-28 02:50:58,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:50:58,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556123907] [2021-12-28 02:50:58,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:50:58,318 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:50:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:50:58,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:50:58,451 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:50:58,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556123907] [2021-12-28 02:50:58,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556123907] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:50:58,451 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:50:58,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 02:50:58,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138103381] [2021-12-28 02:50:58,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:50:58,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 02:50:58,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:50:58,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 02:50:58,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-28 02:50:58,453 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2021-12-28 02:50:58,454 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 103 transitions, 322 flow. Second operand has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:58,454 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:50:58,454 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2021-12-28 02:50:58,454 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:50:58,701 INFO L129 PetriNetUnfolder]: 316/884 cut-off events. [2021-12-28 02:50:58,701 INFO L130 PetriNetUnfolder]: For 2102/2151 co-relation queries the response was YES. [2021-12-28 02:50:58,703 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2870 conditions, 884 events. 316/884 cut-off events. For 2102/2151 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4927 event pairs, 26 based on Foata normal form. 26/896 useless extension candidates. Maximal degree in co-relation 2803. Up to 212 conditions per place. [2021-12-28 02:50:58,706 INFO L132 encePairwiseOnDemand]: 105/115 looper letters, 43 selfloop transitions, 18 changer transitions 22/160 dead transitions. [2021-12-28 02:50:58,706 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 160 transitions, 885 flow [2021-12-28 02:50:58,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-28 02:50:58,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-28 02:50:58,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1084 transitions. [2021-12-28 02:50:58,709 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8569169960474309 [2021-12-28 02:50:58,709 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1084 transitions. [2021-12-28 02:50:58,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1084 transitions. [2021-12-28 02:50:58,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:50:58,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1084 transitions. [2021-12-28 02:50:58,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 98.54545454545455) internal successors, (1084), 11 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:58,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 115.0) internal successors, (1380), 12 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:58,714 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 115.0) internal successors, (1380), 12 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:58,714 INFO L186 Difference]: Start difference. First operand has 127 places, 103 transitions, 322 flow. Second operand 11 states and 1084 transitions. [2021-12-28 02:50:58,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 160 transitions, 885 flow [2021-12-28 02:50:58,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 160 transitions, 865 flow, removed 5 selfloop flow, removed 5 redundant places. [2021-12-28 02:50:58,720 INFO L242 Difference]: Finished difference. Result has 134 places, 118 transitions, 495 flow [2021-12-28 02:50:58,720 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=495, PETRI_PLACES=134, PETRI_TRANSITIONS=118} [2021-12-28 02:50:58,722 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 14 predicate places. [2021-12-28 02:50:58,722 INFO L470 AbstractCegarLoop]: Abstraction has has 134 places, 118 transitions, 495 flow [2021-12-28 02:50:58,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:58,723 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:50:58,723 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:50:58,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-28 02:50:58,723 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-28 02:50:58,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:50:58,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1370597563, now seen corresponding path program 1 times [2021-12-28 02:50:58,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:50:58,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309824151] [2021-12-28 02:50:58,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:50:58,725 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:50:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:50:58,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:50:58,836 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:50:58,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309824151] [2021-12-28 02:50:58,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309824151] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:50:58,837 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:50:58,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 02:50:58,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423032211] [2021-12-28 02:50:58,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:50:58,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 02:50:58,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:50:58,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 02:50:58,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-28 02:50:58,839 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2021-12-28 02:50:58,840 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 118 transitions, 495 flow. Second operand has 8 states, 8 states have (on average 93.125) internal successors, (745), 8 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:58,840 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:50:58,840 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2021-12-28 02:50:58,840 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:50:59,099 INFO L129 PetriNetUnfolder]: 261/742 cut-off events. [2021-12-28 02:50:59,099 INFO L130 PetriNetUnfolder]: For 2681/2736 co-relation queries the response was YES. [2021-12-28 02:50:59,102 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2814 conditions, 742 events. 261/742 cut-off events. For 2681/2736 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4188 event pairs, 22 based on Foata normal form. 17/745 useless extension candidates. Maximal degree in co-relation 2743. Up to 178 conditions per place. [2021-12-28 02:50:59,104 INFO L132 encePairwiseOnDemand]: 105/115 looper letters, 36 selfloop transitions, 22 changer transitions 24/159 dead transitions. [2021-12-28 02:50:59,104 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 159 transitions, 951 flow [2021-12-28 02:50:59,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-28 02:50:59,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-28 02:50:59,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1348 transitions. [2021-12-28 02:50:59,118 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8372670807453416 [2021-12-28 02:50:59,118 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1348 transitions. [2021-12-28 02:50:59,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1348 transitions. [2021-12-28 02:50:59,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:50:59,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1348 transitions. [2021-12-28 02:50:59,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 96.28571428571429) internal successors, (1348), 14 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:59,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 115.0) internal successors, (1725), 15 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:59,124 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 115.0) internal successors, (1725), 15 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:59,124 INFO L186 Difference]: Start difference. First operand has 134 places, 118 transitions, 495 flow. Second operand 14 states and 1348 transitions. [2021-12-28 02:50:59,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 159 transitions, 951 flow [2021-12-28 02:50:59,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 159 transitions, 881 flow, removed 31 selfloop flow, removed 3 redundant places. [2021-12-28 02:50:59,149 INFO L242 Difference]: Finished difference. Result has 151 places, 119 transitions, 513 flow [2021-12-28 02:50:59,149 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=513, PETRI_PLACES=151, PETRI_TRANSITIONS=119} [2021-12-28 02:50:59,149 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 31 predicate places. [2021-12-28 02:50:59,150 INFO L470 AbstractCegarLoop]: Abstraction has has 151 places, 119 transitions, 513 flow [2021-12-28 02:50:59,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.125) internal successors, (745), 8 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:59,150 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:50:59,150 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:50:59,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-28 02:50:59,150 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-28 02:50:59,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:50:59,151 INFO L85 PathProgramCache]: Analyzing trace with hash 501952834, now seen corresponding path program 1 times [2021-12-28 02:50:59,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:50:59,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150609703] [2021-12-28 02:50:59,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:50:59,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:50:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:50:59,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:50:59,509 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:50:59,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150609703] [2021-12-28 02:50:59,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150609703] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:50:59,512 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:50:59,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-28 02:50:59,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146510886] [2021-12-28 02:50:59,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:50:59,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-28 02:50:59,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:50:59,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-28 02:50:59,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-12-28 02:50:59,515 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 115 [2021-12-28 02:50:59,516 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 119 transitions, 513 flow. Second operand has 13 states, 13 states have (on average 89.6923076923077) internal successors, (1166), 13 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:59,516 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:50:59,516 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 115 [2021-12-28 02:50:59,516 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:50:59,769 INFO L129 PetriNetUnfolder]: 80/544 cut-off events. [2021-12-28 02:50:59,769 INFO L130 PetriNetUnfolder]: For 1390/1473 co-relation queries the response was YES. [2021-12-28 02:50:59,772 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1624 conditions, 544 events. 80/544 cut-off events. For 1390/1473 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3680 event pairs, 0 based on Foata normal form. 1/518 useless extension candidates. Maximal degree in co-relation 1562. Up to 76 conditions per place. [2021-12-28 02:50:59,774 INFO L132 encePairwiseOnDemand]: 104/115 looper letters, 20 selfloop transitions, 8 changer transitions 7/129 dead transitions. [2021-12-28 02:50:59,774 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 129 transitions, 623 flow [2021-12-28 02:50:59,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-28 02:50:59,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-28 02:50:59,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1001 transitions. [2021-12-28 02:50:59,789 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7913043478260869 [2021-12-28 02:50:59,790 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1001 transitions. [2021-12-28 02:50:59,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1001 transitions. [2021-12-28 02:50:59,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:50:59,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1001 transitions. [2021-12-28 02:50:59,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 91.0) internal successors, (1001), 11 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:59,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 115.0) internal successors, (1380), 12 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:59,794 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 115.0) internal successors, (1380), 12 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:59,795 INFO L186 Difference]: Start difference. First operand has 151 places, 119 transitions, 513 flow. Second operand 11 states and 1001 transitions. [2021-12-28 02:50:59,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 129 transitions, 623 flow [2021-12-28 02:50:59,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 129 transitions, 515 flow, removed 36 selfloop flow, removed 16 redundant places. [2021-12-28 02:50:59,819 INFO L242 Difference]: Finished difference. Result has 146 places, 118 transitions, 440 flow [2021-12-28 02:50:59,819 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=440, PETRI_PLACES=146, PETRI_TRANSITIONS=118} [2021-12-28 02:50:59,820 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 26 predicate places. [2021-12-28 02:50:59,820 INFO L470 AbstractCegarLoop]: Abstraction has has 146 places, 118 transitions, 440 flow [2021-12-28 02:50:59,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 89.6923076923077) internal successors, (1166), 13 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:59,820 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:50:59,821 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:50:59,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-28 02:50:59,821 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-28 02:50:59,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:50:59,821 INFO L85 PathProgramCache]: Analyzing trace with hash 138615162, now seen corresponding path program 2 times [2021-12-28 02:50:59,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:50:59,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967836814] [2021-12-28 02:50:59,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:50:59,822 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:50:59,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 02:50:59,876 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 02:50:59,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 02:50:59,956 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 02:50:59,957 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-28 02:50:59,958 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2021-12-28 02:50:59,959 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2021-12-28 02:50:59,959 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2021-12-28 02:50:59,960 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2021-12-28 02:50:59,960 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2021-12-28 02:50:59,960 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2021-12-28 02:50:59,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-28 02:50:59,963 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:50:59,966 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-28 02:50:59,966 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-28 02:51:00,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 02:51:00 BasicIcfg [2021-12-28 02:51:00,069 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-28 02:51:00,070 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-28 02:51:00,070 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-28 02:51:00,070 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-28 02:51:00,070 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:50:55" (3/4) ... [2021-12-28 02:51:00,071 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-28 02:51:00,142 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-28 02:51:00,142 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-28 02:51:00,142 INFO L158 Benchmark]: Toolchain (without parser) took 6723.61ms. Allocated memory was 54.5MB in the beginning and 201.3MB in the end (delta: 146.8MB). Free memory was 29.9MB in the beginning and 86.2MB in the end (delta: -56.3MB). Peak memory consumption was 89.5MB. Max. memory is 16.1GB. [2021-12-28 02:51:00,143 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 54.5MB. Free memory was 36.7MB in the beginning and 36.6MB in the end (delta: 38.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 02:51:00,143 INFO L158 Benchmark]: CACSL2BoogieTranslator took 736.81ms. Allocated memory was 54.5MB in the beginning and 75.5MB in the end (delta: 21.0MB). Free memory was 29.7MB in the beginning and 46.0MB in the end (delta: -16.3MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2021-12-28 02:51:00,143 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.01ms. Allocated memory is still 75.5MB. Free memory was 46.0MB in the beginning and 43.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-28 02:51:00,143 INFO L158 Benchmark]: Boogie Preprocessor took 49.09ms. Allocated memory is still 75.5MB. Free memory was 43.1MB in the beginning and 40.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-28 02:51:00,144 INFO L158 Benchmark]: RCFGBuilder took 1044.15ms. Allocated memory was 75.5MB in the beginning and 96.5MB in the end (delta: 21.0MB). Free memory was 40.9MB in the beginning and 59.3MB in the end (delta: -18.5MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2021-12-28 02:51:00,144 INFO L158 Benchmark]: TraceAbstraction took 4750.64ms. Allocated memory was 96.5MB in the beginning and 201.3MB in the end (delta: 104.9MB). Free memory was 58.8MB in the beginning and 115.6MB in the end (delta: -56.8MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. [2021-12-28 02:51:00,144 INFO L158 Benchmark]: Witness Printer took 72.58ms. Allocated memory is still 201.3MB. Free memory was 115.6MB in the beginning and 86.2MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2021-12-28 02:51:00,145 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.13ms. Allocated memory is still 54.5MB. Free memory was 36.7MB in the beginning and 36.6MB in the end (delta: 38.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 736.81ms. Allocated memory was 54.5MB in the beginning and 75.5MB in the end (delta: 21.0MB). Free memory was 29.7MB in the beginning and 46.0MB in the end (delta: -16.3MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.01ms. Allocated memory is still 75.5MB. Free memory was 46.0MB in the beginning and 43.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.09ms. Allocated memory is still 75.5MB. Free memory was 43.1MB in the beginning and 40.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1044.15ms. Allocated memory was 75.5MB in the beginning and 96.5MB in the end (delta: 21.0MB). Free memory was 40.9MB in the beginning and 59.3MB in the end (delta: -18.5MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4750.64ms. Allocated memory was 96.5MB in the beginning and 201.3MB in the end (delta: 104.9MB). Free memory was 58.8MB in the beginning and 115.6MB in the end (delta: -56.8MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. * Witness Printer took 72.58ms. Allocated memory is still 201.3MB. Free memory was 115.6MB in the beginning and 86.2MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L719] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L721] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L722] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L723] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L724] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L725] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L726] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L727] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L728] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L729] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L730] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L731] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L732] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L733] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L734] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L735] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L736] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L737] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L738] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L739] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t1961; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1961={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L821] FCALL, FORK 0 pthread_create(&t1961, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1961, ((void *)0), P0, ((void *)0))=-2, t1961={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L822] 0 pthread_t t1962; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1961={5:0}, t1962={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] FCALL, FORK 0 pthread_create(&t1962, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1962, ((void *)0), P1, ((void *)0))=-1, t1961={5:0}, t1962={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L824] 0 pthread_t t1963; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1961={5:0}, t1962={6:0}, t1963={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] FCALL, FORK 0 pthread_create(&t1963, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1963, ((void *)0), P2, ((void *)0))=0, t1961={5:0}, t1962={6:0}, t1963={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 2 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L800] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L801] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L801] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L802] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1961={5:0}, t1962={6:0}, t1963={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L831] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L831] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L833] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L833] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L834] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L834] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L835] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L835] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 z$flush_delayed = weak$$choice2 [L841] 0 z$mem_tmp = z [L842] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L842] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L843] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L843] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L843] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L843] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L844] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L844] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L844] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L844] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L845] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L845] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L845] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L845] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L846] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L847] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L847] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L847] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L848] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L848] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L848] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L848] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L850] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L850] 0 z = z$flush_delayed ? z$mem_tmp : z [L851] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1961={5:0}, t1962={6:0}, t1963={3:0}, weak$$choice0=56, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 825]: 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: 823]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 142 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 515 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 515 mSDsluCounter, 341 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 724 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1064 IncrementalHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 71 mSDtfsCounter, 1064 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=513occurred in iteration=9, InterpolantAutomatonStates: 102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 865 NumberOfCodeBlocks, 865 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 766 ConstructedInterpolants, 0 QuantifiedInterpolants, 3353 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-28 02:51:00,174 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